{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:04:01Z","timestamp":1725732241857},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386961"},{"type":"electronic","value":"9783642386978"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38697-8_4","type":"book-chapter","created":{"date-parts":[[2013,6,18]],"date-time":"2013-06-18T21:48:46Z","timestamp":1371592126000},"page":"49-69","source":"Crossref","is-referenced-by-count":4,"title":["\u03c9-Petri Nets"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Geeraerts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Heussner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Praveen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General Decidability Theorems for Infinite-state Systems. In: LICS 1996. IEEE (1996)"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1090\/S0002-9939-1976-0396605-3","volume":"55","author":"I. Borosh","year":"1976","unstructured":"Borosh, I., Treybig, L.: Bounds on positive integral solutions of linear diophantine equations. Proceedings of the American Mathematical Society\u00a055(2), 299\u2013304 (1976)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-14162-1_40","volume-title":"Automata, Languages and Programming","author":"T. Br\u00e1zdil","year":"2010","unstructured":"Br\u00e1zdil, T., Jan\u010dar, P., Ku\u010dera, A.: Reachability games on extended vector addition systems with states. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 478\u2013489. Springer, Heidelberg (2010)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-46002-0_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Delzanno","year":"2002","unstructured":"Delzanno, G., Raskin, J.-F., Van Begin, L.: Towards the Automated Verification of Multithreaded Java Programs. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 173\u2013187. Springer, Heidelberg (2002)"},{"key":"4_CR5","unstructured":"Delzano, G.: Constraint-Based Verification of Parameterized Cache Coherence Protocols. FMSD\u00a023(3) (2003)"},{"key":"4_CR6","unstructured":"Dufourd, C.: R\u00e9seaux de Petri avec reset\/transfert: D\u00e9cidabilit\u00e9 et ind\u00e9cidabilit\u00e9. PhD thesis, ENS de Cachan (1998)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets Between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1999","unstructured":"Dufourd, C., Jan\u010dar, P., Schnoebelen, P.: Boundedness of reset P\/T nets. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 301\u2013310. Springer, Heidelberg (1999)"},{"key":"4_CR9","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the Verification of Broadcast Protocols. In: LICS 1999. IEEE (1999)"},{"issue":"1-2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! TCS\u00a0256(1-2), 63\u201392 (2001)","journal-title":"TCS"},{"issue":"1-2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.01.005","volume":"195","author":"A. Finkel","year":"2004","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing Petri net extensions. Inf. Comput.\u00a0195(1-2), 1\u201329 (2004)","journal-title":"Inf. Comput."},{"key":"4_CR12","unstructured":"Geeraerts, G., Heu\u00dfner, A., Raskin, J.F.: Queue-Dispatch Asynchronous Systems. In: To appear in the Proceedings of ACSD. IEEE (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1201.4871"},{"key":"4_CR13","unstructured":"Geeraerts, G., Heu\u00dfner, A., Praveen, M., Raskin, J.F.: \u03c9-Petri nets ArXiV.org CoRR abs\/1301.6572 (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1301.6572"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, enlarge and check: New algorithms for the coverability problem of wsts. J. Comput. Syst. Sci.\u00a072(1) (2006)","DOI":"10.1016\/j.jcss.2005.09.001"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"S. German","year":"1992","unstructured":"German, S., Sistla, A.: Reasoning about systems with many processes. J. ACM\u00a039(3), 675\u2013735 (1992)","journal-title":"J. ACM"},{"key":"4_CR16","first-page":"147","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel Program Schemata. JCSS\u00a03, 147\u2013195 (1969)","journal-title":"JCSS"},{"key":"4_CR17","unstructured":"Lipton, R.: The reachability problem requires exponential space. Tech. Report. Yale University (1963)"},{"issue":"13","key":"4_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"3","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. of Computing\u00a03(13), 441\u2013460 (1984)","journal-title":"SIAM J. of Computing"},{"key":"4_CR19","unstructured":"Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Institut fur Instrumentelle Mathematik, Bonn (1962)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. TCS\u00a06, 223\u2013231 (1978)","journal-title":"TCS"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Petri Nets: An Introduction. Springer (1985)","DOI":"10.1007\/978-3-642-69968-9"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P. Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 616\u2013628. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38697-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T04:06:28Z","timestamp":1557806788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38697-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386961","9783642386978"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38697-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}