{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:18:15Z","timestamp":1725560295175},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283096"},{"type":"electronic","value":"9783540319344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539452_10","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:54:50Z","timestamp":1127814890000},"page":"81-94","source":"Crossref","is-referenced-by-count":3,"title":["Modal Logics for Timed Control"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Franck","family":"Cassez","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Laroussinie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0304-3975(02)00334-1","volume":"300","author":"L. Aceto","year":"2003","unstructured":"Aceto, L., Bouyer, P., Burgue\u00f1o, A., Larsen, K.G.: The power of reachability testing for timed automata. Theoretical Computer Science\u00a0300(1-3), 411\u2013475 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10_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.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternatingtime temporal logic. Journal of the ACM\u00a049, 672\u2013713 (2002)","journal-title":"Journal of the ACM"},{"key":"10_CR4","first-page":"52","volume":"53","author":"L. Aceto","year":"2002","unstructured":"Aceto, L., Laroussinie, F.: Is your model-checker on time? on the complexity of model-checking for timed modal logics. Journal of Logic and Algebraic Programming (JLAP)\u00a052-53, 7\u201351 (2002)","journal-title":"Journal of Logic and Algebraic Programming (JLAP)"},{"issue":"303","key":"10_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0304-3975(02)00442-5","volume":"1","author":"A. Arnold","year":"2003","unstructured":"Arnold, A., Vincent, A., Walukiewicz, I.: Games for synthesis of controllers with partial observation. Theoretical Computer Science\u00a01(303), 7\u201334 (2003)","journal-title":"Theoretical Computer Science"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Cassez, F., Laroussinie, F.: Modal logics for timed control. Research Report LSV-05-04, Laboratoire Sp\u00e9cification & V\u00e9rification, ENS de Cachan, France (2005)","DOI":"10.1007\/11539452_10"},{"issue":"3","key":"10_CR7","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":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-45873-5_13","volume-title":"Proc. 5th International Workshop on Hybrid Systems: Computation and Control (HSCC 2002)","author":"F. Cassez","year":"2002","unstructured":"Cassez, F., Henzinger, T.A., Raskin, J.-F.: A comparison of control problems for timed and hybrid systems. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol.\u00a02289, pp. 134\u2013148. Springer, Heidelberg (2002)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/3-540-44685-0_36","volume-title":"Proc. 12th International Conference on Concurrency Theory (CONCUR 2001","author":"L. de Alfaro","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A., Majumdar, R.: Symbolic algorithms for infinite-state games. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 536\u2013550. Springer, Heidelberg (2001)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-52148-8_17","volume-title":"Automatic Verification Methods for Finite State Systems","author":"D. Dill","year":"1990","unstructured":"Dill, D.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 197\u2013212. Springer, Heidelberg (1990)"},{"key":"10_CR11","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.: Timed control synthesis for external specifications. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 571\u2013582. Springer, Heidelberg (2002)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Allen Emerson, E.: Temporal and Modal Logic. (Formal Models and Semantics), Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 995\u20131072. MIT Press, Cambridge (1991)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/LICS.2002.1029826","volume-title":"Proc. 17th Annual Symposium on Logic in Computer Science (LICS 2002)","author":"M. Faella","year":"2002","unstructured":"Faella, M., La Torre, S., Murano, A.: Dense real-time games. In: Proc. 17th Annual Symposium on Logic in Computer Science (LICS 2002), pp. 167\u2013176. IEEE Computer Society Press, Los Alamitos (2002)"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T.A. Henzinger","year":"1994","unstructured":"Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model-checking for real-time systems. Information and Computation\u00a0111(2), 193\u2013244 (1994)","journal-title":"Information and Computation"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1007\/3-540-60246-1_160","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D. Janin","year":"1995","unstructured":"Janin, D., Walukiewicz, I.: Automata for the modal mu-calculus and related results. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 552\u2013562. Springer, Heidelberg (1995)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/3-540-60218-6_3","volume-title":"CONCUR \u201995 Concurrency Theory","author":"F. Laroussinie","year":"1995","unstructured":"Laroussinie, F., Larsen, K.G.: Compositional model-checking of real-time systems. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 27\u201341. Springer, Heidelberg (1995)"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-0-387-35394-4_27","volume-title":"Proc. IFIP Joint International Conference on Formal Description Techniques & Protocol Specification, Testing, and Verification (FORTE-PSTV 1998)","author":"F. Laroussinie","year":"1998","unstructured":"Laroussinie, F., Larsen, K.G.: CMC: A tool for compositional model-checking of real-time systems. In: Proc. IFIP Joint International Conference on Formal Description Techniques & Protocol Specification, Testing, and Verification (FORTE-PSTV 1998), pp. 439\u2013456. Kluwer Academic, Dordrecht (1998)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/3-540-60246-1_158","volume-title":"Mathematical Foundations of Computer Science 1995","author":"F. Laroussinie","year":"1995","unstructured":"Laroussinie, F., Larsen, K.G., Weise, C.: From timed automata to logic \u2013 and back. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 529\u2013539. Springer, Heidelberg (1995)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-59042-0_76","volume-title":"STACS 95","author":"O. Maler","year":"1995","unstructured":"Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 229\u2013242. Springer, Heidelberg (1995)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-540-45138-9_58","volume-title":"Mathematical Foundations of Computer Science 2003","author":"S. Riedweg","year":"2003","unstructured":"Riedweg, S., Pinchinat, S.: Quantified mu-calculus for control synthesis. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 642\u2013651. Springer, Heidelberg (2003)"},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"P.J.G. Ramadge","year":"1989","unstructured":"Ramadge, P.J.G., Wonham, W.M.: The control of discrete event systems. Proc. of the IEEE\u00a077(1), 81\u201398 (1989)","journal-title":"Proc. of the IEEE"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"4607","DOI":"10.1109\/CDC.1997.649708","volume-title":"Proc. 36th IEEE Conference on Decision and Control","author":"H. Wong-Toi","year":"1997","unstructured":"Wong-Toi, H.: The synthesis of controllers for linear hybrid automata. In: Proc. 36th IEEE Conference on Decision and Control, pp. 4607\u20134612. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","first-page":"502","volume-title":"CONCUR \u201990","author":"W. Yi","year":"1990","unstructured":"Yi, W.: Real-time behaviour of asynchronous agents. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 502\u2013520. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T18:42:26Z","timestamp":1586457746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11539452_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}