An exercise in structural congruence

Information Processing Letters

Volumn 101, Issue 1, 2007, Pages 1-5

  Engelfriet, Joost ^a   Gelsema, Tjalling ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Commutative semigroup; Concurrency; Petri net; Pi calculus

Indexed keywords

CONCURRENCY CONTROL; DIFFERENTIATION (CALCULUS); PETRI NETS;

COMMUTATIVE SEMIGROUP; PI-CALCULUS; STRUCTURAL CONGRUENCE;

DATA PROCESSING;

EID: 33750340950     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.08.001     Document Type: Article

References (18)

1. Amadio R.M., and Meyssonnier C. On decidability of the control reachability problem in the asynchronous π-calculus. Nordic J. Comput. 9 (2002) 70-101
2. Busi N., and Gorrieri R. A Petri net semantics for π-calculus. Proc. Concur'95. Lecture Notes in Computer Science vol. 962 (1995), Springer, Berlin 145-159
3. Caires L., and Cardelli L. A spatial logic for concurrency (part I). Inform. and Comput. 186 (2003) 194-235
4. Cardelli L., and Gordon A.D. Mobile ambients. Theoret. Comput. Sci. 240 (2000) 177-213
5. Dal Zilio S. Spatial congruence for ambients is decidable. Proc. ASIAN'00-6th Asian Computing Science Conference. Lecture Notes in Computer Science vol. 1961 (2000), Springer, Berlin 88-103
6. Engelfriet J. A multiset semantics for the pi-calculus with replication. Theoret. Comput. Sci. 153 (1996) 65-94
7. Engelfriet J., and Gelsema T.E. Multisets and structural congruence of the pi-calculus with replication. Theoret. Comput. Sci. 211 (1999) 311-337
8. Engelfriet J., and Gelsema T.E. A new natural structural congruence in the pi-calculus with replication. Acta Inform. 40 (2004) 385-430
9. Engelfriet J., and Gelsema T.E. The decidability of structural congruence for replication restricted pi-calculus processes. LIACS Technical Report 2004-07, May 2004. http://www.liacs.nl/home/engelfri/repres.ps
10. D. Hirschkoff, Mise en oeuvre de preuves de bisimulation, Ph.D. thesis, École Nationale des Ponts et Chaussées, 1999
11. Mayr E.W. An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13 (1984) 441-460
12. Mayr E.W., and Meyer A.R. The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46 (1982) 305-329
13. Milner R. Functions as processes. Math. Struct. in Comput. Sci. 2 (1992) 119-141
14. Milner R. Communicating and Mobile Systems: the π-Calculus (1999), Cambridge University Press, Cambridge
15. R. Milner, Moca mailing list, May 15, 2001
16. Reutenauer C. The Mathematics of Petri Nets (1990), Prentice-Hall, New York
17. Sangiorgi D., and Walker D. The π-calculus: A Theory of Mobile Processes (2001), Cambridge University Press, Cambridge
18. P. Sobociński, Unpublished manuscript, 2001