Skip to main content
Log in

Comparative trace semantics of time Petri nets

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

In the paper, a family of trace equivalencies in the interleaving, step, partial order, and nondeterministic semantics is defined and studied in the context of time Petri nets. The equivalences studied are based both on the classical concept of transition firing sequences and on time processes, i.e., time extensions of net processes with global transition firing moments. Relationships between the equivalences are established, and a hierarchy of classes of equivalent time Petri nets is constructed.

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

Access this article

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. van Glabbeek, R.J., Handbook of Process Algebras. Chapter “The Linear Time — Branching Time Spectrum I: The Semantics of Concrete, Sequential Processes,” Elsevier, 2001, pp. 3–99.

    Google Scholar 

  2. van Glabbeek, R.J. and Goltz, U., Refinement of actions and equivalence notions for concurrent systems, Acta Informatica, 2001, vol. 37, pp. 229–327.

    Article  MATH  MathSciNet  Google Scholar 

  3. Pomello, L., Rozenberg G., and Simone, C., A survey of equivalence notions for net based systems, Lecture Notes Comput. Sci., 1992, vol. 609, pp. 410–472.

    MathSciNet  Google Scholar 

  4. Tarasyuk, I.V., Equivalences for Behavioral Analysis of Concurrent and Distributed Computing Systems, Novosibirsk: Geo, 2007 (in Russian).

    Google Scholar 

  5. Nielsen, M., Plotkin, G.D., and Winskel, G., Petri nets, event structures and domains, Part I, Theor. Comput. Sci., 1981, vol. 13, no. 1, pp. 85–108.

    MATH  MathSciNet  Google Scholar 

  6. Goltz, U. and Reisig, W., The non-sequential behaviour of Petri nets, Information Control, 1983, vol. 57, no. 2/3, pp. 125–147.

    MATH  MathSciNet  Google Scholar 

  7. Engelfriet, J., Branching processes of Petri nets, Acta Informatica, 1991, vol. 28, no. 6, pp. 575–591.

    Article  MATH  MathSciNet  Google Scholar 

  8. Nielsen, M., Rozenberg, G., and Thiagarajan, P.S., Behavioural notions for elementary net systems, Distributed Computing, 1990, vol. 4, no. 1, pp. 45–57.

    Article  MathSciNet  Google Scholar 

  9. Hoogers, P.W., Kleijn, H.C.M., and Thiagarajan, P.S., An event structure semantics for general Petri nets, Theor. Comput. Sci., 1996, vol. 153, pp. 129–170.

    MATH  MathSciNet  Google Scholar 

  10. Baldan, P., Corradini, A., and Montanari, U., Contextual Petri nets, asymmetric event structures, and processes, Information Computation, 2001, vol. 171, no. 1, pp. 1–49.

    MATH  MathSciNet  Google Scholar 

  11. Baldan, P., Busi, N., Corradini, A., and Pinna, G.M., Domain and event structure semantics for Petri nets with read and inhibitor arcs, Theor. Comput. Sci., 2004, vol. 323. pp. 129–189.

    MATH  MathSciNet  Google Scholar 

  12. Juhas, G., Lorenz, R., and Mauser, S, Complete process semantics for inhibitor nets, Fundamenta Informaticae, 2008, vol. 87, nos. 3–4. pp. 331–365.

    MATH  MathSciNet  Google Scholar 

  13. Kleijn, J. and Koutny, M., Causality in structured occurrence nets, Lecture Notes Comput. Sci., 2011, vol. 6875, pp. 283–297.

    MathSciNet  Google Scholar 

  14. van Glabbeek, R.J., Goltz, U., and Schicke, J.-W., Abstract processes of place/transition systems, Information Processing Lett., 2011, vol. 111, no. 13, pp. 626–633.

    MATH  Google Scholar 

  15. van Glabbeek, R.J., Goltz, U., and Schicke, J.-W., On causal semantics of Petri nets, Lecture Notes Comput. Sci., 2011, vol. 6901, pp. 43–59.

    Google Scholar 

  16. Valero, V., de Frutos, D., and Cuartero, F., Timed processes of timed Petri nets, Lecture Notes Comput. Sci., 1995, vol. 935, pp. 490–509.

    Google Scholar 

  17. Aura, T. and Lilius, J., Time processes for time Petri nets, Lecture Notes Comput. Sci., 1997, vol. 1248, pp. 136–155.

    MathSciNet  Google Scholar 

  18. Chatain, T. and Jard, C., Time supervision of concurrent systems using symbolic unfoldings of time Petri nets, Lecture Notes Comput. Sci., 2005, vol. 3829, pp. 196–210.

    Google Scholar 

  19. Bihler, E. and Vogler, W., Timed Petri nets: efficiency of asynchronous systems, Lecture Notes Comput. Sci., 2004, vol. 3185, pp. 25–58.

    Google Scholar 

  20. Rozenburg, G. and Engelfriet, J., Elementary net systems, Lecture Notes Comput. Sci., 1998, vol. 1491, pp. 12–121.

    Google Scholar 

  21. Winkowski J., Algebras of processes of timed Petri nets, Lecture Notes Comput. Sci., 1994, vol. 480. pp. 309–321.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. I. Bushin.

Additional information

Original Russian Text © D.I. Bushin, I.B. Virbitskaite, 2015, published in Programmirovanie, 2015, Vol. 41, No. 3.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bushin, D.I., Virbitskaite, I.B. Comparative trace semantics of time Petri nets. Program Comput Soft 41, 131–139 (2015). https://doi.org/10.1134/S0361768815030020

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768815030020

Keywords

Navigation