Handbook of theoretical computer science (vol. B)
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
State Space Reductions for Alternating Büchi Automata
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th 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)
Alternating automata and the temporal logic of ordinals
Alternating automata and the temporal logic of ordinals
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Minimizing NFA's and regular expressions
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Proceedings of the 14th international SPIN conference on Model checking software
Simulation relations for alternating parity automata and parity games
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
| Hi-index | 0.00 |
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion for deleting superfluous transitions in these NBA. We show how to use this algorithm in the translation of LTL formulas into NBA, matching the worst-case upper bounds of other LTL-to-NBA translations. We compare the NBA resulting from our translation to the results of two popular algorithms for the translation of LTL to generalized Büchi automata: the translation of Gerth et al. of 1995 (resulting in the GPVW-automaton), and the translation of Daniele et al. of 1999 (resulting in the DGV-automaton), which improves on the GPVW algorithm. We show that the redundancy check by syntactical implication used in the construction of the DGV-automaton is covered by our local optimization, that is, all transitions removed by the redundancy check will also be removed according to our local optimization criterion. Moreover, for a fixed input formula in next normal form, our locally optimized NBA from LTL and the locally optimized GPVW- and DGV-automaton are all essentially the same. Both these results give a “structural” explanation for the syntactic approaches by Gerth et al. and Daniele et al. We show that a bottom-up variant of our algorithm allows to pass simplifications of NBA for subformulas on to the NBA for the entire LTL formula.