Advertisement

Back-forth equivalences for design of concurrent systems

  • Igor V. Tarasyuk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1234)

Abstract

The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature are supplemented by new ones, and their relationship with basic behavioural equivalences is examined for the whole class of Petri nets as well as for their subclass of sequential nets. In addition, the preservation of all the equivalence notions by refinements is examined.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Autant C., Schnoebelen Ph.Place bisimulations in Petri nets. LNCS616, p. 45–61, June 1992.Google Scholar
  2. 2.
    Best E., Devillers R., Kiehn A., Pomello L.Concurrent bisimulations in Petri nets. Acta Informatica28, p. 231–264, 1991.Google Scholar
  3. 3.
    Boudol G., Castellani I.On the semantics of concurrency: partial orders and transition systems. LNCS249, p. 123–137, 1987.Google Scholar
  4. 4.
    Cherief F.Back and forth bisimulations on prime event structures. LNCS605, p.843–858, June 1992.Google Scholar
  5. 5.
    Cherief F.Contributions à la sémantique du parallélisme: bisimulations pour le raffinement et le vrai parallélisme. Ph.D. thesis, Institut National Politechnique de Grenoble, France, October 1992 (in French).Google Scholar
  6. 6.
    Cherief F.Investigations of back and forth bisimulations on prime event structures. Computers and Artificial Intelligence11(5), p. 481–496, 1992.Google Scholar
  7. 7.
    Van Glabbeek R.J., Vaandrager F.W.Petri net models for algebraic theories of concurrency. LNCS259, p. 224–242, 1987.Google Scholar
  8. 8.
    Hoare C.A.R. Communicating sequential processes, on the construction of programs. (McKeag R.M., Macnaghten A.M., eds.) Cambridge University Press, p. 229–254, 1980.Google Scholar
  9. 9.
    De Nicola R., Montanari U., Vaandrager F.W.Back and forth bisimulations. LNCS458, p. 152–165, 1990.Google Scholar
  10. 10.
    Nielsen M., Thiagarajan P.S.Degrees of non-determinizm and concurrency: A Petri net view. LNCS181, p. 89–117, December 1984.Google Scholar
  11. 11.
    Park D.M.R.Concurrency and automata on infinite sequences. LNCS104, p. 167–183, March 1981.Google Scholar
  12. 12.
    Pomello L.Some equivalence notions for concurrent systems. An overview. LNCS222, p. 381–400, 1986.Google Scholar
  13. 13.
    Pinchinat S. Bisimulations for the semantics of reactive systems. Ph.D. thesis, Institut National Politechnique de Grenoble, January 1993 (in French).Google Scholar
  14. 14.
    Rabinovitch A., Trakhtenbrot B.A.Behaviour structures and nets. Fundamenta InformaticaeXI, p. 357–404, 1988.Google Scholar
  15. 15.
    Tarasyuk I.V.Equivalence notions for design of concurrent systems using Petri nets. Hildesheimer Informatik-Bericht4/96, part 1, 19 p., Institut für Informatik, Universität Hildesheim, Hildesheim, Germany, January 1996.Google Scholar
  16. 16.
    Vogler W.Bisimulation and action refinement. LNCS480, p. 309–321, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Igor V. Tarasyuk
    • 1
  1. 1.Siberian Division of the Russian Academy of SciencesInstitute of Informatics SystemsNovosibirskRussia

Personalised recommendations