LTL to Smaller Self-Loop Alternating Automata and Back

Blahoudek, František; Major, Juraj; Strejček, Jan

doi:10.1007/978-3-030-32505-3_10

Cited by 4 publications

(1 citation statement)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another way of translating TELA to GBA was described in [14]. Translations from LTL to TELA have been proposed in [8,26,29], and all of them use product constructions to combine automata for subformulas. The emptiness-check for ω-automata under different types of acceptance conditions has been studied in [3,9,11,16], where [3] covers the general case of Emerson-Lei conditions and also considers qualitative probabilistic model checking using deterministic TELA.…”

Section: Related Workmentioning

confidence: 99%

Determinization and Limit-determinization of Emerson-Lei automata

John¹,

Jantsch²,

Baier³

et al. 2021

Preprint

View full text Add to dashboard Cite

We study the problem of determinizing ω-automata whose acceptance condition is defined on the transitions using Boolean formulas, also known as transition-based Emerson-Lei automata (TELA). The standard approach to determinize TELA first constructs an equivalent generalized Büchi automaton (GBA), which is later determinized. We introduce three new ways of translating TELA to GBA. Furthermore, we give a new determinization construction which determinizes several GBA separately and combines them using a product construction. An experimental evaluation shows that the product approach is competitive when compared with state-of-the-art determinization procedures. We also study limit-determinization of TELA and show that this can be done with a single-exponential blow-up, in contrast to the known doubleexponential lower-bound for determinization. Finally, one version of the limit-determinization procedure yields good-for-MDP automata which can be used for quantitative probabilistic model checking.

show abstract

Section: Related Workmentioning

confidence: 99%

Determinization and Limit-determinization of Emerson-Lei automata

John¹,

Jantsch²,

Baier³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

Determinization and Limit-Determinization of Emerson-Lei Automata

John

Jantsch

Baier

et al. 2021

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata

John

Jantsch

Baier

et al. 2022

Innovations Syst Softw Eng

View full text Add to dashboard Cite

The topic of this paper is the determinization problem of $$\omega $$ ω -automata under the transition-based Emerson-Lei acceptance (called TELA), which generalizes all standard acceptance conditions and is defined using positive Boolean formulas. Such automata can be determinized by first constructing an equivalent generalized Büchi automaton (GBA), which is later determinized. The problem of constructing an equivalent GBA is considered in detail, and three new approaches of solving it are proposed. Furthermore, a new determinization construction is introduced which determinizes several GBA separately and combines them using a product construction. An experimental evaluation shows that the product approach is competitive when compared with state-of-the-art determinization procedures. The second part of the paper studies limit-determinization of TELA and we show that this can be done with a single-exponential blow-up, in contrast to the known double-exponential lower-bound for determinization. Finally, one version of the limit-determinization procedure yields good-for-MDP automata which can be used for quantitative probabilistic model checking.

show abstract

LTL to Smaller Self-Loop Alternating Automata and Back

Cited by 4 publications

References 24 publications

Determinization and Limit-determinization of Emerson-Lei automata

Determinization and Limit-determinization of Emerson-Lei automata

Determinization and Limit-Determinization of Emerson-Lei Automata

From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata

Contact Info

Product

Resources

About