Abstract
We present a simple characterization of the set of Petri net solvable binary words. It states that they are exactly the extensions of the prefixes of Petri net cyclic solvable words, by some prefix \(x^k\), where x is any letter of the binary alphabet being considered, and k is any natural number. We derive several consequences of this characterization which, in a way, shows that the set of solvable words is ‘smaller than expected’. Therefore, the existing conjecture that all of them can be generated by quite simple net is not only confirmed, but indeed reinforced. As a byproduct of the characterization, we also present a linear time algorithm for deciding whether a binary word is solvable. The key idea is that the connection with the cyclic solvable words induces certain structural regularity. Therefore, one just needs to look for possible irregularities, which can be done in a structural way, resulting in a rather surprising linearity of the decision algorithm. Finally, we employ the obtained results to provide a characterization of reversible binary transition systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47967-4
Barylska, K., Best, E., Erofeev, E., Mikulski, Ł., Piątkowski, M.: 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. LNCS, vol. 9930, pp. 137–159. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53401-4_7
Barylska, K., Erofeev, E., Koutny, M., Mikulski, Ł., Piątkowski, M.: Reversing transitions in bounded Petri nets. Fundam. Inform. 157(1–4), 341–357 (2018)
Barylska, K., Koutny, M., Mikulski, Ł., Piątkowski, M.: Reversible computation vs. reversibility in Petri nets. Sci. Comput. Program. 151, 48–60 (2018)
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, Cham (2016). https://doi.org/10.1007/978-3-319-39086-4_4
Erofeev, E., Barylska, K., Mikulski, Ł., Piątkowski, M.: Generating all minimal Petri net unsolvable binary words. In: Proceedings of PSC 2016, pp. 33–46 (2016)
Acknowledgement
This research was supported by Cost Action IC1405. The first author was partially supported by the Spanish projects TRACES (TIN2015-67522-C3-3) and N-GREENS (S2013/ICE-2731).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
de Frutos Escrig, D., Koutny, M., Mikulski, Ł. (2018). An Efficient Characterization of Petri Net Solvable Binary Words. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-91268-4_11
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)