{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:35:25Z","timestamp":1742402125502},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616481"},{"type":"electronic","value":"9783540706533"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61648-9_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:10:16Z","timestamp":1330294216000},"page":"130-147","source":"Crossref","is-referenced-by-count":18,"title":["Minimizable timed automata"],"prefix":"10.1007","author":[{"given":"Jan","family":"Springintveld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"8_CR1","series-title":"volume 630 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BFb0084802","volume-title":"Proceedings CONCUR 92","author":"R. Alur","year":"1992","unstructured":"R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi. Minimization of timed transition systems. In W.R. Cleaveland, editor, Proceedings CONCUR 92, Stony Brook, NY, USA, volume 630 of Lecture Notes in Computer Science, pages 340\u2013354. Springer-Verlag, 1992."},{"key":"8_CR2","series-title":"volume 836 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-3-540-48654-1_16","volume-title":"Proceedings CONCUR 94","author":"R. Alur","year":"1994","unstructured":"R. Alur, C. Courcoubetis, and T.A. Henzinger. The observational power of clocks. In B. Jonsson and J. Parrow, editors, Proceedings CONCUR 94, Uppsala, Sweden, volume 836 of Lecture Notes in Computer Science, pages 162\u2013177. Springer-Verlag, 1994."},{"key":"8_CR3","doi-asserted-by":"crossref","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":"8_CR4","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, P.W. Kopke, and H. Wong-Toi. The expressive power of clocks. In Proceedings 22nd ICALP, volume 944 of Lecture Notes in Computer Science, pages 417\u2013428. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60084-1_93"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T.A. Henzinger","year":"1994","unstructured":"T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111:193\u2013244, 1994.","journal-title":"Information and Computation"},{"key":"8_CR6","unstructured":"Z. Kohavi. Switching and Finite Automata Theory. McGraw-Hill, Inc., 1970."},{"key":"8_CR7","volume-title":"volume 969 of Lecture Notes in Computer Science","author":"K.G. Larsen","year":"1995","unstructured":"K.G. Larsen, F. Laroussinie, and C. Weise. From timed automata to logic \u2014 and back. In Proceedings 20th International Symposium on Mathematical Foundations of Computer Science (MFCS'95), Prague, Czech Republic, volume 969 of Lecture Notes in Computer Science. Springer-Verlag, 1995."},{"key":"8_CR8","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989."},{"key":"8_CR9","volume-title":"Dr.sc.comp. thesis","author":"K. Cer\u0101ns","year":"1992","unstructured":"K. Cer\u0101ns. Algorithmic Problems in Analysis of Real Time System Specifications. Dr.sc.comp. thesis, University of Latvia, R\u012bga, 1992."},{"key":"8_CR10","first-page":"302","volume-title":"volume 663 of Lecture Notes in Computer Science","author":"K. Cer\u0101ns","year":"1992","unstructured":"K. Cer\u0101ns. Decidability of bisimulation equivalences for parallel timer processes. In G. v. Bochmann and D.K. Probst, editors, Proceedings of the 4th International Workshop on Computer Aided Verification, Montreal, Canada, volume 663 of Lecture Notes in Computer Science, pages 302\u2013315. Springer-Verlag, 1992."},{"key":"8_CR11","first-page":"210","volume-title":"volume 697 of Lecture Notes in Computer Science","author":"M. Yannakalds","year":"1993","unstructured":"M. Yannakalds and D. Lee. An efficient algorithm for minimizing real-time transition systems. In C. Courcoubetis, editor, Proceedings of the 5th International Conference on Computer Aided Verification, Elounda, Greece, volume 697 of Lecture Notes in Computer Science, pages 210\u2013224. Springer-Verlag, 1993."}],"container-title":["Lecture Notes in Computer Science","Formal Techniques in Real-Time and Fault-Tolerant Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61648-9_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:35:20Z","timestamp":1619573720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61648-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616481","9783540706533"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61648-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}