Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Design and validation of computer protocols
Design and validation of computer protocols
Handbook of theoretical computer science (vol. B)
Reasoning about infinite computations
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Weak Alternating Automata Are Not That Weak
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Journal of Computer and System Sciences
Tableau-based automata construction for dynamic linear time temporal logic*
Annals of Mathematics and Artificial Intelligence
Compositional Synthesis of Generalized Mealy Machines
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Bounded model checking of infinite state systems
Formal Methods in System Design
Designing protocols for agent institutions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
On Expressiveness and Complexity in Real-Time Model Checking
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Model Checking Quantitative Linear Time Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity and succinctness issues for linear-time hybrid logics
Theoretical Computer Science
Bounded Model Checking with SNF, Alternating Automata, and Büchi Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
From norms to interaction patterns: deriving protocols for agent institutions
ProMAS'07 Proceedings of the 5th international conference on Programming multi-agent systems
Declarative workflows to efficiently manage flexible and advanced business processes
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Guaranteed global performance through local coordinations
Automatica (Journal of IFAC)
Hybrid and first-order complete extensions of CaRet
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Compositional failure detection in structured transition systems
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Two variable vs. linear temporal logic in model checking and games
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Efficient monitoring of ω-languages
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Compositional Synthesis of Generalized Mealy Machines
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.01 |
This paper presents a tutorial introduction to the construction of finite-automata on infinite words from linear-time temporal logic formulas. After defining the source and target formalisms, it describes a first construction whose correctness is quite direct to establish, but whose behavior is always equal to the worst-case upper bound. It then turns to the techniques that can be used to improve this algorithm in order to obtain the quite effective algorithms that are now in use.