Abstract
Context bisimulation [12, 1] has become an important notion of behavioural equivalence for higher-order processes. Weak forms of context bisimulation are particularly interesting, because of their high level of abstraction. We present a modal logic for this setting and provide a characterization of a variant of weak context bisimulation on second-order processes. We show how the logic permits compositional reasoning. In comparison to previous work by Amadio and Dam [2] on the strong case, our modal logic supports derived operators through a complete duality and thus constitutes an appealing extension of Hennessy-Milner logic.
Keywords
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.
Download to read the full chapter text
Chapter PDF
References
R.M. Amadio. On the Reduction of CHOCS-Bisimulation to π-calculus Bisimulation. In Concurrency Theory, LNCS 715, pages 112–126. Springer, 1993. Proceedings CONCUR.
R.M. Amadio and M. Dam. Reasoning about Higher-order Processes. In P.D. Mosses, M. Nielsens, and M.I. Schwartzbach, editors, Theory and Practice of Software Development, LNCS 915, pages 202–216. Springer, 1995. Proceedings TAPSOFT.
M. Baldamus and J. Dingel. Modal Characterization of Weak Bisimulation for Higherorder Processes. Report 96-27, Berlin University of Technology, Computer Science Department, 1996. Retrievable via the Hypatia electronic library.
M. Baldamus and T. Frauenstein. Congruence Proofs for Weak Bisimulation Equivalences on Higher-order Process Calculi. Report 95-21, Berlin University of Technology, Computer Science Department, 1995.
W. Ferreira, M. Hennessy, and A. Jeffrey. A Theory of Weak Bisimulation for Core CML. In Functional Programming, pages 201–212. ACM Press, 1996. Conference proceedings.
R.J. van Glabeek. The Linear Time — Branching Time Spectrum II. In CONCUR, LNCS 715, pages 66–81. Springer, 1993. Proceedings.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32:137–161, 1985.
D. Howe. Equality in Lazy Computation Systems. In Logic in Computer Science, pages 198–203, 1989. Proceedings LICS.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, (Parts I and II). Information and Computation, (100):1–77, 1992.
J.C. Mitchell. Type Systems for Programming Languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 365–458. North-Holland, 1990.
D. Sangiorgi. Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms. Cst-99-93, Department of Computer Science, University of Edinburgh, 1993.
D. Sangiorgi. Bisimulation in Higher-order Calculi. Report RR-2508, INRIA-Sophia Antipolis, 1995. To appear in Information and Computation.
C. Stirling. Modal Logics for Communicating Systems. Theoretical Computer Science, (49):311–347, 1987.
B. Thomsen. Plain CHOCS — A Second Generation Calculus for Higher-order Processes. Acta Informatica, (30):1–59, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldamus, M., Dingel, J. (1997). Modal characterization of weak bisimulation for higher-order processes. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030604
Download citation
DOI: https://doi.org/10.1007/BFb0030604
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive