Structured coalgebras and minimal HD-automata for the π-calculus

Theoretical Computer Science

Volumn 340, Issue 3, 2005, Pages 539-576

  Montanari, Ugo ^a   Pistore, Marco ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

calculus; Automata theory; Categorical models and logics; Coinductive techniques; Concurrency and distributed computation

Indexed keywords

ALGEBRA; AUTOMATA THEORY; COMPUTER SIMULATION; MATHEMATICAL MODELS; SEMANTICS;

Π-CALCULUS; CATEGORICAL MODELS AND LOGICS; COINDUCTIVE TECHNIQUES; CONCURRENCY AND DISTRIBUTED COMPUTATION;

COMPUTER SCIENCE;

EID: 23844436038     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.014     Document Type: Conference Paper

References (36)

1. M. Abadi, and A.D. Gordon A calculus for cryptographic protocols: the spi calculus Inform. Comput. 148 1 1999 1 70
2. R. Amadio, I. Castellani, and D. Sangiorgi On bisimulations for the asynchronous π -calculus Theoret. Comput. Sci. 192 2 1998 291 324
3. M. Baldamus, Compositional constructor interpretation over coalgebraic models for the π -calculus, in: Proc. CMCS 2000, ENTCS 33, Elsevier Science, Amsterdam, 2000.
4. M.G. Buscemi, U. Montanari, π -calculus early observational equivalence: a first order coalgebraic model, in: Proc. CONCUR'02, Lecture Notes in Computer Science, Vol. 2421, Springer, Berlin, 2002.
5. L. Cardelli, A.D. Gordon, Mobile ambients, in: Proc. FoSSaCS'98, Lecture Notes in Computer Science, Vol. 1378, Springer, Berlin, 1998.
6. A. Corradini, M. Große-Rhode, R. Heckel, Structured transition systems as lax coalgebras, in: Proc. CMCS'98, ENTCS 11, Elsevier Science, Amsterdam, 1998.
7. A. Corradini, R. Heckel, U. Montanari, From SOS specifications to structured coalgebras: how to make bisimulation a congruence, in: Proc. CMCS'99, ENTCS 19, Elsevier Science, Amsterdam, 1999.
8. A. Corradini, R. Heckel, and U. Montanari Compositional SOS and beyond: a coalgebraic view of open systems Theoret. Comput. Sci. 280 1-2 2002 163 192
9. R. De Simone Higher level synchronising devices in MEIJE-SCCS Theoret. Comput. Sci. 37 3 1985 245 267
10. G. Ferrari, G. Ferro, S. Gnesi, U. Montanari, M. Pistore, G. Ristori, An automata based verification environment for mobile processes, in: Proc. TACAS'97, Lecture Notes in Computer Science, Vol. 1217. Springer, Berlin, 1997.
11. G. Ferrari, S. Gnesi, U. Montanari, M. Pistore, G. Ristori. Verifying mobile processes in the HAL environment. in: Proc. CAV'98, Lecture Notes in Computer Science, Vol. 1427. Springer, Berlin, 1998.
12. M. Fiore, E. Moggi, D. Sangiorgi, A fully-abstract model for the π -calculus, in: Proc. LICS'96, IEEE Computer Society Press, Silver Spring, MD, 1996.
13. M. Fiore, G. Plotkin, D. Turi, Abstract syntax and variable binding, in: Proc. LICS'99, IEEE Computer Society Press, Silver Spring, MD, 1999.
14. C. Fournet, G. Gonthier, J.-L. Lévy, L. Maranget, D. Rémy, A calculus of mobile agents, in: Proc. CONCUR'96, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996.
15. M. Gabbay, A. Pitts, A new approach to abstract syntax involving binders, in: Proc. LICS'99, IEEE Computer Society Press, Silver Spring, MD, 1999.
16. M. Hennessy, J. Riely, A typed language for distributed mobile processes, in: Proc. POPL'98, ACM Press, New York, 1998.
17. M. Hofmann, Semantic analysis of higher-order abstract syntax, in: Proc. LICS'99, IEEE Computer Society Press, Silver Spring, MD, 1999.
18. F. Honsell, M. Lenisa, U. Montanari, M. Pistore, Final semantics for the pi-calculus, in: Proc. PROCOMET'98, Chapman & Hall, London, 1998.
19. F. Honsell, M. Miculan, I. Scagnetto, π -calculus in (co)inductive type theory, Technical Report, Dipartimento di Matematica e Informatica, Udine, 1998.
20. A. Joyal, M. Nielsen, and G. Winskel Bisimulation from open maps Inform. Comput. 127 2 1996 164 185
21. R. Milner, J. Parrow, and D. Walker A calculus of mobile processes (parts I and II) Inform. Comput. 100 1 1992 1 77
22. U. Montanari, M. Pistore, Checking bisimilarity for finitary π -calculus, in: Proc. CONCUR'95, Lecture Notes in Computer Science, Vol. 962, Springer, Berlin, 1995.
23. U. Montanari, M. Pistore, Minimal transition systems for history-preserving bisimulation, in: Proc. STACS'97, Lecture Notes in Computer Science, Vol. 1200, Springer, Berlin, 1997.
24. U. Montanari, M. Pistore, History dependent verification for partial order systems, in: Partial Order Methods in Verification, DIMACS Series 29, AMS, Providence, RI, 1997.
25. U. Montanari, M. Pistore, History dependent automata, Technical Report TR-11-98, Università di Pisa, Dipartimento di Informatica, 1998.
26. U. Montanari, M. Pistore, Finite state verification for the asynchronous π -calculus, in: Proc. TACAS'99, Lecture Notes in Computer Science, Vol. 1579, Springer, Berlin, 1999.
27. U. Montanari, M. Pistore, π -calculus, structured coalgebras and minimal HD-automata, in: Proc. MFCS'2000, Lecture Notes in Computer Science, Vol. 1893, Springer, Berlin, 2000.
28. U. Montanari, M. Pistore, D. Yankelevich, Efficient minimization up to location equivalence, in: Proc. ESOP'96, Lecture Notes in Computer Science, Vol. 1058, Springer, Berlin, 1996.
29. M. Pistore, History dependent automata, Ph.D. Thesis, TD-5/99, Università di Pisa, Dipartimento di Informatica, 1999. Available at the URL: http://www.di.unipi.it/phd/tesi/tesi_1999/TD-5-99.ps.gz
30. J.J.M.M. Rutten Universal coalgebra: a theory of systems Theoret. Comput. Sci. 249 1 2000 3 80
31. D. Sangiorgi, From π -calculus to higher-order π -calculus - and back, in: Proc. TAPSOFT'93, Lecture Notes in Computer Science, Vol. 668, Springer, Berlin, 1993.
32. D. Sangiorgi A theory of bisimulation for π -calculus Acta Informatica 33 1998 69 97
33. I. Stark, A fully abstract domain model for the pi-calculus, in: Proc. LICS'96, IEEE Computer Society Press, Silver Spring, MD, 1996.
34. D. Turi, G. Plotkin, Towards a mathematical operational semantics, in: Proc. of LICS'97, IEEE Computer Society Press, Silver Spring, MD, 1997.
35. J. Vitek, G. Castagna, Seal: a framework for secure mobile computations, in: Workshop on Internet Programming Languages, 1998.
36. D. Walker Objects in the π -calculus Inform. Comput. 116 2 1995 253 271