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. Two conjectures providing different characterisations of this class of words are motivated and proposed. One conjecture characterises the class in terms of pattern-matching, the other in terms of letter-counting. Several results are described which amount to a partial proof of these conjectures.
K. Barylska, Ł. Mikulski and M. Piątkowski—Supported by the Polish Nat. Sci. Center (grant no. 2013/09/D/ST6/03928).
E. Best and E. Erofeev—Supported by DFG CAVER, ARS, and http://www.uni-oldenburg.de/en/scare/.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Badouel, É., 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/Vol-1371
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 2015 (2015). doi:10.4230/LIPIcs.CONCUR.2015.128, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, 128–141
Best, E., Devillers, R.: Characterisation of the state spaces of marked graph Petri nets. In: Dediu, A.H., et al. (eds) Selected Extended Papers of LATA 2014, To appear in Information and Computation, 20 p. (2015)
Best, E., Erofeev, E., Schlachter, U., Wimmel, H.: Characterising Petri net solvable binary words. In: Kordon, F., Moldt, D. (eds.) PETRI NETS 2016. LNCS, vol. 9698, pp. 39–58. Springer, Heidelberg (2016). doi:10.1007/978-3-319-39086-4_4
Best, E., Schlachter, U.: Analysis of Petri nets and transition systems. In: Knight, S., Lanese, I., Lafuente, A.L., Vieira, H.T. (eds.) Proceedings of the 8th Interaction and Concurrency Experience, Electronic Proceedings in Theoretical Computer Science, vol. 189, pp. 53–67, June 2015. http://eptcs.web.cse.unsw.edu.au/paper.cgi?ICE2015.6
Commoner, F., Holt, A.W., Even, S., Pnueli, A.: Marked directed graphs. J. Comput. Syst. Sci. 5(5), 511–523 (1971)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)
Erofeev, E., Barylska, K., Mikulski, Ł., Piątkowski, M.: Generating all minimal Petri net unsolvable binary words (2016). http://folco.mat.umk.pl/papers/generating-binary-muws.pdf
Karmarkar, N.: https://en.wikipedia.org/wiki/Karmarkar’s_algorithm
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. JACM 25(3), 352–364 (1978)
Piątkowski, M., et al.: http://folco.mat.umk.pl/unsolvable-words (2015)
Reisig, W.: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies, 211 p. Springer, Hiedelberg (2013). ISBN 978-3-642-33278-4
Schlachter, U., et al.: https://github.com/CvO-Theory/apt (2013)
Acknowledgments
We would like to thank Raymond Devillers, Thomas Hujsa, Uli Schlachter and Harro Wimmel for valuable comments. We also thank the anonymous reviewers for their remarks which allowed to improve the presentation of the paper.
Note added in proof. This paper extends [2] by Sect. 5 and a few other enhancements. At the time of revision (May 2016), the conjectures stated in Sects. 3.3 and 4.2 have been proved correct. These proofs are contained in [5, 9].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Barylska, K., Best, E., Erofeev, E., Mikulski, Ł., Piątkowski, M. (2016). Conditions for Petri Net Solvable Binary Words. In: Koutny, M., Desel, J., Kleijn, J. (eds) Transactions on Petri Nets and Other Models of Concurrency XI. Lecture Notes in Computer Science(), vol 9930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-53401-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-53401-4_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-53400-7
Online ISBN: 978-3-662-53401-4
eBook Packages: Computer ScienceComputer Science (R0)