Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
Model checking
ACM Transactions on Computational Logic (TOCL)
SAT-Based Decision Procedures for Classical Modal Logics
Journal of Automated Reasoning
A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing
ACM Transactions on Computational Logic (TOCL)
Interactive presentation: Automatic hardware synthesis from specifications: a case study
Proceedings of the conference on Design, automation and test in Europe
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Journal of Automated Reasoning
A Framework for Inherent Vacuity
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on SPIN 07
SAT-based model checking without unrolling
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
A PLTL-prover based on labelled superposition with partial model guidance
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
| Hi-index | 0.00 |
We present a new approach to reasoning in propositional linear-time temporal logic (PLTL). The method is based on the simplified temporal resolution calculus. We prove that the search for premises to apply the rules of simplified temporal resolution can be re-formulated as a search for minimal unsatisfiable subsets (MUS) in a set of classical propositional clauses. This reformulation reduces a large proportion of PLTL reasoning to classical propositional logic facilitating the use of modern tools. We describe an implementation of the method using the CAMUS system for MUS computation and present an in-depth comparison of the performance of the new solver against a clausal temporal resolution prover.