{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:56:04Z","timestamp":1725490564961},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424918"},{"type":"electronic","value":"9783540446743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44674-5_13","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T09:49:49Z","timestamp":1188294589000},"page":"157-169","source":"Crossref","is-referenced-by-count":2,"title":["Generalizing the Discrete Timed Automaton"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwen","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D. Dill. Automata for modeling real-time systems. Theoretical Computer Science, 126(2), pp. 83\u2013236, 1994.","journal-title":"Theoretical Computer Science"},{"key":"13_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Hybrid Systems II","author":"A. Bouajjani","year":"1995","unstructured":"A. Bouajjani, R. Echahed, and R. Robbana. On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures. In Hybrid Systems II, LNCS 999, 1995."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"A. Cherubini, L. Breveglieri, C. Citrini, and S.C. Reghizzi. Multiple push-down languages and grammars. Int. J. of Foundations of Computer Science, pp. 253\u2013291, 1996.","DOI":"10.1142\/S0129054196000191"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. Proc. 10th Int. Conf. on Computer Aided Verification, pp. 268\u2013279, 1998.","DOI":"10.1007\/BFb0028751"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"H. Comon and Y. Jurski. Timed automata and the theory of real numbers. Proc. 10th Int. Conf. on Concurrency Theory, pp. 242\u2013257, 1999.","DOI":"10.1007\/3-540-48320-9_18"},{"key":"13_CR6","unstructured":"Z. Dang. Verification and Debugging of Infinite State Real-time Systems. Ph.D. Thesis. University of California, Santa Barbara, 2000."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Z. Dang, O.H. Ibarra, T. Bultan, R.A. Kemmerer, and J. Su. Binary reachability analysis of discrete pushdown timed automata. Int. Conf. on Computer Aided Verification, 2000.","DOI":"10.1007\/10722167_9"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"O.H. Ibarra. Reversal-bounded multicounter machines and their decision problems. J. of the Association for Computing Machinery, 25, pp. 116\u2013133, 1978.","journal-title":"J. of the Association for Computing Machinery"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"O.H. Ibarra, T. Bultan, and J. Su. Reachability analysis for some models of infinite-state transition systems. Proc. 10th Int. Conf. on Concurrency Theory, 2000.","DOI":"10.1007\/3-540-44618-4_15"},{"key":"13_CR10","unstructured":"O.H. Ibarra, Z. Dang, and P. San Pietro. Queue-Connected Discrete Timed Automata. In preparation."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"M. Minsky. Recursive unsolvability of Post\u2019s problem of Tag and other topics in the theory of Turing machines. Ann. of Math., 74, pp. 437\u2013455, 1961.","journal-title":"Ann. of Math"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44674-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:06:07Z","timestamp":1556802367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44674-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424918","9783540446743"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44674-5_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}