On the decidability of fragments of the asynchronous π-calculus

Electronic Notes in Theoretical Computer Science

Volumn 52, Issue 1, 2002, Pages 66-82

  Amadio, Roberto M ^a   Meyssonnier, Charles ^a  

^a AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONCURRENT ENGINEERING; OBJECT ORIENTED PROGRAMMING; PETRI NETS; SET THEORY; SYNCHRONIZATION; THEOREM PROVING;

COMMUNICATION MECHANISM; CONCURRENT PROGRAMMING LANGUAGES; DENUMERABLE SETS; PROCESS CALCULUS;

LINEAR ALGEBRA;

EID: 13644265790     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00217-8     Document Type: Conference Paper

References (18)

1. Amadio R., Castellani I., Sangiorgi D. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science. 195:1998;291-324
2. G. Boudol. Asynchrony and the π-calculus. Technical report, RR 1702, INRIA, Sophia-Antipolis, 1992.
3. M. Dam. Model checking mobile processes. Information and Computation, 1996. Preliminary version appeared in Proc. Concur'93.
4. C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, and D. Rémy. A calculus of mobile agents. In Proc. CONCUR 96, Springer Lect. Notes in Comp. Sci. 1119, 1996.
5. U. Golz and A. Mycroft. On the relationship of CCS and Petri Nets. Proc. ICALP84, Springer Lect. Notes in Comp. Sci. 172:196-208, 1984.
6. Hack M. Decidability questions for Petri Nets. 1979;Garland publishing Co
7. K. Honda and M. Tokoro. An object calculus for asynchronous communication. Proc. ECOOP 91, Geneve, Springer Lect. Notes in Comp. Sci. 612, pages 133-147, 1991.
8. Hopcroft J., Ullman J. Introduction to automata theory, languages, and computation. 1979;Addison-Wesley
9. Jancar P. Undecidability of bisimilarity for Petri Nets and related problems. Theoretical Computer Science. 148:1995;281-301
10. R. Lipton. The reachability problem requires exponential space. Technical Report TR 66, Yale University, 1976.
11. Milner R. Communication and Concurrency. 1989;Prentice Hall
12. U. Montanari and M. Pistore. Checking bisimilarity for finitary π-calculus. In CONCUR '95, Springer Lect. Notes in Comp. Sci. 962, 1995.
13. B. Pierce and D. Turner. Pict: a programming language based on the π-calculus. University of Cambridge, 1996.
14. Rackoff C. The covering and boundedness problem for vector addition systems. Theoretical Computer Science. 6:1978;223-231
15. Reutenauer C. Aspects mathématiques des réseaux de Petri. 1988;Masson Editeur. Also available in english: The mathematics of Petri Nets, Prentice-Hall
16. G. Sutre. Abstraction et accéleration de systémes infinis. PhD thesis, ENS Cachan, 2000.
17. V. Vasconcelos and R. Bastos. Core-TyCO, the language definition, version 0.1. Technical report TD98-3, University of Lisbon, 1998.
18. Yen H. A unified approach for deciding the existence of certain Petri Nets paths. Information and Control. 96:(1):1992;119-137