Efficient LTL Decentralized Monitoring Framework Using Formula Simplification Table

This paper presents a new technique for optimizing formal analysis of propositional logic formulas and Linear Temporal Logic (LTL) formulas, namely the formula simplification table. A formula simplification table is a mathematical table that shows all possible simplifications of the formula under different truth assignments of its variables. The advantages of constructing a simplification table of a formula are two-fold. First, it can be used to compute the logical influence weight of each variable in the formula, which is a metric that shows the importance of the variable in affecting the outcome of the formula. Second, it can be used to identify variables that have the highest logical influences on the outcome of the formula. %The simplification table can be used to optimize %existing solutions for several interesting %LTL verification problems. We demonstrate the effectiveness of formula simplification table in the context of software verification by developing efficient framework to the well-known decentralized LTL monitoring problem.

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

[2]  Sanjit A. Seshia,et al.  Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic , 2009, CAV.

[3]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  Orna Kupferman,et al.  Vacuity Detection in Temporal Model Checking , 1999, CHARME.

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

[6]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[7]  Yliès Falcone,et al.  Efficient and Generalized Decentralized Monitoring of Regular Languages , 2014, FORTE.

[8]  George S. Avrunin,et al.  Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[9]  Christian Colombo,et al.  Organising LTL monitors over distributed systems with a global clock , 2016, Formal Methods Syst. Des..

[10]  Orna Grumberg,et al.  Enhanced Vacuity Detection in Linear Temporal Logic , 2003, CAV.

[11]  Omar I. Al-Bataineh Efficient Decentralized LTL Monitoring Framework Using Tableau Approach , 2018, ArXiv.

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

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

[14]  David L. Dill,et al.  A Decision Procedure for Bit-Vectors and Arrays , 2007, CAV.

[15]  Fahiem Bacchus,et al.  Planning for temporally extended goals , 1996, Annals of Mathematics and Artificial Intelligence.

[16]  Torben Scheffel,et al.  Three-valued asynchronous distributed runtime verification , 2014, 2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE).

[17]  Antoine El-Hokayem,et al.  Monitoring decentralized specifications , 2017, ISSTA.