Abstract
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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
De Wulf, M., Doyen, L., Maquet, N., & Raskin, J. F. (2008). Antichains: Alternative algorithms for LTL satisfiability and model-checking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4963 LNCS, pp. 63–77). https://doi.org/10.1007/978-3-540-78800-3_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
