{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:09:20Z","timestamp":1767236960117},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319405773"},{"type":"electronic","value":"9783319405780"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40578-0_7","type":"book-chapter","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T20:25:20Z","timestamp":1467231920000},"page":"105-118","source":"Crossref","is-referenced-by-count":2,"title":["Reversible Computation vs. Reversibility in Petri Nets"],"prefix":"10.1007","author":[{"given":"Kamila","family":"Barylska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Mikulski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Pi\u0105tkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,30]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(77)90059-7","volume":"4","author":"T Araki","year":"1977","unstructured":"Araki, T., Kasami, T.: Decidable problems on the strong connectivity of Petri net reachability sets. Theoret. Comput. Sci. 4(1), 99\u2013119 (1977)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"7_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G Berry","year":"1992","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. Theoret. Comput. Sci. 96(1), 217\u2013248 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(92)90048-K","volume":"101","author":"E Best","year":"1992","unstructured":"Best, E., Desel, J., Esparza, J.: Traps characterize home states in free choice systems. Theoret. Comput. Sci. 101, 161\u2013176 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"7_CR4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ipl.2016.01.011","volume":"116","author":"E Best","year":"2016","unstructured":"Best, E., Esparza, J.: Existence of home states in Petri nets is decidable. Inf. Process. Lett. 116(6), 423\u2013427 (2016)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Best, E., Schlachter, U.: Analysis of Petri nets and transition systems. In: Proceedings of 8th Interaction and Concurrency Experience (ICE 2015), EPTCS, vol. 189, pp. 53\u201367 (2015)","key":"7_CR5","DOI":"10.4204\/EPTCS.189.6"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00289141","volume":"21","author":"E Best","year":"1984","unstructured":"Best, E., Klaus, V.: Free choice systems have home states. Acta Informatica 21, 89\u2013100 (1984)","journal-title":"Acta Informatica"},{"doi-asserted-by":"crossref","unstructured":"Cardelli, L., Laneve, C.: Reversible structures. In: Fages, F. (ed.) Proceedings of 9th International Computational Methods in Systems Biology (CMSB 2011), pp. 131\u2013140. ACM (2011)","key":"7_CR7","DOI":"10.1145\/2037509.2037529"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/11539452_31","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V Danos","year":"2005","unstructured":"Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 398\u2013412. Springer, Heidelberg (2005)"},{"issue":"3","key":"7_CR10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.entcs.2006.07.036","volume":"175","author":"V Danos","year":"2007","unstructured":"Danos, V., Krivine, J., Sobocinski, P.: General reversibility. Electron. Notes Theoret. Comput. Sci. 175(3), 75\u201386 (2007)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"unstructured":"de Frutos Escrig, D., Johnen, C.: Decidability of home space property. Technical report 503, Laboratoire de Recherche en Informatique, Universit\u00e9 de Paris-Sud (1989)","key":"7_CR11"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(93)90154-L","volume":"114","author":"J Desel","year":"1993","unstructured":"Desel, J., Esparza, J.: Reachability in cyclic extended free-choice systems. Theoret. Comput. Sci. 114, 93\u2013118 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/3-540-56689-9_45","volume-title":"Advances in Petri Nets 1993","author":"A Finkel","year":"1993","unstructured":"Finkel, A.: The minimal coverability graph for Petri nets. In: Rozenberg, G. (ed.) Petri Nets 1993. LNCS, vol. 674, pp. 210\u2013243. Springer, Heidelberg (1993)"},{"unstructured":"Michael, H.: Decidability questions for Petri nets. Technical report TR-161, MIT Laboratory for Computer Science (1976)","key":"7_CR14"},{"unstructured":"Michael, H.: Petri net languages. Technical report TR 159, MIT Laboratory for Computer Science (1976)","key":"7_CR15"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-319-19488-2_12","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"T Hujsa","year":"2015","unstructured":"Hujsa, T., Delosme, J.-M., Munier-Kordon, A.: On the reversibility of live equal-conflict Petri nets. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 234\u2013253. Springer, Heidelberg (2015)"},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R Karp","year":"1969","unstructured":"Karp, R., Miller, R.: Parallel program schemata. J. Comput. Syst. Sci. 3, 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR18","first-page":"19","volume":"47","author":"D Kezi\u0107","year":"2006","unstructured":"Kezi\u0107, D., Peri\u0107, N., Petrovi\u0107, I.: An algorithm for deadlock prevention based on iterative siphon control of Petri net. Automatika 47, 19\u201330 (2006)","journal-title":"Automatika"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/978-3-642-15375-4_33","volume-title":"CONCUR 2010 - Concurrency Theory","author":"I Lanese","year":"2010","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversing higher-order Pi. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 478\u2013493. Springer, Heidelberg (2010)"},{"key":"7_CR20","first-page":"672","volume":"7","author":"HA \u00d6zkan","year":"2008","unstructured":"\u00d6zkan, H.A., Aybar, A.: A reversibility enforcement approach for Petri nets using invariants. WSEAS Trans. Syst. 7, 672\u2013681 (2008)","journal-title":"WSEAS Trans. Syst."},{"issue":"1\u20132","key":"7_CR21","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"I Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1\u20132), 70\u201396 (2007)","journal-title":"J. Log. Algebr. Program."},{"issue":"6","key":"7_CR22","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.jlamp.2015.07.004","volume":"84","author":"I Phillips","year":"2015","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and asymmetric conflict in event structures. J. Log. Algebr. Methods Program. 84(6), 781\u2013805 (2015)","journal-title":"J. Log. Algebr. Methods Program."},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/978-3-642-36315-3_18","volume-title":"Reversible Computation","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK signalling pathway. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 218\u2013232. Springer, Heidelberg (2013)"},{"issue":"2","key":"7_CR24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/70.681245","volume":"14","author":"L Recalde","year":"1998","unstructured":"Recalde, L., Teruel, E., Silva, M.: Modeling and analysis of sequential processes that cooperate through buffers. IEEE Trans. Robot. Autom. 14(2), 267\u2013277 (1998)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"7_CR25","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science, vol. 4. Springer, Berlin (1985)"},{"key":"7_CR26","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/3468.553226","volume":"27","author":"E Teruel","year":"1997","unstructured":"Teruel, E., Silva, M., Colom, J.M.: Choice-free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals. IEEE Trans. Syst. Man Cybern. Part A 27, 73\u201383 (1997)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-56863-8_59","volume-title":"Application and Theory of Petri Nets 1993","author":"E Teruel","year":"1993","unstructured":"Teruel, E., Silva, M.: Liveness and home states in equal conflict systems. PETRI NETS 1993. LNCS, vol. 691, pp. 415\u2013432. Springer, Heidelberg (1993)"},{"key":"7_CR28","first-page":"18","volume":"32","author":"W Vogler","year":"1989","unstructured":"Vogler, W.: Live and bounded free choice nets have home states. Petri Net Newslett. 32, 18\u201321 (1989)","journal-title":"Petri Net Newslett."},{"issue":"7","key":"7_CR29","first-page":"4225","volume":"12","author":"P Wang","year":"2011","unstructured":"Wang, P., Ding, Z., Chai, H.: An algorithm for generating home states of Petri nets. J. Comput. Inf. Syst. 12(7), 4225\u20134232 (2011)","journal-title":"J. Comput. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40578-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:28:27Z","timestamp":1498325307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40578-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405773","9783319405780"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40578-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}