Abstract
The challenging problem of what is the most reasonable way to define open bisimulation for the π-calculus with mismatching is still open. In this paper, we give a full solution to this problem. First a reasonable definition of open bisimulation is presented and its equivalence and congruence are established. Then a symbolic version of open bisimulation is introduced and its soundness and completeness with respect to open bisimulation are proved. Finally, a symbolic proof system for open bisimulation is put forth and its soundness and completeness are also proved. In addition, the weak case is also discussed, and five t-laws are given to lift the symbolic proof system for strong open bisimulation to a complete inference system for open observation congruence in the π-calculus with mismatching.
This work is partially supported by NNSF of China (No.66073001 and No.69933030).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M.Boreale and R.De Nicola. A symbolic semantics for the π-calculus. In CONCUR’94, Lecture Notes in Computer Science, vol. 836. Springer-Verlag, 1994.
M.Dam. On the decidability of process equivalence for the π-calculus. Theoretical Computer Science, 183: 214-228, 1997.
M.Hennessy and H.Lin Symbolic bisimulations. Theoretical Computer Science,138:353-389,1995.
M.Hennessy and R.Milner. Algebraic laws for nondeterminism and concurrency. Journal of ACM,67:137-161,1985.
Z.Li and H.Chen. Checking strong/weak bisimulation equivalences and observation congruence for the π-calculus. In ICALP’98, Lecture Notes in Computer Science, vol. 1443. Springer-Verlag, 1998.
Z.Li and H.Chen. Computing strong/weak bisimulation equivalences and observation congruence for value-passing processes. In TACAS’99, Lecture Notes in Computer Science, vol. 1579, Springer-Verlag, 1999.
Z.Li, H.Chen, B.Wang. Symbolic transition graph and its early bisimulation checking algorithms for the π-calculus. Science In China (Series E), Vol. 42, No. 4: 342-353, 1999.
Z.Li. Theories and algorithms for the verification of bisimulation equivalences in value-passing CCS and the π-calculus. Doctorate thesis, Department of Computer Science, Changsha Institute of Technology, 1999.
H.Lin. A verification tool for value-passing processes. In Proceedings of 13th International Symposium on Protocol Specification, Testing and Verification, IFIP Transactions. North-Holland, 1993.
H.Lin. Symbolic bisimulations and proof systems for the π-calculus. Report 7/94, Computer Science, University of Sussex, 1994.
H.Lin. Complete inference systems for weak bisimulation equivalences in the 7-calculus. In TAPSOFT’95. Spring-Verlag, 1995.
H.Lin. Unique fixpoint induction for mobile processes. In CONCUR’95. Lecture Notes in Computer Science, vol. 962, Spring-Verlag, 1995.
H.Lin. Symbolic transition graph with assignment.In CONCUR’96, Lecture Notes in Computer Science, vol. 1119. Springer-Verlag, 1996.
H.Lin. Complete proof systems for observation congruences in finite control pi-calculus. In ICALP’98, Lecture Notes in Computer Science, vol. 1443, Spring-Verlag, 1998.
X.Liu.Characterizing bisimulation congruence in the π-calculus. In CONCUR’94, LNCS 836, Springer Verlag,1995.
R.Milner. Communication and Concurrency. Prentice-Hall, 1989
R.Milner, J.Parrow and D.Walker. A calculus of mobile processes, Part I,II. Information and Computation, 100:1-77, 1992.
U.Montanari and M.Pistore.Checking bisimilarity for finitary πcalculus.In CONCUR’95,LNCS 962.Springer Verlag,1995.
J.Parrow and D.Sangiorgi. Algebraic theories for name-passing calculi. Journal of Information and Computation, 1120(2): 174-197, 1995.
M.Pistore and D.Sangiorgi. A partition refinement algorithm for the π-calculus.In CAV’96,LNCS 1102.Spinger-Verlag,1996.
D.Sangiorgi.A theory of bisimulation for the it-calculus. In CONCUR’93,LNCS 715.Springer-Verlag,1993.
B.Victor and F.Moller.The mobility workbench-a tool for the π-calculus. In CAV’94, LNCS 818. Springer-Verlag, 1994.
B.Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. Ph.D thesis, Department of Computer Systems, Uppsala University, Sweden, June 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this paper
Cite this paper
Li, Z., Chen, H. (2001). Semantic Theory and Proof System of Open Bisimulation for the π-Calculus with Mismatching. In: Keimel, K., Zhang, GQ., Liu, YM., Chen, YX. (eds) Domains and Processes. Semantic Structures in Computation, vol 1. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0654-5_11
Download citation
DOI: https://doi.org/10.1007/978-94-010-0654-5_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-3859-1
Online ISBN: 978-94-010-0654-5
eBook Packages: Springer Book Archive