Abstract
Synthesis for a type of Petri nets is the problem of finding, for a given transition system A, a Petri net N of this type having a state graph that is isomorphic to A, if such a net exists. This paper studies the computational complexity of synthesis for 43 boolean types of Petri nets. It turns out that for 36 of these types synthesis can be done in polynomial time while for the other seven it is NP-hard.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
van der Aalst, W.M.P.: Process Mining - Discovery, Conformance and Enhancement of Business Processes. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19345-3
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
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
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
Badouel, É., Caillaud, B., Darondeau, P.: Distributing finite automata through Petri net synthesis. Formal Asp. Comput. 13(6), 447–470 (2002). https://doi.org/10.1007/s001650200022
Badouel, E., Darondeau, P.: Trace nets and process automata. Acta Informatica 32(7), 647–679 (1995). https://doi.org/10.1007/BF01186645
Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: A region-based theory for state assignment in speed-independent circuits. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 16(8), 793–812 (1997). https://doi.org/10.1109/43.644602
Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures. Part I: basic notions and the representation problem. Acta Informatica 27(4), 315–342 (1990). https://doi.org/10.1007/BF00264611
Goldmann, M., Russell, A.: The complexity of solving equations over finite groups. Inf. Comput. 178(1), 253–262 (2002). https://doi.org/10.1006/inco.2002.3173
Kleijn, J., Koutny, M., Pietkiewicz-Koutny, M., Rozenberg, G.: Step semantics of Boolean nets. Acta Informatica 50(1), 15–39 (2013). https://doi.org/10.1007/s00236-012-0170-2
Montanari, U., Rossi, F.: Contextual nets. Acta Informatica 32(6), 545–596 (1995). https://doi.org/10.1007/BF01178907
Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discret. Comput. Geom. 26(4), 573–590 (2001). https://doi.org/10.1007/s00454-001-0047-6
Pietkiewicz-Koutny, M.: Transition systems of elementary net systems with inhibitor arcs. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 310–327. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63139-9_43
Schmitt, V.: Flip-flop nets. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 515–528. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-60922-9_42
Tarjan, R.E.: Finding optimum branchings. Networks 7(1), 25–35 (1977). https://doi.org/10.1002/net.3230070103
Thiagarajan, P.S.: Elementary net systems. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Central Models and Their Properties. LNCS, vol. 254, pp. 26–59. Springer, Heidelberg (1986). https://doi.org/10.1007/BFb0046835
Tredup, R., Rosenke, C.: Narrowing down the hardness barrier of synthesizing elementary net systems. In: Schewe, S., Zhang, L. (eds.) 29th International Conference on Concurrency Theory, CONCUR 2018. LIPIcs, Beijing, China, 4–7 September 2018, vol. 118, pp. 16:1–16:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). https://doi.org/10.4230/LIPIcs.CONCUR.2018.16
Tredup, R., Rosenke, C.: Towards completely characterizing the complexity of Boolean nets synthesis. CoRR abs/1806.03703 (2018). http://arxiv.org/abs/1806.03703
Tredup, R., Rosenke, C., Wolf, K.: Elementary net synthesis remains NP-complete even for extremely simple inputs. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 40–59. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91268-4_3
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Tredup, R., Rosenke, C. (2019). The Complexity of Synthesis for 43 Boolean Petri Net Types. In: Gopal, T., Watada, J. (eds) Theory and Applications of Models of Computation. TAMC 2019. Lecture Notes in Computer Science(), vol 11436. Springer, Cham. https://doi.org/10.1007/978-3-030-14812-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-14812-6_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14811-9
Online ISBN: 978-3-030-14812-6
eBook Packages: Computer ScienceComputer Science (R0)