{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:30Z","timestamp":1725897630944},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315848"},{"type":"electronic","value":"9783642315855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_15","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T11:56:29Z","timestamp":1340452589000},"page":"128-140","source":"Crossref","is-referenced-by-count":9,"title":["Robust Reachability in Timed Automata: A\u00a0Game-Based\u00a0Approach"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[]},{"given":"Ocan","family":"Sankur","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.tcs.2005.11.018","volume":"354","author":"Y. Adbedda\u00efm","year":"2006","unstructured":"Adbedda\u00efm, Y., Asarin, E., Maler, O.: Scheduling with timed automata. TCS\u00a0354(2), 272\u2013300 (2006)","journal-title":"TCS"},{"issue":"2","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. TCS\u00a0126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"unstructured":"Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: SSSC 1998, pp. 469\u2013474. Elsevier (1998)","key":"15_CR3"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-27755-2_3","volume-title":"Lectures on Concurrency and Petri Nets","author":"J. Bengtsson","year":"2004","unstructured":"Bengtsson, J., Yi, W.: Timed Automata: Semantics, Algorithms and Tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol.\u00a03098, pp. 87\u2013124. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Bouyer, P., Markey, N., Sankur, O.: Robust reachability in timed automata: A\u00a0game-based approach. Technical Report LSV-12-07, Lab. Specification & Verification, ENS Cachan, France (May 2012)","key":"15_CR5","DOI":"10.1007\/978-3-642-31585-5_15"},{"doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Prabhu, V.S.: Timed parity games: Complexity and robustness. LMCS 7(4) (2010)","key":"15_CR6","DOI":"10.2168\/LMCS-7(4:8)2011"},{"issue":"1-3","key":"15_CR7","first-page":"45","volume":"33","author":"M. Wulf De","year":"2008","unstructured":"De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robust safety of timed automata. FMSD\u00a033(1-3), 45\u201384 (2008)","journal-title":"FMSD"},{"issue":"3","key":"15_CR8","first-page":"319","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. FAC\u00a017(3), 319\u2013341 (2005)","journal-title":"FAC"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Applied Maths\u00a017(2), 416\u2013429 (1969)","journal-title":"SIAM J. Applied Maths"},{"key":"15_CR10","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)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11813040_1","volume-title":"FM 2006: Formal Methods","author":"T.A. Henzinger","year":"2006","unstructured":"Henzinger, T.A., Sifakis, J.: The Embedded Systems Design Challenge. In: Misra, J., Nipkow, T., Karakostas, G. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 1\u201315. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Kopetz, H.: Real-Time Systems: Design Principles for Distributed Embedded Applications. Springer (2011)","key":"15_CR12","DOI":"10.1007\/978-1-4419-8237-7_11"},{"issue":"1-2","key":"15_CR13","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K.G. Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a nutshell. Intl J. STTT\u00a01(1-2), 134\u2013152 (1997)","journal-title":"Intl J. STTT"},{"doi-asserted-by":"crossref","unstructured":"Markey, N.: Robustness in real-time systems. In: SIES 2011, pp. 28\u201334. IEEE Comp. Soc. Press (2011)","key":"15_CR14","DOI":"10.1109\/SIES.2011.5953652"},{"issue":"1-2","key":"15_CR15","first-page":"87","volume":"10","author":"A. Puri","year":"2000","unstructured":"Puri, A.: Dynamical properties of timed automata. DEDS\u00a010(1-2), 87\u2013113 (2000)","journal-title":"DEDS"},{"unstructured":"Reineke, J., Wachter, B., Thesing, S., Wilhelm, R., Polian, I., Eisinger, J., Becker, B.: A definition and classification of timing anomalies. In: WCET 2006 (2006)","key":"15_CR16"},{"unstructured":"Sankur, O., Bouyer, P., Markey, N.: Shrinking timed automata. In: FSTTCS 2011. LIPIcs, vol.\u00a013, pp. 375\u2013386. LZI (2011)","key":"15_CR17"},{"issue":"1-2","key":"15_CR18","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s100090050009","volume":"1","author":"S. Yovine","year":"1997","unstructured":"Yovine, S.: Kronos: A verification tool for real-time systems. Intl J. STTT\u00a01(1-2), 123\u2013133 (1997)","journal-title":"Intl J. STTT"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:13:26Z","timestamp":1620130406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}