### Abstract

This paper presents a new technique for optimizing formal analysis of Boolean formulas and Linear Temporal Logic (LTL) formulas, namely the formula simplification tables. A formula simplification table is a mathematical table that shows all possible simplifications of the formula under different truth assignments of its variables. The simplification table is constructed using a three-valued logic: besides true and false, the variable can take an unknown value. 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 quantitative score 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. We demonstrate the effectiveness of formula simplification table in the context of software verification by developing an efficient framework for the well-known decentralized monitoring problem.

Original language | English |
---|---|

Title of host publication | Model Checking Software - 26th International Symposium, SPIN 2019, Proceedings |

Editors | Fabrizio Biondi, Thomas Given-Wilson, Axel Legay |

Publisher | Springer |

Pages | 38-55 |

Number of pages | 18 |

ISBN (Print) | 9783030309220 |

DOIs | |

Publication status | Published - 1 Jan 2019 |

Event | 26th International Symposium on Model Checking Software, SPIN 2019 - Beijing, China Duration: 15 Jul 2019 → 16 Jul 2019 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 11636 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 26th International Symposium on Model Checking Software, SPIN 2019 |
---|---|

Country | China |

City | Beijing |

Period | 15/07/19 → 16/07/19 |

### Fingerprint

### Cite this

*Model Checking Software - 26th International Symposium, SPIN 2019, Proceedings*(pp. 38-55). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11636 LNCS). Springer. https://doi.org/10.1007/978-3-030-30923-7_3

}

*Model Checking Software - 26th International Symposium, SPIN 2019, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11636 LNCS, Springer, pp. 38-55, 26th International Symposium on Model Checking Software, SPIN 2019, Beijing, China, 15/07/19. https://doi.org/10.1007/978-3-030-30923-7_3

**A Novel Decentralized LTL Monitoring Framework Using Formula Progression Table.** / Bataineh, Omar; Rosenblum, David S.; Reynolds, Mark.

Research output: Chapter in Book/Conference paper › Conference paper

TY - GEN

T1 - A Novel Decentralized LTL Monitoring Framework Using Formula Progression Table

AU - Bataineh, Omar

AU - Rosenblum, David S.

AU - Reynolds, Mark

PY - 2019/1/1

Y1 - 2019/1/1

N2 - This paper presents a new technique for optimizing formal analysis of Boolean formulas and Linear Temporal Logic (LTL) formulas, namely the formula simplification tables. A formula simplification table is a mathematical table that shows all possible simplifications of the formula under different truth assignments of its variables. The simplification table is constructed using a three-valued logic: besides true and false, the variable can take an unknown value. 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 quantitative score 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. We demonstrate the effectiveness of formula simplification table in the context of software verification by developing an efficient framework for the well-known decentralized monitoring problem.

AB - This paper presents a new technique for optimizing formal analysis of Boolean formulas and Linear Temporal Logic (LTL) formulas, namely the formula simplification tables. A formula simplification table is a mathematical table that shows all possible simplifications of the formula under different truth assignments of its variables. The simplification table is constructed using a three-valued logic: besides true and false, the variable can take an unknown value. 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 quantitative score 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. We demonstrate the effectiveness of formula simplification table in the context of software verification by developing an efficient framework for the well-known decentralized monitoring problem.

UR - http://www.scopus.com/inward/record.url?scp=85075557082&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-30923-7_3

DO - 10.1007/978-3-030-30923-7_3

M3 - Conference paper

SN - 9783030309220

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 38

EP - 55

BT - Model Checking Software - 26th International Symposium, SPIN 2019, Proceedings

A2 - Biondi, Fabrizio

A2 - Given-Wilson, Thomas

A2 - Legay, Axel

PB - Springer

ER -