J. Engelfriet and T. Gelsema. Multisets and structural congruence of the -calculus with replication. Report 2/95, Leiden University, 1996.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Automatically Proving Up-to Bisimulation - Hirschkoff (1998)   (1 citation)  (Correct)

...., as m(P ) # (P ) 1) # symb (P ) Gamma X in P # symb (scope( where # symb (X) denotes the number of symbols in X, # the number of restrictions, and given a term of the form (x) T , the scope of the restriction on x, written scope( is T . 2 A similar problem appears in [EG96], where normal forms do not enjoy the uniqueness property; however, this is not problematic in the framework of Engelfriet and Gelsema because their multiset semantics makes the locations of restrictions disappear, which amounts to quotientate with respect to law 6. 3 Note that rules R5 and R6 ....

....processes have been given for example for open bisimulation [San96b] this axiomatisation is used in the Mobility WorkBench) as well as for the fusion calculus [PV98] that is a promising language for the task of the implementation of verication methods. For replicated terms in the general case, [EG96] proves decidability for an extended version of structural congruence; in this work, any form of process can be replicated; we have chosen a smaller language to keep the reasoning about the up to techniques more clear. Future work A key theoretical issue that has to be studied regarding our ....

J. Engelfriet and T. Gelsema. Multisets and structural congruence of the -calculus with replication. Report 2/95, Leiden University, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC