{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:08:35Z","timestamp":1725516515120},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642326202"},{"type":"electronic","value":"9783642326219"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32621-9_5","type":"book-chapter","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T10:40:40Z","timestamp":1345286440000},"page":"70-84","source":"Crossref","is-referenced-by-count":6,"title":["On Distributed Monitoring of Asynchronous Systems"],"prefix":"10.1007","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","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.\u00a04337, pp. 260\u2013272. Springer, Heidelberg (2006)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. ACM Trans. Softw. Eng. Methodol.\u00a020(4) (2011)","DOI":"10.1145\/2000799.2000800"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: On the expressiveness and complexity of randomization in finite state monitors. J. ACM\u00a056(5) (2009)","DOI":"10.1145\/1552285.1552287"},{"key":"5_CR4","unstructured":"Diekert, V., Gastin, P.: Local safety and local liveness for distributed systems. In: Perspectives in Concurrency Theory, pp. 86\u2013106. IARCS-Universities (2009)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01178512","volume":"31","author":"V. Diekert","year":"1994","unstructured":"Diekert, V., Muscholl, A.: Deterministic asynchronous automata for infinite traces. Acta Informatica\u00a031, 379\u2013397 (1994)","journal-title":"Acta Informatica"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific (1995)","DOI":"10.1142\/9789814261456"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(95)00130-1","volume":"154","author":"W. Ebinger","year":"1996","unstructured":"Ebinger, W., Muscholl, A.: Logical definability on infinite traces. Theoretical Computer Science\u00a0154(3), 67\u201384 (1996)","journal-title":"Theoretical Computer Science"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Gastin, P., Petit, A.: Infinite traces. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces. World Scientific (1995)","DOI":"10.1142\/9789814261456_0011"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-14162-1_5","volume-title":"Automata, Languages and Programming","author":"B. Genest","year":"2010","unstructured":"Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol.\u00a06199, pp. 52\u201363. Springer, Heidelberg (2010)"},{"key":"5_CR10","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., Prasad Sistla, A.: Monitoring the Full Range of \u03c9-Regular Properties of Stochastic Systems. In: Jones, N.D., M\u00fcller-Olm, M. (eds.) VMCAI 2009. LNCS, vol.\u00a05403, pp. 105\u2013119. Springer, Heidelberg (2009)"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321765.321782","volume":"20","author":"R.M. Keller","year":"1973","unstructured":"Keller, R.M.: Parallel program schemata and maximal parallelism\u00a0I. Fundamental results. Journal of the Association of Computing Machinery\u00a020(3), 514\u2013537 (1973)","journal-title":"Journal of the Association of Computing Machinery"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB\u00a078. Aarhus University, Aarhus (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information & Control\u00a09, 521\u2013530 (1966)","journal-title":"Information & Control"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Symposium on Foundations of Computer Science, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"5_CR15","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., Karakostas, G. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 573\u2013586. Springer, Heidelberg (2006)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-45187-7_2","volume-title":"CONCUR 2003 - Concurrency Theory","author":"A. \u015etef\u0103nescu","year":"2003","unstructured":"\u015etef\u0103nescu, A., Esparza, J., Muscholl, A.: Synthesis of Distributed Algorithms Using Asynchronous Automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 27\u201341. Springer, Heidelberg (2003)"},{"key":"5_CR17","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications\u00a021, 99\u2013135 (1987)","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32621-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T03:27:05Z","timestamp":1557199625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32621-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326202","9783642326219"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32621-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}