{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:05:15Z","timestamp":1725573915889},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540216711"},{"type":"electronic","value":"9783540409038"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-40903-8_15","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T15:37:38Z","timestamp":1294414658000},"page":"182-188","source":"Crossref","is-referenced-by-count":13,"title":["Folk Theorems on the Determinization and Minimization of Timed Automata"],"prefix":"10.1007","author":[{"given":"Stavros","family":"Tripakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/BFb0084802","volume-title":"CONCUR \u201992","author":"R. Alur","year":"1992","unstructured":"Alur, R., Courcoubetis, C., Halbwachs, N., Dill, D.L., Wong-Toi, H.: Minimization of timed transition systems. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 340\u2013354. Springer, Heidelberg (1992)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1994","unstructured":"Alur, R., Fix, L., Henzinger, T.: A determinizable class of timed automata. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, Springer, Heidelberg (1994)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-45069-6_18","volume-title":"Computer Aided Verification","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P., D\u2019Souza, D., Madhusudan, P., Petit, A.: Timed control with partial observability. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 180\u2013192. Springer, Heidelberg (2003)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_35","volume-title":"Computer Aided Verification","author":"P. Bouyer","year":"2000","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Are timed automata updatable? In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, Springer, Heidelberg (2000)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-44612-5_19","volume-title":"Mathematical Foundations of Computer Science 2000","author":"P. Bouyer","year":"2000","unstructured":"Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Expressiveness of updatable timed automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, p. 232. Springer, Heidelberg (2000)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Computer Aided Verification","author":"C. Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, Springer, Heidelberg (1992)"},{"key":"15_CR8","unstructured":"Daws, C., Yovine, S.: Reducing the number of clock variables of timed automata. In: Proc. 17th IEEE Real-Time Systems Symposium, RTSS 1996 (1996)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/3-540-45841-7_47","volume-title":"STACS 2002","author":"D. D\u2019Souza","year":"2002","unstructured":"D\u2019Souza, D., Madhusudan, P.: Controller synthesis for timed specifications. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, p. 571. Springer, Heidelberg (2002)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-45319-9_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Nielsen","year":"2001","unstructured":"Nielsen, B., Skou, A.: Automated test generation from timed automata. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, p. 343. Springer, Heidelberg (2001)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Springintveld, J., Vaandrager, F., D\u2019Argenio, P.: Testing timed automata. Theoretical Computer Science 254 (2001)","DOI":"10.1016\/S0304-3975(99)00134-6"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-61648-9_38","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"J.G. Springintveld","year":"1996","unstructured":"Springintveld, J.G., Vaandrager, F.W.: Minimizable timed automata. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol.\u00a01135, pp. 130\u2013147. Springer, Heidelberg (1996)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-45739-9_14","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"S. Tripakis","year":"2002","unstructured":"Tripakis, S.: Fault diagnosis for timed automata. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol.\u00a02469, p. 205. Springer, Heidelberg (2002)"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1008734703554","volume":"18","author":"S. Tripakis","year":"2001","unstructured":"Tripakis, S., Yovine, S.: Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design\u00a018(1), 25\u201368 (2001)","journal-title":"Formal Methods in System Design"},{"key":"15_CR15","unstructured":"Wilke, T.: Automaten und Logiken zur Beschreibung zeitabh\u00e4ngiger Systeme. PhD thesis, Institut F\u00fcr Informatik und Praktische Mathematik, Christian- Albrechts Universit\u00e4t, Kiel (1994) ( in German)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Yannakakis, M., Lee, D.: An efficient algorithm for minimizing real-time transition systems. Formal Methods in System Design 11(2) (1997)","DOI":"10.1023\/A:1008621829508"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40903-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:29:43Z","timestamp":1558308583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40903-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540216711","9783540409038"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40903-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}