Abstract
Back and forth bisimulations have been first introduced in [DNMV90]. In this paper, we propose a definition of back and forth bisimulalion for event structures. We show that our proposal can be adapted in a uniform way to yield step back and forth bisimulalion and pomset back and forth bisimulalion. We investigate these new equivalences and compare them to other branching time semantics.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. Best, R. Devillers, A. Kiehn, and L. Pomello. Concurrent bisimulations in Petri Nets. Acta Informatica, 28, pp 231–264, 1991
L. Castellano, G. De Michelis, and L. Pomello. Concurrency versus interleaving: An instructive example. Bull. EATCS 31, pp 12–15, 1987
F. Cherief, F. Laroussinie, and S. Pinchinat. Modal Logics with Past for True Concurrency. Submitted to CONCUR'92, february 1992.
F. Cherief and Ph. Schnoebelen. τ-bisimulations and full abstration for refinement of actions. Inf. Proc. Letters. 40, November 1991, pp 219–222.
R. De Nicola, G.L Ferrari. Observational Logics And Concurrency Models. In Proc. 10th Conf. On Fondations of Software Technology and Theoretical Computer Science, Bangalore, India, LNCS 472, pp 301–315
R. De Nicola, F. Vaandrager. Three Logics For Branching Bisimulation. (extended abstract). In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, PA, pp 118–129, June 1990.
R. De Nicola, U. Montanari, and F.W. Vaandrager. Back and Forth Bisimulations. In Proc. CONCUR'90, Amsterdam, LNCS 458, pp 152–165. Springer-Verlag, August 1990.
R.J. v. Glabbeek, U. Goltz. Refinement of actions in causality based models. In Stepwise Refinement of Distributed Systems. Models, Formalisms, Correctness, Mook, LNCS 430, pp 267–300. Springer-Verlag, May 1989.
R.J. v. Glabbeek. Comparative Concurrency Semantics and Refinement of actions. PhD thesis. Free University of Amsterdam, May 1990.
R.J. v. Glabbeek. The refinement theorem for ST-bisimulation semantics. In Proc. IFIP Working Conf. on Programming Concepts and Methods, Sea of Galilee, Israel 1990.
R.J.v. Glabbeek, W.P. Weijland. Branching time and abstraction in bisimulation semantics. (extended abstract). In Information Processing' 89 (G.X.Ritter, ed.). Elsevier Science Publishers B.V (North Holland) 1989, pp 613–618
R.J.v. Glabbeek, W.P. Weijland. Refinement in branching time semantics. In Proc. AMAST Conf., Iowa City, pp 197–201, 1989.
M. Nielsen, G.D. Plotkin, and G. Winskel. Petri nets, event structures and domains Part I. Theor. Comput. Sci., 13(1):85–108, 1981.
V.R. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming. 15(1), pp33–71, 1986.
A. Rabinovich and B. A. Trakhtenbrot. Behaviour structures and nets. Fundamenta Informaticae, 11:357–404, 1988.
W. Vogler. Bisimulation and action refinement. Proc. STACS'91, Hamburg, LNCS 480, pp 309–321, Springer Verlag. February 91.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cherief, F. (1992). Back and forth bisimulations on prime event structures. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_128
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_128
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive