{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T16:10:08Z","timestamp":1746375008841,"version":"3.40.4"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319108810"},{"type":"electronic","value":"9783319108827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10882-7_4","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T06:54:19Z","timestamp":1410418459000},"page":"43-60","source":"Crossref","is-referenced-by-count":2,"title":["On Clock-Aware LTL Properties of Timed\u00a0Automata"],"prefix":"10.1007","author":[{"given":"Peter","family":"Bezd\u011bk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikola","family":"Bene\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vojt\u011bch","family":"Havel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Barnat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"\u010cern\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999)"},{"issue":"2","key":"4_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. Theor. Comput. Sci.\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0054180","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C. Daws","year":"1998","unstructured":"Daws, C., Tripakis, S.: Model Checking of Real-Time Reachability Properties Using Abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 313\u2013329. Springer, Heidelberg (1998)"},{"key":"4_CR4","unstructured":"Behrmann, G., David, A., Larsen, K.G., M\u00fcller, O., Pettersson, P., Yi, W.: Uppaal - present and future. In: Proc. of 40th IEEE Conference on Decision and Control. IEEE Computer Society Press (2001)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Tripakis, S.: Checking timed B\u00fcchi Automata Emptiness on Simulation Graphs. TOCL\u00a010(3) (2009)","DOI":"10.1145\/1507244.1507245"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-04368-0_18","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"G. Li","year":"2009","unstructured":"Li, G.: Checking Timed B\u00fcchi Automata Emptiness Using LU-Abstractions. In: Ouaknine, J., Vaandrager, F.W. (eds.) FORMATS 2009. LNCS, vol.\u00a05813, pp. 228\u2013242. Springer, Heidelberg (2009)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/978-3-642-39799-8_69","volume-title":"Computer Aided Verification","author":"A. Laarman","year":"2013","unstructured":"Laarman, A., Olesen, M.C., Dalsgaard, A.E., Larsen, K.G., van de Pol, J.: Multi-core Emptiness Checking of Timed B\u00fcchi Automata Using Inclusion Abstraction. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 968\u2013983. Springer, Heidelberg (2013)"},{"key":"4_CR8","unstructured":"Vardi, M., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings, Symposium on Logic in Computer Science (LICS 1986), pp. 332\u2013344. IEEE Computer Society (1986)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Bezd\u011bk, P., Bene\u0161, N., Havel, V., Barnat, J., \u010cern\u00e1, I.: On clock-aware ltl properties of timed automata. Technical report FIMU-RS-2014-04, Faculty of Informatics, Masaryk University, Brno (2014)","DOI":"10.1007\/978-3-319-10882-7_4"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R. Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.A.: A really temporal logic. Journal of the ACM (JACM)\u00a041(1), 181\u2013203 (1994)","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R. Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with metric temporal logic. Real-time Systems\u00a02(4), 255\u2013299 (1990)","journal-title":"Real-time Systems"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM\u00a043(1), 116\u2013146 (1996)","journal-title":"J. ACM"},{"key":"4_CR13","unstructured":"Ostroff, J.S.: Temporal logic for real-time systems, vol.\u00a040. Cambridge Univ. Press (1989)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Harel, E., Lichtenstein, O., Pnueli, A.: Explicit clock temporal logic. In: Proceedings of the Fifth Annual IEEE Symposium on e Logic in Computer Science, LICS 1990, pp. 402\u2013413. IEEE (1990)","DOI":"10.1109\/LICS.1990.113765"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Demri, S., D\u2018Souza, D.: An automata-theoretic approach to constraint LTL. Information and Computation\u00a0205(3), 380\u2013415 (2007)","DOI":"10.1016\/j.ic.2006.09.006"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-36103-0_26","volume-title":"Formal Methods and Software Engineering","author":"G. Li","year":"2002","unstructured":"Li, G., Tang, Z.: Modelling real-time systems with continuous-time temporal logic. In: George, C.W., Miao, H. (eds.) ICFEM 2002. LNCS, vol.\u00a02495, pp. 231\u2013236. Springer, Heidelberg (2002)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 1\u201324. Springer, Heidelberg (2004)"},{"key":"4_CR18","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. Representation and Mind Series. The MIT Press (2008)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Alur, R., Courcoubetis, C., Dill, D.: Model-checking for real-time systems. In: Proceedings of the Fifth Annual IEEE Symposium on e Logic in Computer Science, LICS 1990, pp. 414\u2013425. IEEE (1990)","DOI":"10.1109\/LICS.1990.113766"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1507244.1507245","volume":"10","author":"S. Tripakis","year":"2009","unstructured":"Tripakis, S.: Checking timed B\u00fcchi automata emptiness on simulation graphs. ACM Transactions on Computational Logic (TOCL)\u00a010(3), 15 (2009)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Automatic Verification Methods for Finite State Systems, pp. 197\u2013212. Springer (1990)","DOI":"10.1007\/3-540-52148-8_17"},{"key":"4_CR22","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.E. Bengtsson","year":"2004","unstructured":"Bengtsson, J.E., Yi, W.: Timed automata: Semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.\u00a03098, pp. 87\u2013124. Springer, Heidelberg (2004)"},{"key":"4_CR23","unstructured":"Pettersson, P.: Modelling and verification of real-time systems using timed automata: theory and practice, Citeseer (1999)"},{"issue":"3","key":"4_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/B:FORM.0000026093.21513.31","volume":"24","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P.: Forward analysis of updatable timed automata. Formal Methods in System Design\u00a024(3), 281\u2013320 (2004)","journal-title":"Formal Methods in System Design"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Efficient Emptiness Check for Timed B\u00fcchi Automata (Extended version). CoRR abs\/1104.1540 (2011)","DOI":"10.1007\/s10703-011-0133-1"},{"issue":"1","key":"4_CR26","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":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/978-3-642-39799-8_60","volume-title":"Computer Aided Verification","author":"J. Barnat","year":"2013","unstructured":"Barnat, J., Brim, L., Havel, V., Havl\u00ed\u010dek, J., Kriho, J., Len\u010do, M., Ro\u010dkai, P., \u0160till, V., Weiser, J.: DiVinE 3.0 \u2013 An Explicit-State Model Checker for Multithreaded C & C++ Programs. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 863\u2013868. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10882-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T15:44:34Z","timestamp":1746373474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10882-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108810","9783319108827"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10882-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}