From LTL to Symbolically Represented Deterministic Automata
Authors:
- 29 February 2008
- book chapter
- Published by Springer Nature
- p. 279-293
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Experiments with deterministic-automata for formulas of linear temporal logicTheoretical Computer Science, 2006
- Symbolic Implementation of Alternating AutomataLecture Notes in Computer Science, 2006
- Solving Games Without Determinization2006
- Efficient LTL compilation for SAT-based model checking2005
- An Efficient Pre-determinization AlgorithmLecture Notes in Computer Science, 2003
- Unambiguous Büchi automataTheoretical Computer Science, 2003
- On Complementing Nondeterministic Büchi Automata2003
- Algorithmic verification of linear temporal logic specifications1998
- Another Look at LTL Model CheckingFormal Methods in System Design, 1997
- Deciding branching time logic1984