Skip to main content
SpringerLink
Log in

Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets

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

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

Abstract

We show that, given a finite lts, there is a minimal bounded Petri net over-approximation according to a structural preorder and present an algorithm to compute this over-approximation. This result is extended to subclasses of nets, namely pure Petri nets, plain Petri nets, T-nets, and marked graphs, plus combinations of these properties.

The author is supported by the German Research Foundation (DFG) project ARS (Algorithms for Reengineering and Synthesis), reference number Be 1267/15-1.

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

Notes

  1. 1.

    For example, in Fig. 2 the ESSP instance \((q',c)\) no longer applies to \({\text {Merge}}(A)\).

  2. 2.

    Available in the overapproximate_synthesize-module at https://github.com/CvO-Theory/apt.

References

  1. Badouel, E., Bernardinello, L., Darondeau, P.: Polynomial algorithms for the synthesis of bounded nets. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds.) CAAP 1995. LNCS, vol. 915, pp. 364–378. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-59293-8_207

    Chapter  Google Scholar 

  2. Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. TTCS. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47967-4

    Book  MATH  Google Scholar 

  3. Badouel, E., Darondeau, P.: Theory of regions. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 529–586. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-65306-6_22

    Chapter  Google Scholar 

  4. Best, E., Devillers, R.: Characterisation of the state spaces of live and bounded marked graph Petri nets. In: Dediu, A.-H., Martín-Vide, C., Sierra-Rodríguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 161–172. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-04921-2_13

    Chapter  Google Scholar 

  5. Best, E., Devillers, R.: State space axioms for T-systems. Acta Inf. 52(2–3), 133–152 (2015). https://doi.org/10.1007/s00236-015-0219-0

    Article  MathSciNet  MATH  Google Scholar 

  6. Carmona, J., Cortadella, J., Kishinevsky, M.: A region-based algorithm for discovering Petri nets from event logs. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 358–373. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85758-7_26

    Chapter  Google Scholar 

  7. Darondeau, P.: Deriving unbounded Petri nets from formal languages. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 533–548. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0055646

    Chapter  Google Scholar 

  8. Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures. Part I: basic notions and the representation problem and Part II: state spaces of concurrent systems. Acta Inf. 27(4), 315–368 (1990). https://doi.org/10.1007/BF00264611

    Article  MATH  Google Scholar 

  9. Lorenz, R., Mauser, S., Juhás, G.: How to synthesize nets from languages: a survey. In: WSC, pp. 637–647 (2007). https://doi.org/10.1109/WSC.2007.4419657

  10. Schlachter, U.: Petri net synthesis for restricted classes of nets. In: Kordon, F., Moldt, D. (eds.) PETRI NETS 2016. LNCS, vol. 9698, pp. 79–97. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39086-4_6

    Chapter  Google Scholar 

  11. Schlachter, U., Wimmel, H.: k-bounded Petri net synthesis from MTS. In: Meyer, R., Nestmann, U. (eds.) CONCUR 2017. LIPIcs, vol. 85, pp. 6:1–6:15. Schloss Dagstuhl (2017). https://doi.org/10.4230/LIPIcs.CONCUR.2017.6

  12. van der Werf, J.M.E.M., van Dongen, B.F., Hurkens, C.A.J., Serebrenik, A.: Process discovery using integer linear programming. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 368–387. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68746-7_24

    Chapter  Google Scholar 

Download references

Acknowledgements

The author would like to thank the anonymous reviewers, Eike Best, and Harro Wimmel for their very useful comments.

Author information

Authors and Affiliations

  1. Department of Computing Science, Universität Oldenburg, Oldenburg, Germany

    Uli Schlachter

Authors
  1. Uli Schlachter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Uli Schlachter .

Editor information

Editors and Affiliations

  1. Bar-Ilan University, Ramat Gan, Israel

    Shmuel Tomi Klein

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. Ariel University, Ariel, Israel

    Dana Shapira

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Schlachter, U. (2018). Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets. In: Klein, S., Martín-Vide, C., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2018. Lecture Notes in Computer Science(), vol 10792. Springer, Cham. https://doi.org/10.1007/978-3-319-77313-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-77313-1_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-77312-4

  • Online ISBN: 978-3-319-77313-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation