{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:22Z","timestamp":1725549502456},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_24","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:40:30Z","timestamp":1268383230000},"page":"287-298","source":"Crossref","is-referenced-by-count":11,"title":["Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Geeraerts","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[]},{"given":"Laurent","family":"Van Begin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","first-page":"313","volume-title":"Proc. LICS 1996","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General Decidability Theorems for Infinite-state Systems. In: Proc. LICS 1996, pp. 313\u2013321. IEEE, Los Alamitos (1996)"},{"key":"24_CR2","first-page":"160","volume-title":"Proc. LICS 1993","author":"P.A. Abdulla","year":"1993","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying Programs with Unreliable Channels. In: Proc. LICS 1993, pp. 160\u2013170. IEEE, Los Alamitos (1993)"},{"issue":"1","key":"24_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(76)90067-0","volume":"3","author":"T. Araki","year":"1977","unstructured":"Araki, T., Kasami, T.: Some decision problems related to the reachability problem for petri nets. Theoretical Computer Science\u00a03(1), 85\u2013104 (1977)","journal-title":"Theoretical Computer Science"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-49116-3_30","volume-title":"STACS 1999","author":"A. Bouajjani","year":"1999","unstructured":"Bouajjani, A., Mayr, R.: Model checking lossy vector addition systems. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 323\u2013333. Springer, Heidelberg (1999)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-58152-9_11","volume-title":"Application and Theory of Petri Nets 1994","author":"G. Ciardo","year":"1994","unstructured":"Ciardo, G.: Petri nets with marking-dependent arc multiplicity: properties and analysis. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol.\u00a0815, pp. 179\u2013198. Springer, Heidelberg (1994)"},{"key":"24_CR6","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":"24_CR7","first-page":"352","volume-title":"Proc. LICS 1999","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the Verification of Broadcast Protocols. In: Proc. LICS 1999, pp. 352\u2013359. IEEE, Los Alamitos (1999)"},{"key":"24_CR8","first-page":"70","volume-title":"Proc. LICS 1998","author":"E.A. Emerson","year":"1998","unstructured":"Emerson, E.A., Namjoshi, K.S.: On Model Checking for Non-deterministic Infinite-state Systems. In: Proc. LICS 1998, pp. 70\u201380. IEEE, Los Alamitos (1998)"},{"key":"24_CR9","series-title":"ENTCS","volume-title":"Proc. INFINITY 2002","author":"A. Finkel","year":"2002","unstructured":"Finkel, A., Raskin, J.-F., Samuelides, M., Van Begin, L.: Monotonic Extensisions of Petri Nets: Forward and Backward Search Revisited. In: Proc. INFINITY 2002. ENTCS, vol.\u00a068(6). Elsevier, Amsterdam (2002)"},{"issue":"1-2","key":"24_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! Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"S.M. German","year":"1992","unstructured":"German, S.M., Sistla, A.P.: Reasoning about systems with many processes. JACM\u00a039(3), 675\u2013735 (1992)","journal-title":"JACM"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1023\/A:1026228213080","volume":"23","author":"T.A. Henzinger","year":"2003","unstructured":"Henzinger, T.A., Kupferman, O., Qadeer, S.: From prehistoric to postmodern symbolic model checking. Formal Methods in System Design\u00a023(3), 303\u2013327 (2003)","journal-title":"Formal Methods in System Design"},{"key":"24_CR13","series-title":"ENTCS","volume-title":"Proc. INFINITY 2003","author":"J.-F. Raskin","year":"2003","unstructured":"Raskin, J.-F., Van Begin, L.: Petri Nets with Non-blocking Arcs are Difficult to Analyse. In: Proc. INFINITY 2003. ENTCS, vol.\u00a096. Elsevier, Amsterdam (2003)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","first-page":"527","volume-title":"Proc. MFCS 1978","author":"R. Valk","year":"1978","unstructured":"Valk, R.: On the computational power of extended petri nets. In: Proc. MFCS 1978. LNCS, vol.\u00a064, pp. 527\u2013535. Springer, Heidelberg (1978)"},{"key":"24_CR15","unstructured":"Van Begin, L.: Efficient Verification of Counting Abstractions for Parametric systems. PhD thesis, Universit\u00e9 Libre de Bruxelles, Belgium (2003)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T03:18:16Z","timestamp":1539141496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}