Publication details

LTL to self-loop alternating automata with generic acceptance and back

Authors

BLAHOUDEK František MAJOR Juraj STREJČEK Jan

Year of publication 2020
Type Article in Periodical
Magazine / Source Theoretical Computer Science
MU Faculty or unit

Faculty of Informatics

Citation
Web https://www.sciencedirect.com/science/article/pii/S030439752030390X
Doi http://dx.doi.org/10.1016/j.tcs.2020.07.015
Keywords LTL; Omega-automata; LTL to automata translation; Alternating automata; ltl3tela
Description Self-loop alternating automata (SLAA) with Buchi or co-Buchi acceptance are popular formalisms also known as very weak alternating automata (VWAA). They are often used as an intermediate results in translations of LTL to deterministic or nondeterministic automata. This paper considers SLAA with generic transition-based Emerson-Lei acceptance and presents translations of LTL to these automata and back. Importantly, the translation of LTL to SLAA with generic acceptance produces considerably smaller automata than previous translations of LTL to Buchi or co-Buchi SLAA. Our translation is already implemented in the tool ltl3tela, where it helps to produce small deterministic or nondeterministic transition-based Emerson-Lei automata for given LTL formulae. (C) 2020 Elsevier B.V. All rights reserved.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info