{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:43:19Z","timestamp":1770295399633,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319251493","type":"print"},{"value":"9783319251509","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25150-9_3","type":"book-chapter","created":{"date-parts":[[2015,9,25]],"date-time":"2015-09-25T11:42:36Z","timestamp":1443181356000},"page":"39-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Note on Monitors and B\u00fcchi Automata"],"prefix":"10.1007","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-319-11662-4_10","volume-title":"Algorithmic Learning Theory","author":"D Angluin","year":"2014","unstructured":"Angluin, D., Fisman, D.: Learning regular omega languages. In: Auer, P., Clark, A., Zeugmann, T., Zilles, S. (eds.) ALT 2014. LNCS, vol. 8776, pp. 125\u2013139. Springer, Heidelberg (2014)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2699444","volume":"62","author":"D Basin","year":"2015","unstructured":"Basin, D., Klaedtke, F., M\u00fcller, S., Zalinescu, E.: Monitoring metric first-order temporal properties. J. ACM 62, 15:1\u201315:45 (2015)","journal-title":"J. ACM"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/11944836_25","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"A Bauer","year":"2006","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Monitoring of real-time properties. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 260\u2013272. Springer, Heidelberg (2006)"},{"key":"3_CR4","unstructured":"Diekert, V., Gastin, P.: First-order definable languages. In: Flum, J., Gr\u00e4del, E., Wilke, Th. (eds.) Logic and Automata: History and Perspectives, Texts in Logic and Games, pp. 261\u2013306. Amsterdam University Press (2008)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2014.02.052","volume":"537","author":"V Diekert","year":"2014","unstructured":"Diekert, V., Leucker, M.: Topology, monitorable properties and runtime verification. Theor. Comput. Sci. 537, 29\u201341 (2014). Special Issue of ICTAC 2012","journal-title":"Theor. Comput. Sci."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-32621-9_5","volume-title":"Logic, Language, Information and Computation","author":"V Diekert","year":"2012","unstructured":"Diekert, V., Muscholl, A.: On distributed monitoring of asynchronous systems. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol. 7456, pp. 70\u201384. Springer, Heidelberg (2012)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-93900-9_12","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"K Gondi","year":"2009","unstructured":"Gondi, K., Patel, Y., Sistla, A.P.: Monitoring the full range of $$\\omega $$ -regular properties of stochastic systems. In: Jones, N.D., M\u00fcller-Olm, M. (eds.) VMCAI 2009. LNCS, vol. 5403, pp. 105\u2013119. Springer, Heidelberg (2009)"},{"key":"3_CR8","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ulman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"3_CR9","unstructured":"Kamp, H.: Tense logic and the theory of linear order. Ph.D. thesis, University of California (1968)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D Knuth","year":"1977","unstructured":"Knuth, D., Morris, J.H., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6, 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"3_CR11","unstructured":"Kupferman, O., Vardi, G.: On relative and probabilistic finite counterabilty. In: Kreutzer, S. (ed.) Proceedings 24th EACSL Annual Conference on Computer Science Logic (CSL 2015). LIPIcs, vol. 41, Dagstuhl, Germany, pp. 175\u2013192. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"LH Landweber","year":"1969","unstructured":"Landweber, L.H.: Decision problems for $$\\omega $$ -automata. Math. Syst. Theory 3(4), 376\u2013384 (1969)","journal-title":"Math. Syst. Theory"},{"issue":"5","key":"3_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.jlap.2008.08.004","volume":"78","author":"M Leucker","year":"2009","unstructured":"Leucker, M., Schallhart, C.: A brief account of runtime verification. J. Logic Algebraic Program. 78(5), 293\u2013303 (2009)","journal-title":"J. Logic Algebraic Program."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/inco.1995.1070","volume":"118","author":"O Maler","year":"1995","unstructured":"Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Inf. Comput. 118, 316\u2013326 (1995)","journal-title":"Inf. Comput."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1016\/j.ic.2008.03.020","volume":"206","author":"PV Martugin","year":"2008","unstructured":"Martugin, P.V.: A series of slowly synchronizing automata with a zero state over a small alphabet. Inf. Comput. 206, 1197\u20131203 (2008)","journal-title":"Inf. Comput."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF01117471","volume":"1","author":"Y Matiyasevich","year":"1973","unstructured":"Matiyasevich, Y.: Real-time recognition of the inclusion relation. J. Sov. Math. 1, 64\u201370 (1973). Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, vol. 20, pp. 104\u2013114 (1971)","journal-title":"J. Sov. Math."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Nitsche, U., Wolper, P.: Relative liveness and behavior abstraction (extended abstract). In: Burns, J.E., Attiya, H. (eds.) Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing (PODS 1997), Santa Barbara, California, USA, 21\u201324 August 1997, pp. 45\u201352. ACM (1997)","DOI":"10.1145\/259380.259419"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11813040_38","volume-title":"FM 2006: Formal Methods","author":"A Pnueli","year":"2006","unstructured":"Pnueli, A., Zaks, A.: PSL model checking and run-time verification via testers. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 573\u2013586. Springer, Heidelberg (2006)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0304-3975(96)00136-3","volume":"172","author":"I Rystsov","year":"1997","unstructured":"Rystsov, I.: Reset words for commutative and solvable automata. Theor. Comput. Sci. 172, 273\u2013279 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/978-3-642-22110-1_58","volume-title":"Computer Aided Verification","author":"AP Sistla","year":"2011","unstructured":"Sistla, A.P., \u017defran, M., Feng, Y.: Monitorability of stochastic dynamical systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 720\u2013736. Springer, Heidelberg (2011)"},{"issue":"6","key":"3_CR21","first-page":"307","volume":"12","author":"L Staiger","year":"1976","unstructured":"Staiger, L.: Regul\u00e4re Nullmengen. Elektronische Informationsverarbeitung und Kybernetik 12(6), 307\u2013311 (1976)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","volume":"27","author":"L Staiger","year":"1983","unstructured":"Staiger, L.: Finite-state $$\\omega $$ -languages. J. Comput. Syst. Sci. 27, 434\u2013448 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR23","first-page":"379","volume":"10","author":"L Staiger","year":"1974","unstructured":"Staiger, L., Wagner, K.W.: Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regul\u00e4rer Folgenmengen. Elektronische Informationsverarbeitung und Kybernetik 10, 379\u2013392 (1974)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/s10703-011-0139-8","volume":"41","author":"D Tabakov","year":"2012","unstructured":"Tabakov, D., Rozier, K.Y., Vardi, M.Y.: Optimized temporal monitors for SystemC. Formal Methods Syst. Des. 41, 236\u2013268 (2012)","journal-title":"Formal Methods Syst. Des."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, chap. 4, pp. 133\u2013191. Elsevier Science Publishers B.V., Amsterdam (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"MV Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the Cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11\u201327. Springer, Heidelberg (2008)"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"KW Wagner","year":"1979","unstructured":"Wagner, K.W.: On omega-regular sets. Inf. Control 43, 123\u2013177 (1979)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25150-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T07:47:30Z","timestamp":1653205650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25150-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319251493","9783319251509"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25150-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}