Abstract
Recently, Joyal, Nielsen and Winskel suggested a categorical definition of bisimulation, applicable to a wide range of models in con-currency with an accompanying notion of observations. The definition is in terms of span of open maps, and it coincides with Park and Milner’s strong bisimulation for the standard model of labelled transition systems with sequential observations. Here, we briefly present the general set-up, and discuss its applications. For the model of transition systems with independence and nonsequential observations, the associated notion of bisimulation was shown to be a slight strengthening of the history preserving bisimulations of Rabinovich and Trakhtenbrot. Furthermore, it turns out that this bisimulation has game theoretic and logical characterizations in the form of pleasantly simple modifications of well-known characterizations of standard strong bisimulation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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. Draft of 1991.
J. Van Bentham. Correspondence theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2. Reidel, 1984.
R. De Nicola, U. Montanan, F. Vaandrager. Back and forth bisimulations. In Concur ‘80. Springer-Verlag LNCS 458, 1990.
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 ‘82. 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. Information and Control, volume 67, 1985.
A. Joyal, M. Nielsen, and G. Winskel. Bisimulation and open maps. In LICS ‘83, 1993. Full version in BRICS RS-94–7, Computer Science Department, Aarhus University, 1994.
M. Nielsen, C. Clausen. Bisimulations, games and logic. To appear in New Results in Theoretical Computer Science,Springer-Verlag LNCS. Full version in BRIG’S RS-94–6, Computer Science Department, Aarhus University, 1994.
M. Nielsen, G. Winskel. Petri nets and bisimulations. BRIGS RS-94–15, Computer Science Department, Aarhus University, 1994.
A. J. R. G. Milner. Communication and Concurrency. Prentice Hall, 1989.
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. Rabinovich and B. Trakhtenbrot. 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. Notes for Summer School in Logic Methods in Concurrency, Department of Computer Science, Aarhus University, 1993.
G. Winskel and M. Nielsen. Models for Cuncurrency. To appear 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
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nielsen, M., Clausen, C. (1994). Bisimulation for Models in Concurrency. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-48654-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58329-5
Online ISBN: 978-3-540-48654-1
eBook Packages: Springer Book Archive