Crash-Resilient Decentralized Synchronous Runtime Verification

In this paper, we consider runtime verification of synchronous distributed systems, where a decentralized set of monitors that only have a partial view of the system are subject to crash failures. In this context, it is unavoidable that monitors may have different views of the underlying system, and, therefore, have different opinions about the correctness property. We propose an automata-based synchronous monitoring algorithm that copes with t crash monitor failures. Moreover, local monitors do not communicate their explicit reading of the underlying system. Rather, they emit a symbolic verdict that efficiently encodes their partial views. This significantly reduces the communication overhead.

[1]  Vijay K. Garg,et al.  On detecting global predicates in distributed computations , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[2]  Vijay K. Garg,et al.  Detecting Temporal Logic Predicates on Distributed Computations , 2007, DISC.

[3]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Christian Colombo,et al.  Organising LTL Monitors over Distributed Systems with a Global Clock , 2014, RV.

[6]  Vijay K. Garg,et al.  A Distributed Abstraction Algorithm for Online Predicate Detection , 2013, 2013 IEEE 32nd International Symposium on Reliable Distributed Systems.

[7]  Martin Leucker,et al.  Runtime Verification for LTL and TLTL , 2011, TSEM.

[8]  Koushik Sen,et al.  Efficient decentralized monitoring of safety in distributed systems , 2004, Proceedings. 26th International Conference on Software Engineering.

[9]  Yliès Falcone,et al.  Decentralised LTL monitoring , 2016, Formal Methods Syst. Des..

[10]  Pierre Fraigniaud,et al.  Locality and Checkability in Wait-Free Computing , 2011, DISC.

[11]  Fred B. Schneider,et al.  Verifying Programs That Use Causally-Ordered Message-Passing , 1995, Sci. Comput. Program..

[12]  Chen Yi-song,et al.  Precision �� , 2022 .

[13]  Pierre Fraigniaud,et al.  The Opinion Number of Set-Agreement , 2014, OPODIS.

[14]  Ezio Bartocci,et al.  First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014 , 2017, International Journal on Software Tools for Technology Transfer.

[15]  Martin Leucker,et al.  Comparing LTL Semantics for Runtime Verification , 2010, J. Log. Comput..

[16]  Grigore Rosu,et al.  Monitoring programs using rewriting , 2001, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001).

[17]  Pierre Fraigniaud,et al.  On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems , 2014, RV.

[18]  Pierre Fraigniaud,et al.  Decentralized Asynchronous Crash-Resilient Runtime Verification , 2016, CONCUR.

[19]  Murat Demirbas,et al.  Precision, Recall, and Sensitivity of Monitoring Partially Synchronous Distributed Systems , 2016, RV.

[20]  Vijay K. Garg,et al.  Techniques and applications of computation slicing , 2003, Distributed Computing.

[21]  Vijay K. Garg.  Elements of distributed computing , 2002 .

[22]  Zohar Manna,et al.  The Modal Logic of Programs , 1979, ICALP.

[23]  Mennatallah Hasabelnaby,et al.  Decentralized Runtime Verification of LTL Specifications in Distributed Systems , 2016 .

[24]  Eric Torng,et al.  Monitoring Partially Synchronous Distributed Systems Using SMT Solvers , 2017, RV.