On the Translation of Automata to Linear Temporal Logic

by   Udi Boker, et al.

While the complexity of translating future linear temporal logic (LTL) into automata on infinite words is well-understood, the size increase involved in turning automata back to LTL is not. In particular, there is no known elementary bound on the complexity of translating deterministic ω-regular automata to LTL. Our first contribution consists of tight bounds for LTL over a unary alphabet: alternating, nondeterministic and deterministic automata can be exactly exponentially, quadratically and linearly more succinct, respectively, than any equivalent LTL formula. Our main contribution consists of a translation of general counter-free deterministic ω-regular automata into LTL formulas of double exponential temporal-nesting depth and triple exponential length, using an intermediate Krohn-Rhodes cascade decomposition of the automaton. To our knowledge, this is the first elementary bound on this translation. Furthermore, our translation preserves the acceptance condition of the automaton in the sense that it turns a looping, weak, Büchi, coBüchi or Muller automaton into a formula that belongs to the matching class of the syntactic future hierarchy. In particular, it can be used to translate an LTL formula recognising a safety language to a formula belonging to the safety fragment of LTL (over both finite and infinite words).



There are no comments yet.


page 1

page 2

page 3

page 4


An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata

In the mid 80s, Lichtenstein, Pnueli, and Zuck proved a classical theore...

One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata

We present a unified translation of LTL formulas into deterministic Rabi...

Constructive Analysis of S1S and Büchi Automata

We study S1S and Büchi automata in the constructive type theory of the C...

The Cost of Monitoring Alone

We compare the succinctness of two monitoring systems for properties of ...

On the Complexity of Realizability for Safety LTL and Related Subfragments

We study the realizability problem for Safety LTL, the syntactic fragmen...

A Flexible Approach for Checking Timed Automata on Continuous Time Semantics

Timed Automata (TA) are used to represent systems when the interest is t...

Approximate Automata for Omega-Regular Languages

Automata over infinite words, also known as omega-automata, play a key r...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.