Abstract
A word is called Petri net solvable if it is isomorphic to the reachability graph of an unlabelled Petri net. In this paper, the class of finite, two-letter, Petri net solvable words is studied. A linear time, necessary condition allows for an educated guess at which words are solvable and which are not. A full decision procedure with a time complexity of \(O(n^2)\) can be built based on letter counting. The procedure is fully constructive and can either yield a Petri net solving a given word or determine why this fails. Algorithms solving the same problem based on systems of integer inequalities reflecting the potential Petri net structure are only known to be in \(O(n^3)\). Finally, the decision procedure can be adapted from finite to cyclic words.
This research has been supported by DFG (German Research Foundation) through grants Be 1267/15-1 ARS (Algorithms for Reengineering and Synthesis), Be 1267/14-1 CAVER (Comparative Analysis and Verification for Correctness-Critical Systems), and Graduiertenkolleg GRK-1765 SCARE (System Correctness under Adverse Conditions).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Badouel, É., Bernardinello, L., Darondeau, P.: Petri Net Synthesis, 339 p. Springer, Heidelberg (2015). ISBN 978-3-662-47966-7
Barylska, K., Best, E., Erofeev, E., Mikulski, Ł., Piątkowski, M.: On binary words being Petri net solvable. In: Carmona, J., Bergenthum, R., van der Aalst, W. (eds) Proceedings of the ATAED 2015, pp. 1–15 (2015). http://ceur-ws.org/Vol1371
Best, E., Devillers, R.: Synthesis of bounded choice-free Petri nets. In: Aceto, L., Frutos Escrig, D. (eds) Proceedings of the 26th International Conference on Concurrency Theory (CONCUR 2015), LIPICS, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, pp. 128-141 (2015). doi:10.4230/LIPIcs.CONCUR.2015.128
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, Heidelberg (2014)
Caillaud, B.: http://www.irisa.fr/s4/tools/synet/
Khachiyan, L.: Selected Works, Moscow Center for Mathematical Continuous Education, ISBN 978-5-94057-509-2, 519 pages (2009). (in Russian)
Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989)
Landweber, L.H., Robertson, E.L.: Properties of conflict-free and persistent Petri nets. J. ACM 25(3), 352–364 (1978)
Reisig, W.: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies, 211 p. Springer, Heidelberg (2013). ISBN 978-3-642-33278-4
Schlachter, U. et al.: (2013). https://github.com/CvO-Theory/apt
Acknowledgments
We would like to thank Raymond Devillers for his very helpful suggestions to improve this paper and Valentin Spreckels for his valuable support in computing the experimental data.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Best, E., Erofeev, E., Schlachter, U., Wimmel, H. (2016). Characterising Petri Net Solvable Binary Words. In: Kordon, F., Moldt, D. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2016. Lecture Notes in Computer Science(), vol 9698. Springer, Cham. https://doi.org/10.1007/978-3-319-39086-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-39086-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39085-7
Online ISBN: 978-3-319-39086-4
eBook Packages: Computer ScienceComputer Science (R0)