A first order coalgebraic model of π-calculus early observational equivalence

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2421 LNCS, Issue , 2002, Pages 449-465

  Buscemi, Maria Grazia ^a   Montanari, Ugo ^b  

^a UNIVERSITY OF CATANIA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BIOMINERALIZATION; SEMANTICS;

BISIMILARITY; COALGEBRAIC MODELS; COALGEBRAIC SEMANTICS; FIRST ORDER; OBSERVATIONAL EQUIVALENCES; PARALLEL COMPOSITION; PERMUTATION ALGEBRAS; TRANSITION SYSTEM; PI CALCULUS;

CALCULATIONS;

EID: 84874687784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_30     Document Type: Conference Paper

References (14)

1. A. Corradini, M. Große-Rhode, R. Heckel. Structured transition systems as lax coalgebras. In Proc. of CMCS'98, ENTS 11. Elsevier Science, 1998.
2. A. Corradini, R. Heckel, and U. Montanari. Compositional SOS and beyond: A coalgebraic view of open systems. Theoretical Computer Science 280:163-192, 2002.
3. R. De Simone. Higher level synchronising devices in MEIJE-SCCS. Theoretical Computer Science 37(3):245-267, 1985.
4. G. Ferrari, U. Montanari, and M. Pistore. Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation. In Proc. of FoSSaCS'02, LNCS 2303. Springer, 2002.
5. G. Ferrari, U. Montanari, and P. Quaglia. A pi-calculus with Explicit Substitutions. Theoretical Computer Science 168(1):53-103, 1996.
6. M. Fiore and D. Turi. Semantics of name and value passing. In Proc. of LICS'01, IEEE. Computer Society Press, 2001.
7. M. Gabbay and A. Pitts. A new approach to abstract syntax involving binders. In Proc. of LICS'99, IEEE. Computer Society Press, 1999.
8. R. Milner, J. Parrow, and D. Walker.A calculus of mobile processes (parts I and II). Information and Computation, 100(1):1-77, 1992.
9. U. Montanari and M. Pistore. Pi-Calculus, Structured Coalgebras and Minimal HD-Automata. In Proc. of MFCS'00, LNCS 1983. Springer, 2000.
10. U. Montanari and M. Pistore. Structured Coalgebras and Minimal HD-Automata for the pi-Calculus. Technical Report 0006-02, IRST-ITC, 2000. Available at the URL: http://sra.itc.it/paper.epl?id=MP00.
11. A. M. Pitts. Nominal Logic: A First Order Theory of Names and Binding. In Proc. of TACS'01, LNCS 2215. Springer, 2001.
12. M. Pistore. History Dependent Automata. PhD. 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.
13. J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1):3-80, 2000.
14. D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Proc. of LICS'97, IEEE. Computer Society Press, 1997.