Skip to main content
SpringerLink
Log in
Book cover

International Conference on Applications and Theory of Petri Nets and Concurrency

PETRI NETS 2018: Application and Theory of Petri Nets and Concurrency pp 82–98Cite as

Factorisation of Petri Net Solvable Transition Systems

  • Conference paper
  • First Online:

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

Abstract

In recent papers, general conditions were developed to characterise when and how a labelled transition system may be factorised into non-trivial factors. These conditions combine a local property (strong diamonds) and a global one (separation), the latter being of course more delicate to check. Since one of the aims of such a factorisation was to speed up the synthesis of Petri nets from such labelled transition systems, the problem arises to analyse if those conditions (and in particular the global one) could be simplified, or even dropped, in the special case of Petri net solvable behaviours, i.e., when Petri net synthesis is possible. This will be the subject of the present paper.

U. Schlachter—This author is supported by the German Research Foundation (DFG) project ARS (Algorithms for Reengineering and Synthesis), reference number Be 1267/15-1, and partially supported by DFG Research Training Group (DFG GRK 1765) SCARE.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Notes

  1. 1.

    Those properties could be expressed in terms of categories, but we shall refrain from doing this here.

  2. 2.

    For example, the well-known KANBAN example, or Petri nets with k tokens, n transitions and n places arranged in a cycle.

  3. 3.

    Otherwise, only reachability graphs for \(n\le 8\) could be measured before running out of memory on the computer used for measurements.

References

  1. Analysis and Synthesis of Weighted Marked Graph Petri Nets (2018)

    Google Scholar 

  2. Arnold, A.: Finite Transition Systems - Semantics of Communicating Systems. Prentice Hall International Series in Computer Science. Prentice Hall, Upper Saddle River (1994)

    MATH  Google Scholar 

  3. 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 

  4. 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 

  5. 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)

    Article  MathSciNet  Google Scholar 

  6. 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 

  7. Best, E., Darondeau, P.: A decomposition theorem for finite persistent transition systems. Acta Inf. 46(3), 237–254 (2009). http://dx.doi.org/10.1007/s00236-009-0095-6

    Article  MathSciNet  Google Scholar 

  8. 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  MATH  Google Scholar 

  9. Best, E., Devillers, R.: Synthesis of bounded choice-free Petri nets. In: Aceto, L., de Frutos-Escrig, D. (eds.) CONCUR 2015. LIPIcs, vol. 42, pp. 128–141. Schloss Dagstuhl (2015). https://doi.org/10.4230/LIPIcs.CONCUR.2015.128

  10. Best, E., Devillers, R.: Pre-synthesis of Petri nets based on prime cycles and distance paths. Science of Computer Programming (2017)

    Google Scholar 

  11. Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2001). https://doi.org/10.1007/978-3-662-04457-5

    Book  MATH  Google Scholar 

  12. Best, E., Devillers, R., Schlachter, U.: Bounded choice-free Petri net synthesis: algorithmic issues. Acta Informatica (2017). https://doi.org/10.1007/s00236-017-0310-9

  13. Best, E., Schlachter, U.: APT: analysis of Petri nets and transition systems. https://github.com/CvO-Theory/apt

  14. Best, E., Schlachter, U.: Analysis of Petri nets and transition systems. In: Knight, S., Lanese, I., Lluch-Lafuente, A., Vieira, H.T. (eds.) ICE 2015. EPTCS, vol. 189, pp. 53–67 (2015). https://doi.org/10.4204/EPTCS.189.6

  15. Cortadella, J., Kishinevsky, M., Lavagno, L., Yakovlev, A.: Deriving Petri nets for finite transition systems. IEEE Trans. Comput. 47(8), 859–882 (1998). http://dx.doi.org/10.1109/12.707587

    Article  MathSciNet  Google Scholar 

  16. Devillers, R.: Products of transition systems and additions of Petri nets. In: Desel, J., Yakovlev, A. (eds.) ACSD 2016, pp. 65–73. IEEE Computer Society (2016). https://doi.org/10.1109/ACSD.2016.10

  17. Devillers, R.: Factorisation of transition systems. Acta Informatica (2017). https://doi.org/10.1007/s00236-017-0300-y

  18. Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1, 115–138 (1971). https://doi.org/10.1007/BF00289519

    Article  MathSciNet  Google Scholar 

  19. Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures. Part I: basic notions and the representation problem. Acta Informatica 27(4), 315–342 (1990). http://dx.doi.org/10.1007/BF00264611

    Article  MathSciNet  Google Scholar 

  20. Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures. Part II: state spaces of concurrent systems. Acta Informatica 27(4), 343–368 (1990). http://dx.doi.org/10.1007/BF00264612

    Article  MathSciNet  Google Scholar 

  21. 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 

Download references

Acknowledgements

We would like to thank Valentin Spreckels for his help in implementing the factorisation. The anonymous referees made interesting comments, and asked questions that helped improving the presentation.

Author information

Authors and Affiliations

  1. Université Libre de Bruxelles, Boulevard du Triomphe - C.P. 212, 1050, Bruxelles, Belgium

    Raymond Devillers

  2. Department of Computing Science, Carl von Ossietzky Universität, 26111, Oldenburg, Germany

    Uli Schlachter

Authors
  1. Raymond Devillers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. 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. University of Newcastle, Newcastle upon Tyne, United Kingdom

    Victor Khomenko

  2. École Centrale de Nantes, Nantes Cedex 3, France

    Olivier H. Roux

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

Devillers, R., Schlachter, U. (2018). Factorisation of Petri Net Solvable Transition Systems. In: Khomenko, V., Roux, O. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2018. Lecture Notes in Computer Science(), vol 10877. Springer, Cham. https://doi.org/10.1007/978-3-319-91268-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-91268-4_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-91267-7

  • Online ISBN: 978-3-319-91268-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation