The blow-up in translating LTL to deterministic automata

Authors:
Orna Kupferman;Adin Rosenberg
Affiliations:
School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel;School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel
Venue:
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Year:
2010

Citing 17
Cited 2

On the synthesis of a reactive module

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CTL and ECTL as fragments of the modal &mgr;-calculus

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Reasoning about infinite computations

Information and Computation
Alternation

Journal of the ACM (JACM)
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
Deterministic w Automata vis-a-vis Deterministic Buchi Automata

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Optimizing Büchi Automata

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Efficient Büchi Automata from LTL Formulae

CAV '00 Proceedings of the 12th 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
Deciding branching time logic

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
From linear time to branching time

ACM Transactions on Computational Logic (TOCL)
Safraless Decision Procedures

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Avoiding Determinization

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
On the complexity of omega -automata

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Co-ing Büchi Made Tight and Useful

LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Alternation removal in büchi automata

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II

Deterministic automata for the (f, g)-fragment of LTL

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
A logic of probabilistic knowledge and strategy

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The translation of LTL formulas to nondeterministic automata involves an exponential blow-up, and so does the translation of nondeterministic automata to deterministic ones. This yields a 22O(n) upper bound for the translation of LTL to deterministic automata. A lower bound for the translation was studied in [KV05a], which describes a 22Ω(√n) lower bound, leaving the problem of the exact blow-up open. In this paper we solve this problem and tighten the lower bound to 22Ω(n).