{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:56Z","timestamp":1725488516368},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_2","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"13-34","source":"Crossref","is-referenced-by-count":13,"title":["A Classification of Symbolic Transition Systems"],"prefix":"10.1007","author":[{"given":"Thomas A.","family":"Henzinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3\u201334, 1995.","journal-title":"Theoretical Computer Science"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"P. A. Abdulla, K. \u010cer\u0101ns, B. Jonsson, and Y.-K. Tsay. General decidability theorems for infinite-state systems. In Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 313\u2013321. IEEE Computer Society Press, 1996.","DOI":"10.1109\/LICS.1996.561359"},{"key":"2_CR3","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.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183\u2013235, 1994.","journal-title":"Theoretical Computer Science"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"R. Alur and T.A. Henzinger. Computer-aided Verification: An Introduction to Model Building and Model Checking for Concurrent Systems. Draft, 1998.","DOI":"10.1007\/BFb0028774"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/32.489079","volume":"22","author":"R. Alur","year":"1996","unstructured":"R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 22:181\u2013201, 1996.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"2_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/BFb0054179","volume-title":"TACAS 98: Tools and Algorithms for Construction and Analysis of Systems","author":"P. Abdulla","year":"1998","unstructured":"P. Abdulla and B. Jonsson. Verifying networks of timed automata. In TACAS 98: Tools and Algorithms for Construction and Analysis of Systems, Lecture Notes in Computer Science 1384, pages 298\u2013312. Springer-Verlag, 1998."},{"key":"2_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BFb0023733","volume-title":"CAV 90: Computer-aided Verification","author":"A. Bouajjani","year":"1990","unstructured":"A. Bouajjani, J.-C. Fernandez, and N. Halbwachs. Minimal model generation. In CAV 90: Computer-aided Verification, Lecture Notes in Computer Science 531, pages 197\u2013203. Springer-Verlag, 1990."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(94)90269-0","volume":"126","author":"M. Dam","year":"1994","unstructured":"M. Dam. CTL* and ECTL* as fragments of the modal \u03bc-calculus. Theoretical Computer Science, 126:77\u201396, 1994.","journal-title":"Theoretical Computer Science"},{"key":"2_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"CAV 93: Computer-aided Verification","author":"E.A. Emerson","year":"1993","unstructured":"E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model checking for fragments of \u03bc-calculus. In CAV 93: Computer-aided Verification, Lecture Notes in Computer Science 697, pages 385\u2013396. Springer-Verlag, 1993."},{"key":"2_CR10","unstructured":"A. Finkel and Ph. Schnoebelen. Well-structured Transition Systems Everywhere. Technical Report LSV-98-4, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, 1998."},{"key":"2_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-60084-1_85","volume-title":"ICALP 95: Automata, Languages, and Programming","author":"T.A. Henzinger","year":"1995","unstructured":"T.A. Henzinger. Hybrid automata with finite bisimulations. In ICALP 95: Automata, Languages, and Programming, Lecture Notes in Computer Science 944, pages 324\u2013335. Springer-Verlag, 1995."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 278\u2013292. IEEE Computer Society Press, 1996.","DOI":"10.1109\/LICS.1996.561342"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"M.R. Henzinger, T.A. Henzinger, and P.W. Kopke. Computing simulations on finite and infinite graphs. In Proceedings of the 36rd Annual Symposium on Foundations of Computer Science, pages 453\u2013462. IEEE Computer Society Press, 1995.","DOI":"10.1109\/SFCS.1995.492576"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: the next generation. In Proceedings of the 16th Annual Real-time Systems Symposium, pages 56\u201365. IEEE Computer Society Press, 1995.","DOI":"10.1109\/REAL.1995.495196"},{"key":"2_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/3-540-61604-7_74","volume-title":"CONCUR 96: Concurrency Theory","author":"T.A. Henzinger","year":"1996","unstructured":"T.A. Henzinger and P.W. Kopke. State equivalences for rectangular hybrid automata. In CONCUR 96: Concurrency Theory, Lecture Notes in Computer Science 1119, pages 530\u2013545. Springer-Verlag, 1996."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jcss.1998.1581","volume":"57","author":"T.A. Henzinger","year":"1998","unstructured":"T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What\u2019s decidable about hybrid automata? Journal of Computer and System Sciences, 57:94\u2013124, 1998.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger and R. Majumdar. Symbolic model checking for rectangular hybrid systems. Submitted for publication, 1999.","DOI":"10.1007\/3-540-46419-0_11"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P.C. Kanellakis","year":"1990","unstructured":"P.C. Kanellakis and S.A. Smolka. CCS expressions, finite-state processes, and three problems of equivalence. Information and Computation, 86:43\u201368, 1990.","journal-title":"Information and Computation"},{"key":"2_CR19","volume-title":"Comparative Concurrency Semantics and Refinement of Actions","author":"R.J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Vrije Universiteit te Amsterdam, The Netherlands, 1990."}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T14:10:03Z","timestamp":1556719803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}