{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:14:22Z","timestamp":1770279262675,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540656913","type":"print"},{"value":"9783540491163","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_30","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:56:14Z","timestamp":1187254574000},"page":"323-333","source":"Crossref","is-referenced-by-count":39,"title":["Model Checking Lossy Vector Addition Systems"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"P. Abdulla, K. Cerans, B. Jonsson, and Y-K. Tsay. General Decidability Theorems for Infinite-state Systems. In LICS\u201996. IEEE, 1996.","DOI":"10.1109\/LICS.1996.561359"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"P. Abdulla and B. Jonsson. Verifying Programs with Unreliable Channels. In LICS\u201993. IEEE, 1993.","DOI":"10.1109\/LICS.1993.287591"},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.1996.0083","volume":"130","author":"P. Abdulla","year":"1996","unstructured":"P. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71\u201390, 1996.","journal-title":"Information and Computation"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1996","unstructured":"G\u00e9rard C\u00e9c\u00e9, Alain Finkel, and S. Purushothaman Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. Information and Computation, 124(1):20\u201331, 1996.","journal-title":"Information and Computation"},{"key":"30_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of ICALP\u201998","author":"C. Dufourd","year":"1998","unstructured":"C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset nets between decidability and undecidability. In Proc. of ICALP\u201998, volume 1443 of LNCS, Springer Verlag, 1998."},{"key":"30_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-60045-0_62","volume-title":"CAV\u201995","author":"J. Esparza","year":"1995","unstructured":"J. Esparza and A. Kiehn. On the model checking problem for branching time logics and Basic Parallel Processes. In CAV\u201995, volume 939 of LNCS, pages 353\u2013366. Springer Verlag, 1995."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"34","author":"J. Esparza","year":"1997","unstructured":"J. Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34:85\u2013107, 1997.","journal-title":"Acta Informatica"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"O. Grumberg and D. Long. Model Checking and Modular Verification. ACM Transactions on Programming Languages and Systems, 16, 1994.","DOI":"10.1145\/177492.177725"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"R. Karp and R. Miller. Parallel program schemata. JCSS, 3, 1969.","DOI":"10.1016\/S0022-0000(69)80011-5"},{"key":"30_CR10","unstructured":"R. Mayr. Lossy counter machines. Technical Report TUM-I9827, TU-M\u00fcnchen, October 1998. http:\/\/www.brauer.inforrnatik.tu-muenchen.de\/~mayrri ."},{"key":"30_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Computation Tree Logic and Regular \u03c9-Languages","author":"W. Thomas","year":"1989","unstructured":"W. Thomas. Computation Tree Logic and Regular \u03c9-Languages. LNCS 354, 1989."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on Infinite Objects. In Handbook of Theo. Comp. Sci. Elsevier Sci. Pub., 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"R. Valk and M. Jantzen. The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Informatica, 21, 1985.","DOI":"10.1007\/BF00289715"}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:43:04Z","timestamp":1556757784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}