Skip to main content
SpringerLink
Log in

Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10168))

Abstract

Compacting Petri nets behaviors means to develop a more succinct representation of all the possible executions of a net, still giving the capability to reason on properties fulfilled by the computations of the net. To do so suitable equivalences on alternative executions have to be engineered. We introduce a general notion of merging relation covering the existing approaches to compact behaviors and we discuss how to enforce that the more succinct net is an unravel net, namely a net where dependencies can be identified (almost) syntactically.

Work partially supported by Aut. Region of Sardinia P.I.A. 2013 “NOMAD”.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Casu, G., Pinna, G.M.: Flow unfolding of multi-clock nets. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 170–189. Springer, Heidelberg (2014). doi:10.1007/978-3-319-07734-5_10

    Chapter  Google Scholar 

  2. Desel, J., Reisig, W.: The concepts of Petri nets. Softw. Syst. Model. 14(2), 669–683 (2015)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s unfolding algorithm. Formal Methods Syst. Des. 20(3), 285–310 (2002)

    Article  MATH  Google Scholar 

  5. Fabre, E.: Trellis processes: a compact representation for runs of concurrent systems. Discrete Event Dyn. Syst. 17(3), 267–306 (2007)

    Article  MATH  Google Scholar 

  6. Khomenko, V., Kondratyev, A., Koutny, M., Vogler, W.: Merged processes: a new condensed representation of Petri net behaviour. Acta Informatica 43(5), 307–330 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Langerak, R.: Bundle event structures: a non-interleaving semantics for LOTOS. In: FORTE 1992. IFIP Transactions, vol. C-10, pp. 331–346 (1993)

    Google Scholar 

  8. Mazurkiewicz, A.: Basic notions of trace theory. In: Bakker, J.W., Roever, W.-P., Rozenberg, G. (eds.) REX 1988. LNCS, vol. 354, pp. 285–363. Springer, Heidelberg (1989). doi:10.1007/BFb0013025

    Chapter  Google Scholar 

  9. McMillan, K.L.: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: Bochmann, G., Probst, D.K. (eds.) CAV 1992. LNCS, vol. 663, pp. 164–177. Springer, Heidelberg (1993). doi:10.1007/3-540-56496-9_14

    Chapter  Google Scholar 

  10. Reisig, W.: Understanding Petri Nets - Modeling Techniques, Analysis Methods, Case Studies. Springer, Heidelberg (2013)

    Book  MATH  Google Scholar 

  11. Smith, E., Reisig, W.: The semantics of a net is a net: an exercise in general net theory. In: Voss, K., Genrich, H.J., Rozenberg, G. (eds.) Concurrency and Nets: Advances in Petri Nets, pp. 461–479. Springer, Heidelberg (1987)

    Chapter  Google Scholar 

  12. Glabbeek, R.J.: The individual and collective token interpretations of Petri nets. In: Abadi, M., Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 323–337. Springer, Heidelberg (2005). doi:10.1007/11539452_26

    Chapter  Google Scholar 

  13. van Glabbeek, R.J., Plotkin, G.D.: Configuration structures, event structures and Petri nets. Theor. Comput. Sci. 410(41), 4111–4159 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987). doi:10.1007/3-540-17906-2_31

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, Università di Cagliari, Cagliari, Italy

    Giovanni Casu & G. Michele Pinna

Authors
  1. Giovanni Casu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Michele Pinna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. Michele Pinna .

Editor information

Editors and Affiliations

  1. Umeå University, Umeå, Sweden

    Frank Drewes

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. University of Giessen, Giessen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Casu, G., Pinna, G.M. (2017). Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly. In: Drewes, F., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2017. Lecture Notes in Computer Science(), vol 10168. Springer, Cham. https://doi.org/10.1007/978-3-319-53733-7_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-53733-7_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-53732-0

  • Online ISBN: 978-3-319-53733-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation