Skip to main content
SpringerLink
Log in

Strong bisimilarity on nets revisited

  • Submitted Presentations
  • Conference paper
  • First Online:
PARLE '91 Parallel Architectures and Languages Europe (PARLE 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 506))

Abstract

In [Old89b], Olderog proposed a new notion of bisimulation between Petri nets. His proposal considers bisimulations between places of nets rather than between markings. Unfortunately, his definition leads to several problems that have not been noticed. It turns out that the situation is more complicated than in classical bisimulation theory over transition systems.

We propose a new definition which solves the problems and which is much more general. We investigate the consequences of the new definition: many results of classical bisimulation theory can be recovered modulo some adaptation. This indicates that our definition is “correct” and productive.

Extended Abstract

LIFIA-IMAG, 46 Av. Félix Viallet, 38031 GRENOBLE Cedex, FRANCE. E-mail:{cyril,zoubir,phs}@lifia.imag.fr

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Autant, Z. Belmesk, and Ph. Schnoebelen. Strong Bisimilarity on Nets Revisited. Research Report, LIFIA-IMAG, Grenoble, 1991.

    Google Scholar 

  2. E. Best, R. Devillers, A. Kiehn, and L. Pomello. Concurrent bisimulations in Petri nets. September 1990. To appear in Acta Informatica.

    Google Scholar 

  3. J. A. Bergstra and J. W. Klop. Process theory based on bisimulation semantics. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, LNCS 354, pages 50–122, Springer-Verlag, 1989.

    Google Scholar 

  4. P. Degano, R. De Nicola, and U. Montanari. A distributed operational semantics for CCS based on condition/event systems. Acta Informatica, 26:59–91, 1988.

    Google Scholar 

  5. R. Devillers. Maximality Preserving Bisimulation. Tech. Report LIT-214, Lab. Informatique Théorique, Université Libre de Bruxelles, March 1990.

    Google Scholar 

  6. U. Goltz. On representing CCS programs by finite Petri nets. In Proc. Math. Found. Computer Science, LNCS 324, pages 339–350, Springer-Verlag, 1988.

    Google Scholar 

  7. M. Nielsen and P. S. Thiagarajan. Degrees of non-determinism and concurrency: a Petri net view. In Proc. 4th Conf. on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India, LNCS 181, pages 89–117, Springer-Verlag, December 1984.

    Google Scholar 

  8. E.-R. Olderog. Operational Petri net semantics for CCSP. In Advances in Petri Nets 1987, LNCS 266, pages 196–223, Springer-Verlag, 1987.

    Google Scholar 

  9. E.-R. Olderog. Nets, terms and formulas: three views of concurrent processes and their relationship. Habilitationsschrift, Christian-Albrechts-Univ. Kiel, July 1989.

    Google Scholar 

  10. E.-R. Olderog. Strong bisimilarity on nets: a new concept for comparing net semantics. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, LNCS 354, pages 549–573, Springer-Verlag, 1989.

    Google Scholar 

  11. D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conf. on Th. Comp. Sci., LNCS 104, pages 167–183, Springer-Verlag, March 1981.

    Google Scholar 

  12. L. Pomello. Some equivalence notions for concurrent systems. An overview. In Advances in Petri Nets 1985, LNCS 222, pages 381–400, Springer-Verlag, 1985.

    Google Scholar 

  13. W. Reisig. Petri Nets. An Introduction. Volume 4 of EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1985.

    Google Scholar 

  14. A. Rabinovich and B. A. Trakhtenbrot. Behavior structures and nets. Fundamenta Informaticae, 11(4):357–404, 1988.

    Google Scholar 

  15. R. J. van Glabbeek. The Linear Time — Branching Time Spectrum. Research Report CSR9029, CWI, July 1990.

    Google Scholar 

  16. R. J. van Glabbeek and F. Vaandrager. Petri net models for algebraic theories of concurrency. In Proc. PARLE 87, vol. II: Parallel Languages, Eindhoven, LNCS 259, pages 224–242, Springer-Verlag, June 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Institut Imag — CNRS, Grenoble, France

    C. Autant, Z. Belmesk & Ph. Schnoebelen

Authors
  1. C. Autant
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Z. Belmesk
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ph. Schnoebelen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Emile H. L. Aarts Jan van Leeuwen Martin Rem

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag

About this paper

Cite this paper

Autant, C., Belmesk, Z., Schnoebelen, P. (1991). Strong bisimilarity on nets revisited. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) PARLE '91 Parallel Architectures and Languages Europe. PARLE 1991. Lecture Notes in Computer Science, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54152-7_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-54152-7_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54152-3

  • Online ISBN: 978-3-540-47472-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation