Skip to main content
SpringerLink
Log in

Observable liveness of Petri nets

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Whereas, for Petri nets, the traditional liveness property guarantees that each transition of a Petri net can always occur again, observable liveness requires that, from any reachable marking, each observable transition can be forced to fire by choosing appropriate controllable transitions; hence it is defined for Petri nets with distinguished observable and controllable transitions. We introduce observable liveness and show that this new notion generalizes traditional liveness in various ways. In particular, liveness of a 1-bounded Petri net implies observable liveness, provided the only conflicts that can appear are between controllable transitions. This assumption refers to applications where the uncontrollable part models a deterministic machine (or several deterministic machines), whereas the user of the machine is modeled by the controllable part and can behave arbitrarily.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets, Volume 254 of Lecture Notes in Computer Science, pp. 359–376. Springer, Berlin (1986)

  2. Christos, G.: Cassandras and Stephane Lafortune. Introduction to Discrete Event Systems. Springer, New York (2006)

  3. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1995)

    Book  Google Scholar 

  4. Desel, J., Hanisch, H.-M., Juhás, G., Lorenz, R., Neumair, C.: A guide to modelling and control with modules of signal nets. In: Ehrig, H., Damm, W., Desel, J., Große-Rhode, M., Reif, W., Schnieder, E., Westkämper, E. (eds.) SoftSpez Final Report, Volume 3147 of Lecture Notes in Computer Science, pp. 270–300. Springer, Berlin (2004)

  5. Engelfriet, J.: Branching processes of Petri nets. Acta Inf. 28(6), 575–591 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Haddad, S.: A reduction theory for coloured nets. In: Rozenberg, G. (ed.) European Workshop on Applications and Theory in Petri Nets, Volume 424 of Lecture Notes in Computer Science, pp. 209–235. Springer, Berlin (1988)

  7. Holloway, L.E., Krogh, B.H., Giua, A.: A survey of Petri net methods for controlled discrete event systems. Discret. Event Dyn. Syst. 7(2), 151–190 (1997)

    Article  MATH  Google Scholar 

  8. Iordache, M.V., Antsaklis, P.J.: Design of T-liveness enforcing supervisors in Petri nets. IEEE Trans. Autom. Control 48(11), 1962–1974 (2003)

  9. Khomenko, V., Koutny, M., Vogler, W.: Canonical prefixes of Petri net unfoldings. Acta Inf. 40(2), 95–118 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Landweber, L.E., Robertson, E.L.: Properties of conflict-free and persistent Petri nets. J. ACM 25(3), 352–364 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  11. Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77, 541–580 (1989)

    Article  Google Scholar 

  12. Pomello, L.: Some equivalence notions for concurrent systems. an overview. In: Rozenberg, G. (ed.) Advances in Petri Nets 1985, Covers the 6th European Workshop on Applications and Theory in Petri Nets, Espoo, Finland in June 1985, Selected Papers, Volume 222 of Lecture Notes in Computer Science, pp. 381–400. Springer, Berlin (1985)

  13. Ramadge, P.J., Wonham, W.M.: The control of discrete event systems. In: IEEE vol. 77, pp. 81–98 (1989)

  14. Reisig, W.: Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness. In: Proceedings of the 11th Colloquium on Automata, Languages and Programming, pp. 403–413. Springer, London, UK (1984)

  15. Reisig, W.: Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets. Springer, Berlin (1998)

    Book  MATH  Google Scholar 

  16. Sampath, M., Sengupta, R., Lafortune, S., Sinnamohideen, K., Teneketzis, D.: Diagnosability of discrete-event systems. IEEE Trans. Autom. Control 40(9), 1555–1557 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Silva, M.: Half a century after Carl Adam Petri’s, Ph.D. thesis: a perspective on the field. Annu. Rev. Control 37(2), 191–219 (2013)

  18. van der Aalst, W.M.P.: The application of Petri nets to workflow management. J. Circuits Syst. Comput. 8(1), 21–66 (1998)

    Article  Google Scholar 

  19. van Glabbeek, R.J., Goltz, U., Schicke, J.-W.: On causal semantics of Petri nets. In: Katoen, J.-P., König, B. (eds.) In: International Conference on Concurrency Theory (CONCUR 2011), Volume 6901 of Lecture Notes in Computer Science, pp. 43–59. Springer, Berlin (2011)

  20. Vogler, W.: Failures semantics and deadlocking of modular Petri nets. Acta Inf. 26(4), 333–348 (1989)

    MATH  MathSciNet  Google Scholar 

  21. Vogler, W., Stahl, C., Müller, R.: Trace- and failure-based semantics for bounded responsiveness. In: Canal, C., Villari, M. (eds.) ESOCC Workshops, Volume 393 of Communications in Computer and Information Science, pp. 129–143. Springer, Berlin (2013)

Download references

Acknowledgments

The authors thank to Lucia Pomello, Luca Bernardinello, and the reviewers for their valuable comments.

Author information

Authors and Affiliations

  1. Fakultät für Mathematik und Informatik, FernUniversität in Hagen, Hagen, Germany

    Jörg Desel

  2. Dipartimento di Informatica Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milan, Italy

    Görkem Kılınç

Authors
  1. Jörg Desel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Görkem Kılınç
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jörg Desel.

Additional information

This work was partially supported by MIUR and by MIUR—PRIN 2010/2011 Grant ‘Automi e Linguaggi Formali: Aspetti Matematici e Applicativi’, code H41J12000190001.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Desel, J., Kılınç, G. Observable liveness of Petri nets. Acta Informatica 52, 153–174 (2015). https://doi.org/10.1007/s00236-015-0218-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-015-0218-1

Keywords

Search

Navigation