Introduction
Distributed systems are notoriously difficult to understand and analyze in order to assert their correction w.r.t. given properties. They often exhibit a huge number of different behaviors, as soon as the active entities (peers, agents, processes, . . . ) behave in an asynchronous manner. Already the modelization of such systems is a non-trivial task, let alone their formal verification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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–272. Springer, Heidelberg (2006)
Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. ACM Trans. Softw. Eng. Methodol. 20(4) (2011)
Chadha, R., Sistla, A.P., Viswanathan, M.: On the expressiveness and complexity of randomization in finite state monitors. J. ACM 56(5) (2009)
Diekert, V., Gastin, P.: Local safety and local liveness for distributed systems. In: Perspectives in Concurrency Theory, pp. 86–106. IARCS-Universities (2009)
Diekert, V., Muscholl, A.: Deterministic asynchronous automata for infinite traces. Acta Informatica 31, 379–397 (1994)
Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific (1995)
Ebinger, W., Muscholl, A.: Logical definability on infinite traces. Theoretical Computer Science 154(3), 67–84 (1996)
Gastin, P., Petit, A.: Infinite traces. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces. World Scientific (1995)
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. 6199, pp. 52–63. Springer, Heidelberg (2010)
Gondi, K., Patel, Y., Prasad Sistla, A.: Monitoring the Full Range of ω-Regular Properties of Stochastic Systems. In: Jones, N.D., Müller-Olm, M. (eds.) VMCAI 2009. LNCS, vol. 5403, pp. 105–119. Springer, Heidelberg (2009)
Keller, R.M.: Parallel program schemata and maximal parallelism I. Fundamental results. Journal of the Association of Computing Machinery 20(3), 514–537 (1973)
Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 78. Aarhus University, Aarhus (1977)
McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information & Control 9, 521–530 (1966)
Pnueli, A.: The temporal logic of programs. In: 18th Symposium on Foundations of Computer Science, pp. 46–57 (1977)
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. 4085, pp. 573–586. Springer, Heidelberg (2006)
Ştefănescu, A., Esparza, J., Muscholl, A.: Synthesis of Distributed Algorithms Using Asynchronous Automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 27–41. Springer, Heidelberg (2003)
Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications 21, 99–135 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diekert, V., Muscholl, A. (2012). On Distributed Monitoring of Asynchronous Systems. In: Ong, L., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2012. Lecture Notes in Computer Science, vol 7456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32621-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-32621-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32620-2
Online ISBN: 978-3-642-32621-9
eBook Packages: Computer ScienceComputer Science (R0)