Skip to main content
SpringerLink
Log in

Synthesis of (Choice-Free) Reset Nets

  • Conference paper
  • First Online:
Application and Theory of Petri Nets and Concurrency (PETRI NETS 2021)

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

Abstract

Instead of synthesising a labelled transition system into a weighted Petri net, we shall here consider the larger class of nets with reset arcs, allowing to instanciate a larger class of transition systems. We shall also target an extension of choice-free nets with reset arcs, since choice-free nets appeared to be especially interesting in terms of properties, synthesis and implementation. In addition to a general algorithm, we shall analyse how to speed it up by reducing the number and complexity of the linear systems of constraints to be solved and how to set up a pre-synthesis phase. We shall also envisage how to implement the result of such a synthesis as a concurrent program.

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.

    not to be confused with free-choice nets [9].

  2. 2.

    Note however that, since \(\mathbb {B}(b)\) may be null, several configurations of the left kind may intersect.

References

  1. Araki, T., Kasami, T.: Some decision problems related to the reachability problem for Petri nets. Theor. Comput. Sci. 3(1), 85–104 (1976)

    Article  MathSciNet  Google Scholar 

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

    Book  MATH  Google Scholar 

  3. Badouel, E., Bernardinello, L., Darondeau, P.: The synthesis problem for elementary net systems is NP-complete. Theor. Comput. Sci. 186(1–2), 107–134 (1997). https://doi.org/10.1016/S0304-3975(96)00219-8

    Article  MathSciNet  MATH  Google Scholar 

  4. Best, E., Devillers, R.: Characterisation of the state spaces of live and bounded marked graph Petri nets. In: 8th International Conference on Language and Automata Theory and Applications (LATA 2014), pp. 161–172 (2014). https://doi.org/10.1007/978-3-319-04921-2_13

  5. Best, E., Devillers, R.: Synthesis of persistent systems. In: 35th International Conference on Application and Theory of Petri Nets and Concurrency (ICATPN 2014), pp. 111–129 (2014). https://doi.org/10.1007/978-3-319-07734-5_7

  6. Best, E., Devillers, R., Erofeev, E., Wimmel, H.: Target-oriented Petri net synthesis. Fundamenta Informaticae 175, 97–122 (2020). https://doi.org/10.3233/FI-2020-1949

    Article  MathSciNet  Google Scholar 

  7. Best, E., Devillers, R., Schlachter, U.: Bounded choice-free Petri net synthesis: algorithmic issues. Acta Inf. 55(7), 575–611 (2018)

    Article  MathSciNet  Google Scholar 

  8. Best, E., Devillers, R.R., Erofeev, E.: A new property of choice-free Petri net systems. In: Application and Theory of Petri Nets and Concurrency - 41st International Conference, PETRI NETS 2020, Paris, France, 24–25 June 2020, Proceedings, pp. 89–108 (2020). https://doi.org/10.1007/978-3-030-51831-8_5

  9. Desel, J., Esparza, J.: Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge University Press, New York (1995)

    Book  Google Scholar 

  10. Desel, J., Reisig, W.: The synthesis problem of Petri nets. Acta Inf. 33(4), 297–315 (1996)

    Article  MathSciNet  Google Scholar 

  11. Devillers, R.: Products of transition systems and additions of petri nets. In: Desel, J., Yakovlev, A. (eds.) Proceedings 16th International Conference on Application of Concurrency to System Design (ACSD 2016), pp. 65–73 (2016). https://doi.org/10.1109/ACSD.2016.10

  12. Devillers, R.: Articulation of transition systems and its application to Petri net synthesis. In: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, 23–28 June 2019, Proceedings, pp. 113–126 (2019)

    Google Scholar 

  13. Devillers, R., Hujsa, T.: Analysis and synthesis of weighted marked graph Petri nets. In: Application and Theory of Petri Nets and Concurrency - 39th International Conference, PETRI NETS 2018, Bratislava, Slovakia, 24–29 June 2018, Proceedings, pp. 19–39 (2018)

    Google Scholar 

  14. Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Automata, Languages and Programming, 25th International Colloquium, ICALP’98, Aalborg, Denmark, 13–17 July 1998, Proceedings, pp. 103–115 (1998). https://doi.org/10.1007/BFb0055044

  15. Grabowski, J.: On partial languages. Fundam. Informaticae 4(2), 427–498 (1981)

    Article  MathSciNet  Google Scholar 

  16. Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373–396 (1984)

    Article  MathSciNet  Google Scholar 

  17. Karp, R., Miller, R.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147–195 (1969)

    Article  MathSciNet  Google Scholar 

  18. Keller, R.M.: A fundamental theorem of asynchronous parallel computation. In: Feng, T. (ed.) Parallel Processing. LNCS, vol. 24, pp. 102–112. Springer, Heidelberg (1975). https://doi.org/10.1007/3-540-07135-0_113

    Chapter  Google Scholar 

  19. Schlachter, U.: Over-approximative Petri net synthesis for restricted subclasses of nets. In: Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, 9–11 April 2018, Proceedings, pp. 296–307 (2018). https://doi.org/10.1007/978-3-319-77313-1_23

  20. Teruel, E., Colom, J.M., Silva, M.: Choice-free petri nets: a model for deterministic concurrent systems with bulk services and arrivals. IEEE Trans. Syst. Man Cybern. Part A 27(1), 73–83 (1997). https://doi.org/10.1109/3468.553226

    Article  Google Scholar 

  21. Tredup, R.: Hardness results for the synthesis of b-bounded Petri nets. In: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, 23–28 June 2019, Proceedings, pp. 127–147 (2019). https://doi.org/10.1007/978-3-030-21571-2_9

Download references

Acknowledgements

We want to thank the anonymous referees for their careful reading, as well as Eike Best for his encouragements, and some interesting examples.

Author information

Authors and Affiliations

  1. Département d’Informatique, Université Libre de Bruxelles, 1050, Brussels, Belgium

    Raymond Devillers

Authors
  1. Raymond Devillers
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raymond Devillers .

Editor information

Editors and Affiliations

  1. Université de Genève, Carouge, Switzerland

    Didier Buchs

  2. Universitat Politècnica de Catalunya, Barcelona, Spain

    Josep Carmona

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Devillers, R. (2021). Synthesis of (Choice-Free) Reset Nets. In: Buchs, D., Carmona, J. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2021. Lecture Notes in Computer Science(), vol 12734. Springer, Cham. https://doi.org/10.1007/978-3-030-76983-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-76983-3_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-76982-6

  • Online ISBN: 978-3-030-76983-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation