Abstract
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extensions of corresponding characterizations of interleaving bisimulation.
Basic Research In Computer Science, Centre of the Danish National Research Foundation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky and R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic. DoC 92/24, Imperial College of Science, Technology and Medicine, 1992.
M. A. Bednarczyk. Categories of asynchronous systems. PhD thesis, University of Sussex, 1988. Technical report no. 1/88.
M. A. Bednarczyk. Heredity History Preserving Bisimulations. Unpublished, Draft of 1991.
J. Van Bentham. Correspondence theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2. Reidel, 1984.
R. van Glaabek and U. Goltz. Equivalence Notions for Concurrent Systems and Refinement of Actions. In MFCS '89. Springer-Verlag LNCS 379, 1989.
U. Goltz, R. Kuiper, and W. Penczek. Propositional Temporal Logics and Equivalences. In Concur '92. Springer-Verlag LNCS 630, 1992.
M. C. Hennessy and A. J. R. G. Milner. Algebraic Laws for Non-determinism and Concurrency. Journal of ACM, 32(1), 1985.
M. Hennessy and C. P. Stirling. The power of the future perfect in program logics. In A. R. Meyer, editor, Information and Control, volume 67. Academic Press, Inc., 1985.
A. Joyal, M. Nielsen, and G. Winskel. Bisimulation and open maps. In LICS '93, 1993. To appear in Information and Computation.
A. J. R. G. Milner. Communication and Concurrency. Prentice Hall, 1989.
M. Nielsen and C. Clausen. Bisimulation, Games, and Logic. DAIMI-PB 467, Aarhus University, 1994.
E.-R. Olderog. Nets, Terms and Formulas. Cambridge University Press, 1991.
D. M. R. Park. Concurrency and Automata on Infinite Sequences. In Theoretical Computer Science, 5th GL-conference. Springer-Verlag LNCS 104, 1981.
V. R. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1), 1986.
A. Rabinoritch and B. Traktenbrot. Behaviour structures and nets. Fundamenta Informatica, 11(4), 1988.
M. W. Shields. Concurrent machines. Computer Journal, 88, 1985.
C. Stirling. Modal and Temporal Logics for Processes, 1993. Notes for Summer School in Logic Methods in Concurrency, Department of Computer Science, Aarhus University.
G. Winskel and M. Nielsen. Models for Cuncurrency. In S. Abramsky and D. Gabbay, editors, Handbook of Logic in Computer Science, volume 3. Oxford University Press, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nielsen, M., Clausen, C. (1994). Bisimulation, games, and logic. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_54
Download citation
DOI: https://doi.org/10.1007/3-540-58131-6_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58131-4
Online ISBN: 978-3-540-48445-5
eBook Packages: Springer Book Archive