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 "up-to bisimulation" techniques such as "up-to context".
A different proof method is discussed, based on 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 noncoinductive.
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 on CCS-like languages; an example dealing with higher-order languages is also shown.
Supplemental Material
- S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. Acta Informatica, 29:737--760, 1992. Google Scholar
Digital Library
- J.C.M. Baeten, T. Basten, and M.A. Reniers. Process Algebra: Equational Theories of Communicating Processes. Cambridge University Press, 2010. Google Scholar
Digital Library
- Jos C. M. Baeten, Jan A. Bergstra, and Jan Willem Klop. Readytrace semantics for concrete process algebra with the priority operator. Comput. J., 30(6):498--506, 1987. Google Scholar
Digital Library
- Jos C. M. Baeten and Bas Luttik. Unguardedness mostly means many solutions. Theor. Comput. Sci., 412(28):3090--3100, 2011.Google Scholar
Cross Ref
- B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232--268, 1995. Google Scholar
Digital Library
- F. Bonchi, D. Petrisan, D. Pous, and J. Rot. Coinduction up to in a fibrational setting. Proc. CSL-LICS'14, ACM, 2014. Google Scholar
Digital Library
- Filippo Bonchi and Damien Pous. Checking nfa equivalence with bisimulations up to congruence. In Proc. POPL'13, pages 457--468. ACM, 2013. Google Scholar
Digital Library
- Rance Cleaveland and Matthew Hennessy. Testing equivalence as a bisimulation equivalence. Formal Asp. Comput., 5(1):1--20, 1993.Google Scholar
Cross Ref
- R. De Nicola and R. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83--133, 1984.Google Scholar
Cross Ref
- R.J. van Glabbeek. The linear time-branching time spectrum II. In Proc. CONCUR '93, volume 715. Springer, 1993. Google Scholar
Digital Library
- K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437--486, 1995. Google Scholar
Digital Library
- John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison- Wesley, Boston, MA, USA, 2006. Google Scholar
Digital Library
- G. Hutton and M. Jaskelioff. Representing Contractive Functions on Streams. Submitted, 2011.Google Scholar
- V. Koutavas and M. Wand. Small bisimulations for reasoning about higher-order imperative programs. In Proc. POPL'06, pages 141--152. ACM, 2006. Google Scholar
Digital Library
- Michal Kunc. Simple language equations. Bulletin of the EATCS, 85:81--102, 2005.Google Scholar
- S.B. Lassen. Relational reasoning about contexts. In Higher-order operational techniques in semantics, pages 91--135. Cambridge University Press, 1998. Google Scholar
Digital Library
- S.B. Lassen. Bisimulation in untyped lambda calculus: Bohm trees and bisimulation up to context. Electr. Notes Theor. Comput. Sci., 20:346--374, 1999.Google Scholar
Cross Ref
- S. Milius, L. S. Moss, and D. Schwencke. Abstract GSOS rules and a modular treatment of recursive definitions. Logical Methods in Computer Science, 9(3), 2013.Google Scholar
- R. Milner. Communication and Concurrency. Prentice Hall, 1989. Google Scholar
Digital Library
- R. Milner and D. Sangiorgi. Barbed bisimulation. In Proc. 19th ICALP, volume 623 of LNCS, Springer Verlag, 1992. Google Scholar
Digital Library
- Robin Milner. A complete axiomatisation for observational congruence of finite-state behaviors. Inf. Comput., 81(2):227--247, 1989. Google Scholar
Digital Library
- James H. Morris. Lambda-Calculus Models of Programming Languages. Phd thesis MAC-TR-57, M.I.T., project MAC, Dec. 1968.Google Scholar
- Ion Petre and Arto Salomaa. Algebraic systems and pushdown automata. In Handbook of Weighted Automata, EATCS Series, pages 257--289. Springer, 2009.Google Scholar
Cross Ref
- Adrien Piérard and Eijiro Sumii. Sound bisimulations for higherorder distributed process calculus. In Proc. FOSSACS, volume 6604 of LNCS, pages 123--137. Springer, 2011. Google Scholar
Digital Library
- Andrew Pitts. Howe's method. In Advanced Topics in Bisimulation and Coinduction. Cambridge University Press, 2012.Google Scholar
- Damien Pous and Davide Sangiorgi. Enhancements of the bisimulation proof method. In Advanced Topics in Bisimulation and Coinduction. Cambridge University Press, 2012.Google Scholar
- Alexander Moshe Rabinovich. A complete axiomatisation for trace congruence of finite state behaviors. In Proc. 9th MFPS, volume 802 of LNCS, pages 530--543. Springer, 1993. Google Scholar
Digital Library
- A. W. Roscoe. The theory and practice of concurrency. Prentice Hall, 1998. Google Scholar
Digital Library
- A. W. Roscoe. Understanding Concurrent Systems. Springer, 2010. Google Scholar
Digital Library
- Jurriaan Rot, Marcello M. Bonsangue, and Jan J. M. M. Rutten. Coinductive proof techniques for language equivalence. In Proc. LATA, volume 7810 of LNCS, pages 480--492. Springer, 2013.Google Scholar
Cross Ref
- David Sands. Computing with Contexts: A simple approach. ENTCS, volume 10, Elsevier, 1998.Google Scholar
- Sangiorgi, D. and Milner, R. The problem of "Weak Bisimulation up to". In Proc. CONCUR '92, volume 630 of LNCS, Springer, 1992. Google Scholar
Digital Library
- D. Sangiorgi. Locality and True-concurrency in Calculi for Mobile Processes. In Proc. TACS '94, volume 789 of LNCS, Springer, 1994. Google Scholar
Digital Library
- D. Sangiorgi and D. Walker. The *PIE*-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001. Google Scholar
Digital Library
- Davide Sangiorgi, Naoki Kobayashi, and Eijiro Sumii. Environmental bisimulations for higher-order languages. ACM Trans. Program. Lang. Syst., 33(1):5, 2011. Google Scholar
Digital Library
Index Terms
Equations, Contractions, and Unique Solutions







Comments