A Multi-encoding Approach for LTL Symbolic Satisfiability Checking [chapter]

Kristin Y. Rozier, Moshe Y. Vardi
2011 Lecture Notes in Computer Science  
Formal behavioral specifications written early in the system-design process and communicated across all design phases have been shown to increase the efficiency, consistency, and quality of the system under development. To prevent introducing design or verification errors, it is crucial to test specifications for satisfiability. Our focus here is on specifications expressed in linear temporal logic (LTL). We introduce a novel encoding of symbolic transition-based Büchi automata and a novel,
more » ... ppy," transition encoding, both of which result in improved scalability. We also define novel BDD variable orders based on tree decomposition of formula parse trees. We describe and extensively test a new multi-encoding approach utilizing these novel encoding techniques to create 30 encoding variations. We show that our novel encodings translate to significant, sometimes exponential, improvement over the current standard encoding for symbolic LTL satisfiability checking.
doi:10.1007/978-3-642-21437-0_31 fatcat:43leuwof2vbjnnqs3xjaqtkpxi