Reasoning about infinite computations
Information and Computation
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Symbolic Model Checking
From Pre-historic to Post-modern Symbolic Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Alternating automata and the temporal logic of ordinals
Alternating automata and the temporal logic of ordinals
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Improved algorithms for the automata-based approach to model-checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Proceedings of the 14th international SPIN conference on Model checking software
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Strategy Construction for Parity Games with Imperfect Information
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
An Antichain Algorithm for LTL Realizability
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Fixpoint Guided Abstraction Refinement for Alternating Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Strategy construction for parity games with imperfect information
Information and Computation
Fixed point guided abstraction refinement for alternating automata
Theoretical Computer Science
Lattice-valued binary decision diagrams
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A multi-encoding approach for LTL symbolic satisfiability checking
FM'11 Proceedings of the 17th international conference on Formal methods
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
More anti-chain based refinement checking
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
On MITL and alternating timed automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
The linear temporal logic (LTL) was introduced by Pnueli as a logic to express properties over the computations of reactive systems. Since this seminal work, there have been a large number of papers that have studied deductive systems and algorithmic methods to reason about the correctness of reactive programs with regard to LTL properties. In this paper, we propose new efficient algorithms for LTL satisfiability and model-checking. Our algorithms do not construct nondeterministic automata from LTL formulas but work directly with alternating automata using efficient exploration techniques based on antichains.