A symbolic semantics for the π-calculus

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

Volumn 836 LNCS, Issue , 1994, Pages 299-314

  Boreale, Michele ^a   De Nicola, Rocco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BISIMULATIONS; BOOLEAN CONSTRAINT; DYNAMIC PROCESS; PI CALCULUS; PROOF SYSTEM; SYMBOLIC BISIMULATION; SYMBOLIC SEMANTICS; SYMBOLIC TRANSITION SYSTEMS;

CALCULATIONS;

EID: 0013367691     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48654-1_24     Document Type: Conference Paper

References (12)

1. M. Boreale and R. De Nicola. Testing equivalence for mobile processes. Technical Report SI 92 RR 04, Dipartimento di Scienze dell'Informazione Universita “La Sapienza”, Roma, 1992. Extended abstract appeared in: R. Cleaveland (ed.), Proceedings of CONCUR '92, LNCS 630, Springer-Verlag. Full version to appear in Information and Computation.
2. M. Boreale and R. De Nicola. A symbolic semantics for the 1!”-calculus. Technical Report Sl 94 RR 04, Dipartimento di Scienze dell'Informazione Universita “La Sapienza”, Roma, 1994.
3. M. Dam. Model checking mobile processes. In E. Best, editor, Proceedings of CONCUR '93, LNCS 715. Springer-Verlag, Berlin, 1993.
4. G. Ferrari, U. Montanari, and P. Quaglia. The 1!”-calculus with explicit substitutions. Technical report, Universita di Pisa, 1994. Accepted to MFCS'94.
5. M. Hennessy. A model for the 1!”-calculus. Technical report, University of Sussex, 1991.
6. M. Hennessy and H. Lin. Symbolic bisimulations. Technical report, University of Sussex, 1992.
7. M. Hennessy and H. Lin. Proof systems for message-passing process algebras. In E. Best, editor, Proceedings of CONCUR '93, LNCS 715. Springer Verlag, Berlin, 1993.
8. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
9. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part 1 and 2. Information and Computation, 100, 1992.
10. J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Technical report, University of Edinburgh, 1993. To appear in Information and Computation.
11. D. Sangiorgi. A theory of bisimulation for the 1!”-calculus. In E. Best, editor, Proceedings of CONCUR '93, LNCS 715. Springer-Verlag, Berlin, 1993.
12. D. Sangiorgi. On the bisimulation proof method. Technical report, University of Edinburgh, 1994. In preparation.