Abstract
It has been known since the seventies that the formulas of modal logic are invariant for bisimulations between possible worlds models — while conversely, all bisimulation-invariant first-order formulas are modally definable. In this paper, we extend this semantic style of analysis from modal formulas to dynamic program operations. We show that the usual regular operations are safe for bisimulation, in the sense that the transition relations of their values respect any given bisimulation for their arguments. Our main result is a complete syntactic characterization of all first-order definable program operations that are safe for bisimulation. This is a semantic functional completeness result for programming, which may be contrasted with the more usual analysis in terms of computational power. The 'Safety Theorem' can be modulated in several ways. We conclude with a list of variants, extensions, and further developments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Barwise & J. van Benthem 1996 'Interpolation, Preservation, and Pebble Games', Report ML-96-12, Institute for Logic, Language and Computation, University of Amsterdam.
J. van Benthem 1976 Modal Correspondence Theory, dissertation, Mathematical Institute, University of Amsterdam.
1984 'Correspondence Theory', in D. Gabbay & F. Guenthner, eds., Handbook of Philosophical Logic, vol. II, Reidel, Dordrecht.
1986 Essays in Logical Semantics, Reidel, Dordrecht, (Studies in Linguistics and Philosophy, vol. 29).
1991 Language in Action. Categories, Lambdas and Dynamic Logic, North-Holland, Amsterdam, (Studies in Logic, vol. 130).
1993A 'A Modal Perspective on Process Operations', manuscript, Institute for Logic, Language and Computation, University of Amsterdam.
1993B 'Programming Operations that are Safe for Bisimulation', Report 93-179, Center for the Study of Language and Information, Stanford University.
1995 'Logic and the Flow of Information', in D. Prawitz, B. Skyrms & D. Westerståhl, eds., Proceedings 9th International Congress of Logic, Methodology and Philosophy of Science. Uppsala 1993, Elseviers Science Publishers, Amsterdam, 693–724.
1996 Exploring Logical Dynamics, Studies in Logic, Language and Information, CSLI Publications (Stanford) & Cambridge University Press.
1997A 'Bits and Pieces', Report LP-97-01, Institute for Logic, Language and Computation, University of Amsterdam.
1997B 'Modality, Bisimulation and Interpolation in Infinitary Logic', to appear in Annals of Pure and Applied Logic (K. Georgatos et al., eds., Festschrift for Rohit Parikh).
J. van Benthem & J. Bergstra 1995 'Logic of Transition Systems', Journal of Logic, Language and Information 3:4, 247–283.
C. C. Chang & H. J. Keisler 1973 Model Theory, North-Holland, Amsterdam.
D. Harel 1984 'Dynamic Logic', in D. Gabbay & F. Guenthner, eds., Handbook of Philosophical Logic, vol. II, Reidel, Dordrecht.
M. Hollenberg 1995A 'Bisimulation Respecting First-Order Operations', Logic Group Preprint Series 156, Department of Philosophy, University of Utrecht.
1995B 'Bisimulation Safety over Finite Models', manuscript, Department of Philosophy, University of Utrecht.
1996 'Generalized Safety for Bisimulation', in P. Dekker & M. Stokhof, eds., Proceedings Tenth Amsterdam Colloquium, Institute for Logic, Language and Computation, University of Amsterdam.
1997 Modal Logic and Process Algebra, to appear, Ph.D. dissertation, Philosophical Institute, Rijksuniversiteit Utrecht.
D. Janin & I. Walukiewicz 1996 'On the Expressive Completeness of the Propositional μ-Calculus with Respect to Monadic Second-Order Logic', Department of Mathematics and Informatics, University of Bordeaux & Department of Computer Science, Aarhus University.
H. J. Keisler 1971 Model Theory for Infinitary Languages, North-Holland, Amsterdam.
R. Milner 1980 A Calculus of Communicating Systems, Springer, Berlin.
D. Park 1981 'Concurrency and Automata on Infinite Sequences', Proceedings 5th GI Conference, Springer, Berlin, 167–183.
E. Rosen 1995 'Modal Logic over Finite Stuctures', Report ML-95-08, Institute for Logic, Language and Computation, University of Amsterdam. To appear in the Journal of Logic, Language and Information.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Van Benthem, J. Program Constructions that are Safe for Bisimulation. Studia Logica 60, 311–330 (1998). https://doi.org/10.1023/A:1005072201319
Issue Date:
DOI: https://doi.org/10.1023/A:1005072201319