Behavioural characterizations of partial order logics

  • Irina Virbitskaite
  • Anzhelika Votintseva
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1279)


The intention of the paper is to establish behavioural matches avioural matches for the equivalences induced by some partial order temporal logics temporal logics defined over prime event structures. Unlike other logical formalisms, the formalisms, the languages considered can indeed express concurrency as well as nondeterminism. nondeterminism. In order to relate behavioural equivalences to the logical ones, he logical ones, a number of new bisimulations which respect causality, concurrency and concurrency and conflict relations between event occurrences in the structures are proposed. es are proposed. Building the lattice of equivalences we show that there are the at there are the close relationships between the introduced and existing bisimulation notions. ulation notions.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boudol, G., Castellani, I.: Concurrency and Atomicity, Theoretical Computer Science 59 (1988) 25–84Google Scholar
  2. 2.
    Browne, M.C., Clarke, E.M., Grumberg, O.: Characterizing Finite Kripke Structures in Propositional Temporal Logic, Theoretical Computer Science 59 (1988) 115–131Google Scholar
  3. 3.
    Cherief F.: Investigations of Back and Forth Bisimulations on Prime Event Structures, Computers and Artificial Intelligence 11 (1992)Google Scholar
  4. 4.
    Glabbeek, R., Goltz, U.: Equivalence Notions for Concurrent Systems and Refinement of Actions, in: Proc. MFCS'89, Lecture Notes in Computer Science, Vol. 379(Springer, Berlin 1989) 237–248Google Scholar
  5. 5.
    Goltz, U.,.Kuiper, R., Penczek, W.: Propositional Temporal Logics and Equivalences, in: Proc. CONCUR'92, Lecture Notes in Computer Science, Vol. 630 (Springer, Berlin 1992) 222–236Google Scholar
  6. 6.
    Katz, S., Peled, D.: An Efficient Verification Method for Parallel and Distributed Programs, in: de Bakker, J.W., de Roever, W.P. and Rozenberg, G., eds., Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science, Vol.354 (Springer, Berlin, 1989) 489–507Google Scholar
  7. 7.
    Loogen, R., Goltz, U.: Modelling Nondeterministic Concurrent Processes with Event Structures, Fundamenta Informaticae 14 (1991) 39–73Google Scholar
  8. 8.
    Mukund, M., Thiagarajan, P.S.: An Axiomatization of Event Structures, in: Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 405 (Springer, Berlin, 1989) 143–160Google Scholar
  9. 9.
    Mukund, M., Thiagarajan, P.S.: A Logical Axiomatization of Well Branching Event Structures, in: Theoretical Computer Science, 96 (1992) 35–72CrossRefGoogle Scholar
  10. 10.
    deNicola, R., Montanari, U., Vaandrager, F.: Back and Forth Bisimulations, in: Proc. CONCUR'90, Lecture Notes in Computer Science, Vol. 458 (Springer, Berlin, 1990)Google Scholar
  11. 11.
    deNicola, R., Vaandrager, F.: Three Logics for Branching Bisimulation, Proc. LICE 90 (1990)Google Scholar
  12. 12.
    Nielsen, M., Plotkin, G., Winskel, G.: Petri Nets, Event Structures and Domains, Theoretical Computer Science 13 (1981) 85–108CrossRefGoogle Scholar
  13. 13.
    Penczek, W.: A Temporal Logic for Event Structures, Fundamenta Informatica XI (1988) 297–326Google Scholar
  14. 14.
    Penczek, W.: A Temporal Logic for the Local Specification of Concurrent Systems, Information Processing 89 (North-Holland, Amsterdam, 1989) 857–862Google Scholar
  15. 15.
    Pinchinat, S.: Ordinal Processes in Comparative Concurrency Semantics, Lecture Notes in Computer Science, Vol. 626 (Springer, Berlin, 1992)Google Scholar
  16. 16.
    Pinchinat, S., Laroussinie, F., Schnoebelen, PH.: Logical Characterization of Truly Concurrent Bisimulation, Research Report RT 114 IMAG-23 LIFIA (Grenoble, 1994)Google Scholar
  17. 17.
    Pinter, S., Wolper, P.: A Temporal Logic for Reasoning about Partially Ordered Computations, Proc. 3rd ACM Symp. on Principles of Distributed Computing, (Vancouver, 1984) 28-37Google Scholar
  18. 18.
    Sinachopoulos, A.: Partial Order Logics for Elementary Net Systems: State-and Event Approaches, in: Proc. CONCUR'90, Lecture Notes in Computer Science, Vol. 625 (Springer, Berlin, 1990)Google Scholar
  19. 19.
    Virbitskaite, I., Votintseva, A., Best, E.: Comparing Logical and Behavioural Equivalences for Event Structures, Hildesheimer Informatik-Berichte, 22, 32p. (1992)Google Scholar
  20. 20.
    Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets, Lecture Notes in Computer Science, Vol. 625 (Springer, Berlin, 1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Irina Virbitskaite
    • 1
  • Anzhelika Votintseva
    • 1
  1. 1.Institute of Informatics SystemsSiberian Division of the Russian Academy of SciencesNovosibirskRussia

Personalised recommendations