Boreale, Michele and De Nicola, Rocco A Symbolic Semantics for the pi-Calculus. Information and Computation, 126 (1). pp. 34-52. ISSN 0890-5401 (1996)Full text not available from this repository.
We use symbolic transition systems as a basis for providing theπ-calculus with an alternative semantics. The latter is more amenable to automatic manipulation and sheds light on the logical differences among different forms of bisimulation over algebras of name-passing processes. Symbolic transitions have the form[formula], whereφis a boolean combination of equalities on names that has to hold for the transition to take place, andαis standard aπ-calculus action. On top of the symbolic transition system, a symbolic bisimulation is defined that captures the standard ones. Finally, a sound and complete proof system is introduced for symbolic bisimulation.
|Additional Information:||An extended abstract of this paper appears in: B. Jonsson and J. Parrow (eds.), Proceedings of CONCUR'94, Lectures Notes in Computer Science 836, Springer-Verlag, 1994.|
|Funders:||Work partially supported by Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo Contract n. 93.01599.69, by Istituto di Elaborazione dell'Informatzione of C.N.R. at Pisa and by the EXPRESS project within the HCM program of EEC.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||08 Jun 2011 14:11|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)