{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:42:45Z","timestamp":1725486165547},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430025"},{"type":"electronic","value":"9783540452942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45294-x_12","type":"book-chapter","created":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T22:45:12Z","timestamp":1181601912000},"page":"132-143","source":"Crossref","is-referenced-by-count":10,"title":["Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter"],"prefix":"10.1007","author":[{"given":"Zhe","family":"Dang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierluigi San","family":"Pietro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D. Dill, \u201cThe theory of timed automata,\u201d TCS, 126(2):183\u2013236, 1994","journal-title":"TCS"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P. Abdulla","year":"1996","unstructured":"P. Abdulla and B. Jonsson, \u201cVerifying programs with unreliable channels,\u201d Information and Computation, 127(2): 91\u2013101, 1996","journal-title":"Information and Computation"},{"key":"12_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997","author":"A. Bouajjani","year":"1997","unstructured":"A. Bouajjani, J. Esparza, and O. Maler. \u201cReachability analysis of pushdown automata: application to model-Checking,\u201d CONCUR\u201997, LNCS 1243, pp. 135\u2013150"},{"key":"12_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/3-540-63166-6_31","volume-title":"CAV\u201997","author":"G. Cece","year":"1997","unstructured":"G. Cece and A. Finkel, \u201cPrograms with Quasi-Stable Channels are Effectively Recognizable,\u201d CAV\u201997, LNCS 1254, pp. 304\u2013315"},{"key":"12_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BFb0028751","volume-title":"CAV\u201998","author":"H. Comon","year":"1998","unstructured":"H. Comon and Y. Jurski. \u201cMultiple counters automata, safety analysis and Presburger arithmetic,\u201d CAV\u201998, LNCS 1427, pp. 268\u2013279"},{"key":"12_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-48320-9_18","volume-title":"CONCUR\u201999","author":"H. Comon","year":"1999","unstructured":"H. Comon and Y. Jurski, \u201cTimed automata and the theory of real numbers,\u201d CONCUR\u201999, LNCS 1664, pp. 242\u2013257"},{"key":"12_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/3-540-44585-4_48","volume-title":"CAV\u201901","author":"Z. Dang","year":"2001","unstructured":"Z. Dang, \u201cBinary reachability analysis of timed pushdown automata with dense clocks,\u201d CAV\u201901, LNCS 2102, pp. 506\u2013517"},{"key":"12_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/10722167_9","volume-title":"CAV\u201900","author":"Z. Dang","year":"2000","unstructured":"Z. Dang, O. H. Ibarra, T. Bultan, R. A. Kemmerer and J. Su, \u201cBinary Reachability Analysis of Discrete Pushdown Timed Automata,\u201d CAV\u201900, LNCS 1855, pp. 69\u201384"},{"key":"12_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/3-540-44679-6_59","volume-title":"COCOON\u201901","author":"Z. Dang","year":"2001","unstructured":"Z. Dang, O. H. Ibarra and R. A. Kemmerer, \u201cDecidable Approximations on Generalized and Parameterized Discrete Timed Automata,\u201d COCOON\u201901, LNCS 2108, pp. 529\u2013539"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Z. Dang and R. A. Kemmerer, \u201cUsing the ASTRAL model checker to analyze Mobile IP,\u201d Proceedings of the Twenty-first International Conference on Software Engineering (ICSE\u201999), pp. 132\u2013141, IEEE Press, 1999","DOI":"10.1145\/302405.302459"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Z. Dang and R. A. Kemmerer, \u201cThree approximation techniques forASTRALsymbolic model checking of infinite state real-time systems,\u201d Proceedings of the Twenty-second International Conference on Software Engineering (ICSE\u201900), pp. 345\u2013354, IEEE Press, 2000","DOI":"10.1145\/337180.337220"},{"key":"12_CR12","series-title":"Lect Notes Comput Sci","first-page":"132","volume-title":"STACS\u201901","author":"Z. Dang","year":"2001","unstructured":"Z. Dang, P. San Pietro, and R. A. Kemmerer, \u201cOn Presburger Liveness of Discrete Timed Automata,\u201d STACS\u201901, LNCS 2010, pp. 132\u2013143"},{"key":"12_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/3-540-46541-3_29","volume-title":"STACS\u201900","author":"A. Finkel","year":"2000","unstructured":"A. Finkel and G. Sutre. \u201cDecidability of Reachability Problems for Classes of Two Counter Automata,\u201d STACS\u201900, LNCS 1770, pp. 346\u2013357"},{"key":"12_CR14","unstructured":"A. Finkel, B. Willems, and P. Wolper. \u201cA direct symbolic approach to model checking pushdown systems,\u201d INFINITY\u201997"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O. H. Ibarra","year":"1978","unstructured":"O. H. Ibarra, \u201cReversal-bounded multicounter machines and their decision problems,\u201d J.ACM, 25 (1978) 116\u2013133","journal-title":"J.ACM"},{"key":"12_CR16","unstructured":"O. H. Ibarra, \u201cReachability and safety in queue systems with counters and pushdown stack,\u201d Proceedings of the International Conference on Implementation and Application of Automata, pp. 120\u2013129, 2000"},{"key":"12_CR17","unstructured":"O. H. Ibarra, Z. Dang, and P. San Pietro, \u201cVerification in Loosely Synchronous Queue-Connected Discrete Timed Automata,\u201d submitted. 2001"},{"key":"12_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-44612-5_38","volume-title":"MFCS\u201900","author":"O. H. Ibarra","year":"2000","unstructured":"O. H. Ibarra, J. Su, T. Bultan, Z. Dang, and R. A. Kemmerer, \u201cCounter Machines: Decidable Properties and Applications to Verification Problems,\u201d, MFCS\u201900, LNCS 1893, pp. 426\u2013435"},{"key":"12_CR19","unstructured":"G. Kreisel and J. L. Krevine, \u201cElements of Mathematical Logic,\u201d North-Holland, 1967"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"K. L. McMillan. \u201cSymbolic model-checking-an approach to the state explosion problem,\u201d PhD thesis, Department of Computer Science, Carnegie Mellon University, 1992","DOI":"10.1007\/978-1-4615-3190-6_3"},{"issue":"6\/7","key":"12_CR21","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/BF01185558","volume":"29","author":"W. Peng","year":"1992","unstructured":"W. Peng and S. Purushothaman. \u201cAnalysis of a Class of Communicating Finite State Machines,\u201d Acta Informatica, 29(6\/7): 499\u2013522, 1992","journal-title":"Acta Informatica"},{"issue":"8","key":"12_CR22","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"W. Pugh, \u201cTheOmega test: a fast and practical integer programming algorithm for dependence analysis,\u201d Communications of the ACM, 35(8): 102\u2013114, 1992","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45294-X_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T21:27:54Z","timestamp":1556486874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45294-X_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430025","9783540452942"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45294-x_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}