{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:15:40Z","timestamp":1725747340059},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410352"},{"type":"electronic","value":"9783642410369"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41036-9_16","type":"book-chapter","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T09:49:49Z","timestamp":1378201789000},"page":"171-182","source":"Crossref","is-referenced-by-count":0,"title":["Branching-Time Model Checking Gap-Order Constraint Systems"],"prefix":"10.1007","author":[{"given":"Richard","family":"Mayr","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Totzke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Abdulla, P.A., Delzanno, G.: Constrained multiset rewriting. In: Proc. AVIS 2006, 5th Int. Workshop on on Automated Verification of InfiniteState Systems (2006)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-28332-1_14","volume-title":"Language and Automata Theory and Applications","author":"L. Bozzelli","year":"2012","unstructured":"Bozzelli, L.: Strong termination for gap-order constraint abstractions of counter systems. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 155\u2013168. Springer, Heidelberg (2012)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-27940-9_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L. Bozzelli","year":"2012","unstructured":"Bozzelli, L., Pinchinat, S.: Verification of gap-order constraint abstractions of counter systems. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol.\u00a07148, pp. 88\u2013103. Springer, Heidelberg (2012)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-58201-0_56","volume-title":"Automata, Languages, and Programming","author":"K. Cerans","year":"1994","unstructured":"Cerans, K.: Deciding properties of integral relational automata. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 35\u201346. Springer, Heidelberg (1994)"},{"key":"16_CR5","unstructured":"van Glabbeek, R.J.: The linear time \u2013 branching time spectrum I; the semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch. 1, pp. 3\u201399. Elsevier (2001)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BFb0055053","volume-title":"Automata, Languages and Programming","author":"P. Jan\u010dar","year":"1998","unstructured":"Jan\u010dar, P., Ku\u010dera, A., Mayr, R.: Deciding bisimulation-like equivalenceswith finite-state processes. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 200\u2013211. Springer, Heidelberg (1998)"},{"issue":"3","key":"16_CR7","first-page":"227","volume":"6","author":"A. Ku\u010dera","year":"2006","unstructured":"Ku\u010dera, A., Jan\u010dar, P.: Equivalence-checking on infinite-state systems: Techniques and results. TPLP\u00a06(3), 227\u2013264 (2006)","journal-title":"TPLP"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general petri net reachability problem. SIAM J. Comput.\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"key":"16_CR9","volume-title":"Computation: finite and infinite machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Upper Saddle River (1967)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41036-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T01:26:17Z","timestamp":1558056377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41036-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410352","9783642410369"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41036-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}