{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T01:42:10Z","timestamp":1790905330824,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642229923","type":"print"},{"value":"9783642229930","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_50","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T08:44:46Z","timestamp":1312879486000},"page":"556-567","source":"Crossref","is-referenced-by-count":4,"title":["Untimed Language Preservation in Timed Systems"],"prefix":"10.1007","author":[{"given":"Ocan","family":"Sankur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"50_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11603009_21","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"K. Altisen","year":"2005","unstructured":"Altisen, K., Tripakis, S.: Implementation of timed automata: An issue of semantics or modeling? In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 273\u2013288. Springer, Heidelberg (2005)"},{"issue":"2","key":"50_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(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-31954-2_5","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2005","unstructured":"Alur, R., La Torre, S., Madhusudan, P.: Perturbed timed automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol.\u00a03414, pp. 70\u201385. Springer, Heidelberg (2005)"},{"key":"50_CR4","first-page":"469","volume-title":"Proc. Symposium on System Structure and Control","author":"E. Asarin","year":"1998","unstructured":"Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: Proc. Symposium on System Structure and Control, pp. 469\u2013474. Elsevier, Amsterdam (1998)"},{"key":"50_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-77050-3_15","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"C. Baier","year":"2007","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T., Gr\u00f6\u00dfer, M.: Probabilistic and topological semantics for timed automata. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 179\u2013191. Springer, Heidelberg (2007)"},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02579454","volume":"1","author":"J. Bermond","year":"1981","unstructured":"Bermond, J., Germa, A., Heydemann, M., Sotteau, D.: Longest paths in digraphs. Combinatorica\u00a01, 337\u2013341 (1981)","journal-title":"Combinatorica"},{"issue":"4","key":"50_CR7","first-page":"393","volume":"10","author":"P. Bouyer","year":"2005","unstructured":"Bouyer, P., Chevalier, F.: On conciseness of extensions of timed automata. Journal of Automata, Languages and Combinatorics\u00a010(4), 393\u2013405 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11682462_25","volume-title":"LATIN 2006: Theoretical Informatics","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Markey, N., Reynier, P.-A.: Robust model-checking of linear-time properties in timed automata. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-78499-9_12","volume-title":"Foundations of Software Science and Computational Structures","author":"P. Bouyer","year":"2008","unstructured":"Bouyer, P., Markey, N., Reynier, P.-A.: Robust analysis of timed automata via channel machines. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 157\u2013171. Springer, Heidelberg (2008)"},{"key":"50_CR10","unstructured":"Brenguier, R., Sankur, O.: Hardness of untimed language universality (submitted, 2011)"},{"issue":"1-3","key":"50_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10703-008-0056-7","volume":"33","author":"M. Wulf De","year":"2008","unstructured":"De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robust safety of timed automata. Formal Methods in System Design\u00a033(1-3), 45\u201384 (2008)","journal-title":"Formal Methods in System Design"},{"issue":"3","key":"50_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00165-005-0067-8","volume":"17","author":"M. Wulf De","year":"2005","unstructured":"De Wulf, M., Doyen, L., Raskin, J.-F.: Almost ASAP semantics: From timed models to timed implementations. Formal Aspects of Computing\u00a017(3), 319\u2013341 (2005)","journal-title":"Formal Aspects of Computing"},{"key":"50_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-75454-1_11","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"C. Dima","year":"2007","unstructured":"Dima, C.: Dynamical properties of timed automata revisited. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol.\u00a04763, pp. 130\u2013146. Springer, Heidelberg (2007)"},{"key":"50_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BFb0014736","volume-title":"Hybrid and Real-Time Systems","author":"V. Gupta","year":"1997","unstructured":"Gupta, V., Henzinger, T.A., Jagadeesan, R.: Robust timed automata. In: Maler, O. (ed.) HART 1997. LNCS, vol.\u00a01201, pp. 331\u2013345. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"50_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1008387132377","volume":"10","author":"A. Puri","year":"2000","unstructured":"Puri, A.: Dynamical properties of timed systems. Discrete Event Dynamic Systems\u00a010(1-2), 87\u2013113 (2000)","journal-title":"Discrete Event Dynamic Systems"},{"key":"50_CR16","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1930","unstructured":"Ramsey, F.P.: On a problem in formal logic. Proc. London Math. Soc (3)\u00a030, 264\u2013286 (1930)","journal-title":"Proc. London Math. Soc. (3)"},{"key":"50_CR17","unstructured":"Sankur, O.: Model-checking robuste des automates temporis\u00e9s via les machines \u00e0 canaux. Master\u2019s thesis, Ecole Normale Sup\u00e9rieure (2010)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:12:43Z","timestamp":1558296763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}