Davide Sangiorgi
Skip Abstract Section
Abstract
One of the most studied behavioural equivalences is bisimilarity. Its success is much due to the associated bisimulation proof method, which can be further enhanced by means of “bisimulation up-to” techniques such as “up-to context.”
A different proof method is discussed, based on a unique solution of special forms of inequations called contractions and inspired by Milner’s theorem on unique solution of equations. The method is as powerful as the bisimulation proof method and its “up-to context” enhancements. The definition of contraction can be transferred onto other behavioural equivalences, possibly contextual and non-coinductive. This enables a coinductive reasoning style on such equivalences, either by applying the method based on unique solution of contractions or by injecting appropriate contraction preorders into the bisimulation game.
The techniques are illustrated in CCS-like languages; an example dealing with higher-order languages is also shown.
- Dean N. Arden. 1961. Delayed-logic and finite-state machines. In Proc. 2nd Annual Symposium on Switching Circuit Theory and Logical Design. IEEE Computer Society, 133--151. Google Scholar
Digital Library
- S. Arun-Kumar and M. Hennessy. 1992. An efficiency preorder for processes. Acta Inform. 29 (1992), 737--760. Google ScholarDigital Library
- J. C. M. Baeten, T. Basten, and M. A. Reniers. 2010. Process Algebra: Equational Theories of Communicating Processes. Cambridge University Press. Google ScholarDigital Library
- Jos C. M. Baeten, Jan A. Bergstra, and Jan Willem Klop. 1987. Ready-trace semantics for concrete process algebra with the priority operator. Comput. J. 30, 6 (1987), 498--506. Google ScholarDigital Library
- Jos C. M. Baeten and Bas Luttik. 2011. Unguardedness mostly means many solutions. Theor. Comput. Sci. 412, 28 (2011), 3090--3100.Google ScholarCross Ref
- B. Bloom, S. Istrail, and A. R. Meyer. 1995. Bisimulation can’t be traced. J. ACM 42, 1 (1995), 232--268. Google ScholarDigital Library
- Filippo Bonchi, Fabio Gadducci, and Giacoma Valentina Monreale. 2014a. A general theory of barbs, contexts, and labels. ACM Trans. Comput. Log. 15, 4 (2014), 35:1--35:27. Google ScholarDigital Library
- Filippo Bonchi, Daniela Petrisan, Damien Pous, and Jurriaan Rot. 2014b. Coinduction up to in a fibrational setting. In Proc. CSL-LICS'14, Thomas A. Henzinger and Dale Miller (Eds.). ACM, 20:1--20:9. Google ScholarDigital Library
- Filippo Bonchi and Damien Pous. 2013. Checking NFA equivalence with bisimulations up to congruence. In Proc. POPL’13, Roberto Giacobazzi and Radhia Cousot (Eds.). ACM, 457--468. Google ScholarDigital Library
- Rance Cleaveland and Matthew Hennessy. 1993. Testing equivalence as a bisimulation equivalence. Formal Asp. Comput. 5, 1 (1993), 1--20.Google ScholarDigital Library
- R. De Nicola and R. Hennessy. 1984. Testing equivalences for processes. Theor. Comput. Sci. 34 (1984), 83--133.Google ScholarCross Ref
- R. J. van Glabbeek. 1993. The linear time—branching time spectrum ii (the semantics of sequential systems with silent moves). In Proc. CONCUR’93, E. Best (Ed.). Lecture Notes in Computer Science 715 (1993). Google ScholarDigital Library
- R. J. van Glabbeek. 2001. The linear time—branching time spectrum i. In Handbook of Process Algebra, A. Ponse J. Bergstra and S. Smolka (Eds.). Elsevier, 3--99.Google Scholar
- J. F. Groote and F. W. Vaandrager. 1992. Structured operational semantics and bisimulation as a congruence. Inform. Comput. 100 (1992), 202--260. Google ScholarDigital Library
- C. A. R. Hoare. 1985. Communicating Sequential Processes. Prentice Hall. Google ScholarDigital Library
- K. Honda and N. Yoshida. 1995. On reduction-based process semantics. Theor. Comput. Sci. 152, 2 (1995), 437--486. Google ScholarDigital Library
- John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. 2006. Introduction to Automata Theory, Languages, and Computation (3rd Edition). Addison-Wesley, Boston, MA. Google ScholarDigital Library
- G. Hutton and M. Jaskelioff. 2011. Representing Contractive Functions on Streams. (2011).Google Scholar
- Vassileios Koutavas and Mitchell Wand. 2006. Small bisimulations for reasoning about higher-order imperative programs. In Proc. 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 141--152. Google ScholarDigital Library
- Michal Kunc. 2005. Simple language equations. Bull. EATCS 85 (2005), 81--102.Google Scholar
- S. B. Lassen. 1998. Relational reasoning about contexts. In Higher-order Operational Techniques in Semantics. Cambridge University Press, 91--135. Google ScholarDigital Library
- S. B. Lassen. 1999. Bisimulation in untyped lambda calculus: Böhm trees and bisimulation up to context. Electr. Notes Theor. Comput. Sci. 20 (1999), 346--374.Google ScholarCross Ref
- S. Milius, L.&Stilde;. Moss, and D. Schwencke. 2013. Abstract GSOS rules and a modular treatment of recursive definitions. Logical Methods Comput. Sci. 9, 3 (2013).Google Scholar
- R. Milner. 1989a. Communication and Concurrency. Prentice Hall. Google ScholarDigital Library
- Robin Milner. 1989b. A complete axiomatisation for observational congruence of finite-state behaviors. Inf. Comput. 81, 2 (1989), 227--247. Google ScholarDigital Library
- R. Milner and D. Sangiorgi. 1992. Barbed bisimulation. In Proc. 19th ICALP (Lecture Notes in Computer Science), W. Kuich (Ed.), Vol. 623. Springer Verlag, 685--695. Google ScholarDigital Library
- James H. Morris. Dec. 1968. Lambda-Calculus Models of Programming Languages. Ph.D. thesis MAC-TR-57. M.I.T., project MAC.Google Scholar
- V. Natarajan and Rance Cleaveland. 1995. Divergence and fair testing. In Proc. ICALP’95 (Lecture Notes in Computer Science), Vol. 944. Springer Verlag, 648--659. Google ScholarDigital Library
- Ion Petre and Arto Salomaa. 2009. Algebraic systems and pushdown automata. In Handbook of Weighted Automata. Springer, 257--289.Google Scholar
- Adrien Piérard and Eijiro Sumii. 2011. Sound bisimulations for higher-order distributed process calculus. In Proc. FOSSACS (Lecture Notes in Computer Science), Martin Hofmann (Ed.), Vol. 6604. Springer, 123--137. Google ScholarDigital Library
- Andrew Pitts. 2012. Howe’s method. In Advanced Topics in Bisimulation and Coinduction, Davide Sangiorgi and Jan Rutten (Eds.). Cambridge University Press.Google Scholar
- Damien Pous and Davide Sangiorgi. 2012. Enhancements of the bisimulation proof method. In Advanced Topics in Bisimulation and Coinduction, Davide Sangiorgi and Jan Rutten (Eds.). Cambridge University Press.Google Scholar
- Alexander Moshe Rabinovich. 1993. A complete axiomatisation for trace congruence of finite state behaviors. In Proc. 9th MFPS (Lecture Notes in Computer Science), Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove, and David A. Schmidt (Eds.), Vol. 802. Springer, 530--543. Google ScholarDigital Library
- Arend Rensink and Walter Volger. 2007. Fair testing. Inform. Comput. 205 (2007), 125--198. Google ScholarDigital Library
- A. W. Roscoe. 1998. The Theory and Practice of Concurrency. Prentice Hall. Retrieved from http://www.cs.ox.ac.uk/people/bill.roscoe/publications/68b.pdf. Google ScholarDigital Library
- A. W. Roscoe. 2010. Understanding Concurrent Systems. Springer. Google ScholarDigital Library
- Jurriaan Rot, Marcello M. Bonsangue, and Jan J. M. M. Rutten. 2013. Coinductive proof techniques for language equivalence. In Proc. LATA (Lecture Notes in Computer Science), Adrian Horia Dediu, Carlos Martín-Vide, and Bianca Truthe (Eds.), Vol. 7810. Springer, 480--492.Google Scholar
- David Sands. 1998. Computing with contexts: A simple approach. Electron. Not. Theor. Comput. Sci. 10, C (1998), 134--149. Google ScholarDigital Library
- D. Sangiorgi. 1994. Locality and true-concurrency in calculi for mobile processes. In TACS’94 (Lecture Notes in Computer Science), Vol. 789. Springer, 405--424. Google ScholarDigital Library
- Davide Sangiorgi, Naoki Kobayashi, and Eijiro Sumii. 2011. Environmental bisimulations for higher-order languages. ACM Trans. Program. Lang. Syst. 33, 1 (2011), 5. Google ScholarDigital Library
- D. Sangiorgi and R. Milner. 1992. The problem of “weak bisimulation up to”. In Proc. CONCUR’92 (Lecture Notes in Computer Science), W. R. Cleveland (Ed.), Vol. 630. Springer Verlag, 32--46. Google ScholarDigital Library
- D. Sangiorgi and D. Walker. 2001. The π-Calculus: A Theory of Mobile Processes. Cambridge University Press. Google ScholarDigital Library
Index Terms
- Equations, Contractions, and Unique Solutions
Recommendations
Equations, Contractions, and Unique Solutions
POPL '15: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesOne of the most studied behavioural equivalences is bisimilarity. Its success is much due to the associated bisimulation proof method, which can be further enhanced by means of "up-to bisimulation" techniques such as "up-to context".
A different proof ...
On the origins of bisimulation and coinduction
The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently discovered: Computer Science, Philosophical Logic (precisely, Modal Logic), Set Theory.
Bisimulation and bisimilarity are coinductive ...
On coinductive equivalences for higher-order probabilistic functional programs
POPL '14We study bisimulation and context equivalence in a probabilistic lambda-calculus. The contributions of this paper are threefold. Firstly we show a technique for proving congruence of probabilistic applicative bisimilarity. While the technique follows ...
Comments