{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:49:05Z","timestamp":1743133745179,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_23","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T15:05:04Z","timestamp":1246547104000},"page":"273-284","source":"Crossref","is-referenced-by-count":3,"title":["Weak Alternating Timed Automata"],"prefix":"10.1007","author":[{"given":"Pawel","family":"Parys","sequence":"first","affiliation":[]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/BFb0054179","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P. Abdulla","year":"1998","unstructured":"Abdulla, P., Jonsson, B.: Veryfying networks of timed processes. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 298\u2013312. Springer, Heidelberg (1998)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45740-2_5","volume-title":"Applications and Theory of Petri Nets 2001","author":"P. Abdulla","year":"2001","unstructured":"Abdulla, P., Jonsson, B.: Timed Petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol.\u00a02075, pp. 53\u201370. Springer, Heidelberg (2001)"},{"issue":"4","key":"23_CR3","first-page":"419","volume":"89","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality analysis for one-clock timed automata. Fundam. Inform.\u00a089(4), 419\u2013450 (2008)","journal-title":"Fundam. Inform."},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-75698-9_7","volume-title":"International Symposium on Fundamentals of Software Engineering","author":"P.A. Abdulla","year":"2007","unstructured":"Abdulla, P.A., Ouaknine, J., Quaas, K., Worrell, J.: Zone-based universality analysis for single-clock timed automata. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol.\u00a04767, pp. 98\u2013112. Springer, Heidelberg (2007)"},{"key":"23_CR5","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.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"23_CR6","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":"23_CR7","unstructured":"Alur, R., Fix, L., Henzinger, T.: Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science\u00a0204 (1997)"},{"issue":"1","key":"23_CR8","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. J. ACM\u00a041(1), 181\u2013204 (1994)","journal-title":"J. ACM"},{"key":"23_CR9","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Workshop on Methods for Modalities (M4M-5)","author":"P. Bouyer","year":"2009","unstructured":"Bouyer, P.: Model-checking timed temporal logics. In: Workshop on Methods for Modalities (M4M-5), Cachan, France. Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, Amsterdam (2009)"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/11590156_35","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"P. Bouyer","year":"2005","unstructured":"Bouyer, P., Chevalier, F., Markey, N.: On the expressiveness of TPTL and MTL. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 432\u2013443. Springer, Heidelberg (2005)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: LICS, pp. 109\u2013120 (2007)","DOI":"10.1109\/LICS.2007.49"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-70583-3_11","volume-title":"Automata, Languages and Programming","author":"P. Bouyer","year":"2008","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: On expressiveness and complexity in real-time model checking. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 124\u2013135. Springer, Heidelberg (2008)"},{"issue":"1","key":"23_CR13","first-page":"1","volume":"62","author":"Y. Hirshfeld","year":"2004","unstructured":"Hirshfeld, Y., Rabinovich, A.M.: Logics for real time: Decidability and complexity. Fundam. Inform.\u00a062(1), 1\u201328 (2004)","journal-title":"Fundam. Inform."},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-62034-6_46","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"D.V. Hung","year":"1996","unstructured":"Hung, D.V., Ji, W.: On the design of hybrid control systems using automata models. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 156\u2013167. Springer, Heidelberg (1996)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-31982-5_16","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Lasota","year":"2005","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 250\u2013265. Springer, Heidelberg (2005)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Comput. Log.\u00a09(2) (2008)","DOI":"10.1145\/1342991.1342994"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0304-3975(91)90283-8","volume":"83","author":"A.W. Mostowski","year":"1991","unstructured":"Mostowski, A.W.: Hierarchies of weak automata and week monadic formulas. Theoretical Computer Science\u00a083, 323\u2013335 (1991)","journal-title":"Theoretical Computer Science"},{"key":"23_CR18","unstructured":"Murlak, F.: Weak index versus borel rank. In: STACS, Dagstuhl Seminar Proceedings, pp. 573\u2013584. Dagsr (2008)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proc. LICS 2004, pp. 54\u201363 (2004)","DOI":"10.1109\/LICS.2004.1319600"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic. In: LICS, pp. 188\u2013197 (2005)","DOI":"10.1109\/LICS.2005.33"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11690634_15","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.: On metric temporal logic and faulty Turing machines. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 217\u2013230. Springer, Heidelberg (2006)"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/11691372_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.: Safety metric temporal logic is fully decidable. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 411\u2013425. Springer, Heidelberg (2006)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science\u00a03(1) (2007)","DOI":"10.2168\/LMCS-3(1:8)2007"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85778-5_1","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"J. Ouaknine","year":"2008","unstructured":"Ouaknine, J., Worrell, J.: Some recent results in metric temporal logic. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol.\u00a05215, pp. 1\u201313. Springer, Heidelberg (2008)"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Parys, P., Walukiewicz, I.: Weak alternating timed automata. HAL (2009), http:\/\/hal.archives-ouvertes.fr\/hal-00360122\/fr\/","DOI":"10.1007\/978-3-642-02930-1_23"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y., Wolper, P.: Automata theoretic techniques for modal logics of programs. In: Sixteenth ACM Symposium on the Theoretical Computer Science (1984)","DOI":"10.1145\/800057.808711"},{"key":"23_CR27","first-page":"473","volume":"13","author":"K. Wagner","year":"1977","unstructured":"Wagner, K.: Eine topologische Charakterisierung einiger Klassen regul\u00e4rer Folgenmengen. J. Inf. Process. Cybern. EIK\u00a013, 473\u2013487 (1977)","journal-title":"J. Inf. Process. Cybern. EIK"},{"key":"23_CR28","first-page":"379","volume":"10","author":"K. Wagner","year":"1974","unstructured":"Wagner, K., Staiger, L.: Automatentheoretische und automatenfreie charakterisierungen topologischer klassen regularer folgenmengen. EIK\u00a010, 379\u2013392 (1974)","journal-title":"EIK"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Wilke, T.: Classifying discrete temporal properties. Habilitation thesis, Kiel, Germany (1998)","DOI":"10.1007\/3-540-49116-3_3"}],"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-02930-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T16:44:41Z","timestamp":1739205881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}