Skip to main content
SpringerLink
Log in

Concurrent bisimulations in Petri nets

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

After various attempts, an equivalence relation is defined for labelled Petri nets, on the base of the concurrency semantics of net theory. This relation, called Fully Concurrent bisimulation and abbreviated FC-bisimulation, preserves the level of concurrency of visible operations and, under some conditions, allows to enforce injective labelling on them. Refinements of a visible operation are also defined and we show that, under some conditions, they preserve FC-bisimulation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aceto, L., Hennessy, M.: Towards action-refinement in process algebras. Report 3/88, Computer Science Department, University of Sussex (1988). Also in Proc. LICS 89 (Asilomar, California), IEEE Computer Society Press, pp. 138–145 (1989)

  2. Best, E.: COSY: Its relation to nets and to CSP. In: Brauer, W., et al. (eds.) Advances in Petri Nets 1986. Proc. of Advanced Course on Petri Nets, Bad Honnef (1986) (Lect. Notes Comput. Sci., vol. 255, pp. 216–220) Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  3. Best, E., Devillers, R.: Sequential and concurrent behaviour in Petri net theory. TCS55, No. 1 (1988)

  4. Best, E., Fernández, C.: Notation and terminology on Petri net theory. Arbeitspapiere der GMD Nr. 195 (1987)

  5. Boudol, G., Castellani, I.: On the semantics of concurrency: Partial orders and transition systems. In: Ehrig, H. (ed.) Proceedings TAPSOFT 87, Vol. 1 (Lect. Notes Comput. Sci., vol. 249, pp. 123–137. Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  6. Brauer, W., Gold, R., Vogler, W.: Behaviour and equivalence preserving refinements of Petri Nets. Draft paper, Techn. Univ. München, submitted to Advances in Petri Nets 1990 (Lect. Notes Comput. Sci.). Berlin Heidelberg New York: Springer (accepted for publication)

  7. Castellano, L., de Michelis, G., Pomello, L.: Concurrency vs. interleaving: an instructive example. Bull. EATCS31, 12–15 (1987)

    Google Scholar 

  8. Darondeau, Ph., Degano, P.: Event structures, causal trees and refinements. In: Rovan, B. (ed.) Proc. of Mathematical Foundations of Computer Science 90. (Lect. Notes Comput. Sci., vol. 452, pp. 237–245). Berlin Heidelberg New York: Springer 1990

    Google Scholar 

  9. de Cindio, F., de Michelis, G., Pomello, L., Simone, C.: A Petri net model of CSP. Proc. CIL'81, Barcelona (1981)

  10. de Cindio, F., de Michelis, G., Pomello, L., Simone, C.: Milner's communicating systems and Petri Nets. In: Pagnoni, A., Rozenberg, G. (eds.), Application and Theory of Petri Nets (Inf. Fachber., vol. 66, pp. 40–59). Berlin Heidelberg New York: Springer 1983

    Google Scholar 

  11. Degano, P., de Nicola, R., Montanari, U.: Observational equivalences for concurrency models. Formal descr. of programming concepts III. Wirsing, M. (ed.), pp. 105–132. Amsterdam: North Holland 1987

    Google Scholar 

  12. Degano, P., de Nicola, R., Montanari, U.: A distributed operational semantics for CCS based on condition/event systems. Acta Inf.26, 59–91 (1988)

    Google Scholar 

  13. Degano, P., Gorrieri, R., Marchetti, S.: An exercise in concurrency: A CSP process as a condition/event system: In: Rozenberg, G. (ed.) Advances in Petri Nets 1988. (Lect. Notes Comput. Sci., vol. 340, pp. 85–105) Berlin Heidelberg New York: Springer 1988

    Google Scholar 

  14. Devillers, R.: On the definition of a bisimulation notion based on partial words. Petri Net Newsletter29, 16–19 (1988)

    Google Scholar 

  15. Devillers, R.: Maximality preserving bisimulation. Technical Report LIT-214, Univ. Bruxelles (1990)

  16. van Glabbeek, R.: The refinement theorem for ST-bisimulation semantics. Proc. IFIP Working Group Conference on Programming Concepts and Methods. Broy, M., Jones, C.B. (eds.) (to appear 1990)

  17. van Glabbeek, R., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. Arbeitspapiere der GMD 366 (1989) Extended abstract in: Kreczmar, A., Mirkowska, G. (eds.) Mathematical Foundations of Computer Science (Lect. Notes Comput. Sci., vol. 379, pp. 237–248). Berlin Heidelberg New York: Springer 1989

    Google Scholar 

  18. van Glabbeek, R., Goltz, U.: Refinement of actions in causality based models. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds.). Stepwise refinement of distributed systems. Models, formalisms, correctness (Lect. Notes Comput. Sci., vol. 430, pp. 267–300). Berlin Heidelberg New York: Springer 1990

    Google Scholar 

  19. van Glabbeek, R., Goltz, U.: Equivalence notions and refinement of actions for flow event structures. In DEMON deliverables. Esprit BRA 3148 (1990)

  20. van Glabbeek, R., Vaandrager, F.: Petri net models for algebraic concurrency. Proc. of PARLE Conference. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE. Parallel Architectures and Languages Europe. Vol. 2. (Lect. Notes Comput. Sci., vol. 259, pp. 224–242). Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  21. van Glabbeek, R., Weijland, W.: Refinement in branching time semantics. Proceedings of the International Conference on Algebraic Methodology and Software Technology-Iowa City, USA (1989)

  22. Goltz, U.: On representing CCS programs by finite Petri nets. Arbeitspapiere der GMD (1988)

  23. Goltz, U., Reisig, W.: CSP programs as nets with individual tokens (Lect. Notes Comput. Sci., vol. 188, pp. 169–196). Berlin Heidelberg New York: Springer 1985

    Google Scholar 

  24. Lauer, P.E., Campbell, R.: Formal semantics of a class of high-level primitives for coordinating concurrent processes. Acta Inf.5, 297–332 (1975)

    Google Scholar 

  25. Milner, R.: A calculus of communicating systems (Lect. Notes Comput. Sci., vol. 92). Berlin Heidelberg New York: Springer 1980

    Google Scholar 

  26. Nielsen, M., Thiagarajan, P.S.: Degrees of non-determinism and concurrency: A Petri net view. 4th Conf. on Found. of Softw. Techn. and Theor. Comp. Science, pp. 89–117. Berlin Heidelberg New York: Springer 1984

    Google Scholar 

  27. Park, D.: Concurrency and automata on finite sequences. Computer Science Department, University of Warwick (1981)

  28. Pomello, L.: Some equivalence notions for concurrent systems. An overview. In: Rozenberg, G. (ed.) Advances in Petri nets 1985 (Lect. Notes Comput. Sci. vol. 222, pp. 381–400). Berlin Heidelberg New York: Springer 1986

    Google Scholar 

  29. Pomello, L.: Observing net behaviour. In: Voss, K., et al. (eds.) Concurrency and nets, pp. 403–421. Berlin Heidelberg New York: Springer 1987

    Google Scholar 

  30. Pomello, L.: Osservatore, reti di Petri, Processi. Ph.D. Thesis, University of Milano and Torino-Italy (1988)

  31. Pomello, L., Simone, C.: A survey of equivalence notions for net based systems. Draft paper, Univ. Milano. In: Rozenberg, G. (ed.) Advances in Petri nets 1991 (Lect. Notes Comput. Sci.). Berlin Heidelberg New York: Springer (to be published)

  32. Pomello, L., Simone, C.: A state transformation preorder over a class of EN systems. In: Rozenberg, G. (ed.) Advances in Petri nets 1990 (Lect. Notes Comput. Sci.). Berlin Heidelberg New York: Springer 1990

    Google Scholar 

  33. Rozenberg, G., Verraedt, R.: Subset languages of Petri nets (Lect. Notes Comput. Sci., vol. 66) (also: TCS 26, pp. 301–323, 1983). Berlin Heidelberg New York: Springer 1978

    Google Scholar 

  34. Rabinovitch, A., Trakhtenbrot, B.A.: Behaviour structures and nets. Fundamenta Informaticae XI, 357–404 (1988)

    Google Scholar 

  35. Vogler, W.: Failures semantics based on interval semiwords is a congruence for refinement. In: Choffrut, C., Lengauer, T. (eds.) Proc. STACS 90 (Lect. Notes Comput. Sci., vol. 415, pp. 285–297). Berlin Heidelberg New York: Springer 1990

    Google Scholar 

  36. Vogler, W.: Bisimulation and action refinement. SFB-Bericht 342/10/90A, Techn. Univ. München (1990)

  37. Vogler, W.: Failures semantics of Petri nets and the refinement of places and transitions. Technical Report TUM-I9003, Techn. Univ. München (1990)

  38. Voss, K.: System specification with labelled nets and the notion of interface equivalence. Arbeitspapiere der GMD 211 (1986)

Download references

Author information

Author notes

  1. Eike Best

    Present address: Institut für Informatik, Universität Hildesheim, Samelsonplatz 1, W-3200, Hildesheim, Germany

  2. Astrid Kiehn

    Present address: Computer Science Department, University of Sussex, Falmer, BN19QH, Brighton, UK

Authors and Affiliations

  1. Gesellschaft für Mathematik und Datenverarbeitung, Institut für Methodische Grundlagen, Schloß Birlinghoven, W-5205, St. Augustin 1, Germany

    Eike Best

  2. Laboratoire d'Informatique Théorique, Université Libre de Bruxelles, Boulevard du Triomphe, B-1050, Bruxelles, Belgium

    Raymond Devillers

  3. Institut für Informatik, Technische Universität München, Arcisstrasse 21, W-8000, München, Germany

    Astrid Kiehn

  4. Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Via Moretto da Brescia, 9, I-20133, Milano, Italy

    Lucia Pomello

Authors
  1. Eike Best
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raymond Devillers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Astrid Kiehn
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lucia Pomello
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research partly supported by ESPRIT Basic Research Action, project 3148: DEMON

Rights and permissions

Reprints and permissions

About this article

Cite this article

Best, E., Devillers, R., Kiehn, A. et al. Concurrent bisimulations in Petri nets. Acta Informatica 28, 231–264 (1991). https://doi.org/10.1007/BF01178506

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01178506

Keywords

Search

Navigation