Abstract
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is bisimulation. In the synchronous pi calculus, it is well-known that the various natural definitions of (strong) bisimulation yield different relations. In contrast, for the asynchronous pi calculus, they collapse to a single relation. We show that the definitions transfer naturally from the pi calculus to the explicit fusion calculus (a symmetric variant of the synchronous pi calculus), where they also collapse, and yield a simpler theory.
The important property of explicit fusions is that an explicit fusion in parallel with a term allows fused names to be substituted for each other. This means that parallel contexts become as discriminating as arbitrary contexts, and that open bisimilarity is more natural for the explicit fusion calculus than it was for the pi calculus. This is significant because ‘open’ is the principle behind automated bisimilarity-checkers.
Chapter PDF
Similar content being viewed by others
Keywords
- Label Transition System
- Business Process Modelling Notation
- Small Relation
- Fusion Transition
- Explicit Substitution
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abadi, M., Cardelli, L., Curien, P.-L., Lévy, J.-J.: Explicit substitutions. Journal of Functional Programming 1(4), 375–416 (1991)
Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous pi calculus. Theoretical Computer Science 195(2), 291–324 (1998)
Benton, N., Cardelli, L., Fournet, C.: Modern concurrency abstractions for C#. In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 415–440. Springer, Heidelberg (2002)
Boreale, M., Buscemi, M., Montanari, U.: D-fusion: a distinctive fusion calculus(2003), (submitted for publication)
Boreale, M., Sangiorgi, D.: Some congruence properties for pi-calculus bisimilarities. Theoretical Computer Science 198(1-2), 159–176 (1998)
Business Process Management Initiative. Business process modelling notation (BPML), http://www.bpmi.org/
Chaki, S., Rajamani, S.K., Rehof, J.: Types as models: Model checking messagepassing programs. In: POPL 2002, pp. 45–57. ACM Press, New York (2002)
Conchon, S., Fessant, F.L.: Jocaml: Mobile agents for objective-caml. In: ASA 1999/MA 1999, pp. 22–29. IEEE Computer Society Press, Los Alamitos (1999)
Corporation, M.: Biztalk server, http://www.microsoft.com/biztalk/
Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join-calculus. In: POPL 1996, pp. 372–385. ACM Press, New York (1996)
Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 844–855. Springer, Heidelberg (1998)
Fu, Y.: The chi-calculus. In: Proceedings of ICAPDC 1997, pp. 74–81. IEEE Computer Society Press, Los Alamitos (1997)
Fu, Y.: Bisimulation lattice of chi processes. In: Hsiang, J., Ohori, A. (eds.) ASIAN 1998. LNCS, vol. 1538, pp. 245–262. Springer, Heidelberg (1998)
Fu, Y.: Open bisimulations on chi processes. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 304–319. Springer, Heidelberg (1999)
Gardner, P., Laneve, C., Wischik, L.: The fusion machine. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 418–433. Springer, Heidelberg (2002)
Gardner, P., Laneve, C., Wischik, L.: Linear forwarders. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 415–430. Springer, Heidelberg (2003)
Gardner, P., Wischik, L.: Explicit fusions. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 373–382. Springer, Heidelberg (2000)
Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science 152(2), 437–486 (1995)
Merro, M.: On the expressiveness of chi, update and fusion calculi. In: EXPRESS 1998. Electronic Notes in Theoretical Computer Science, vol. 16.2, Elsevier, Amsterdam (1998)
Milner, R.: Communicating and Mobile Systems: the Pi-calculus. Cambridge University Press, Cambridge (1999)
Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 16–35. Springer, Heidelberg (2001)
Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: LICS 1998, pp. 176–185. IEEE Computer Society Press, Los Alamitos (1998)
Sangiorgi, D., Walker, D.: The Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Informatica 33, 69–97 (1996)
Thatte, S.: XLANG: Web services for business process design, http://www.gotdotnet.com/team/xml_wsspecs/xlang-c/
Victor, B., Parrow, J.: Concurrent constraints in the fusion calculus. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 455–469. Springer, Heidelberg (1998)
Wischik, L.: Explicit Fusions: Theory and Implementation. PhD thesis, University of Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wischik, L., Gardner, P. (2004). Strong Bisimulation for the Explicit Fusion Calculus. In: Walukiewicz, I. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2004. Lecture Notes in Computer Science, vol 2987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24727-2_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-24727-2_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21298-0
Online ISBN: 978-3-540-24727-2
eBook Packages: Springer Book Archive