Generic Emptiness Check for Fun and Profit

Baier, Christel; Blahoudek, František; Duret-Lutz, Alexandre; Klein, Joachim; Muller, David E.; Strejček, Jan

doi:10.1007/978-3-030-31784-3_26

Cited by 9 publications

(11 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The CAR construction, which is the general case for our paritization algorithm, produces smaller automata than the classical SAR, as it tracks colors instead of states, and uses transition-based acceptance. We further improved this construction by applying more specialized algorithms in each SCC (IAR [15], detection of Büchi-realizable SCCs [14], detection of empty SCCs [3], detection of parity) after simplifying their acceptance.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Practical “Paritizing” of Emerson-Lei Automata

Renkin

Duret-Lutz

Pommellet

2020

Automated Technology for Verification and Analysis

Self Cite

View full text Add to dashboard Cite

We introduce a new algorithm that takes a Transition-based Emerson-Lei Automaton (TELA), that is, an ω-automaton whose acceptance condition is an arbitrary Boolean formula on sets of transitions to be seen infinitely or finitely often, and converts it into a Transition-based Parity Automaton (TPA). To reduce the size of the output TPA, the algorithm combines and optimizes two procedures based on a latest appearance record principle, and introduces a partial degeneralization. Our motivation is to use this algorithm to improve our LTL synthesis tool, where producing deterministic parity automata is an intermediate step.

show abstract

Section: Resultsmentioning

confidence: 99%

“…-If L (A |Si ) is empty [3], strip all colors and set the acceptance condition to ⊥, which is a corner case for parity max even formula. (For parity max acceptances, transitions without color can be interpreted as having color −1.…”

Section: Paritization With Multiple Strategiesmentioning

confidence: 99%

Practical “Paritizing” of Emerson-Lei Automata

Renkin

Duret-Lutz

Pommellet

2020

Automated Technology for Verification and Analysis

Self Cite

View full text Add to dashboard Cite

show abstract

“…The development version of Spot provides also an emptiness check for TELA, and a probabilistic model checking algorithm working with deterministic Emerson-Lei automata has been implemented in PRISM. In both cases, an improved performance over previous solutions has been reported [4]. This paper presents a translation of LTL to SLAA with transition-based Emerson-Lei acceptance.…”

Section: Introductionmentioning

confidence: 91%

LTL to Smaller Self-Loop Alternating Automata and Back

Blahoudek

Major

Strejček

2019

Theoretical Aspects of Computing – ICTAC 2019

Self Cite

View full text Add to dashboard Cite

Self-loop alternating automata (SLAA) with Büchi or co-Büchi acceptance are popular intermediate formalisms 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 Büchi or co-Büchi SLAA. Our translation is already implemented in the tool LTL3TELA, where it helps to produce small deterministic or nondeterministic automata for given LTL formulae.

show abstract

“…For other conditions, Spot 2.0 would rely on a procedure called remove_fin() to convert automata with arbitrary acceptance conditions into "Fin-less" acceptance conditions [9]. This was ultimately fixed by developing a generic emptiness check [6]. Additionally the support for arbitrary acceptance conditions has allowed us to implement many useful algorithms; the most recent being the Alternating Cycle Decomposition [15,16] a powerful data structure with many applications (conversion to parity acceptance, degeneralization, typeness checks...) 3 .…”

Section: Büchimentioning

confidence: 99%

From Spot 2.0 to Spot 2.10: What's New?

Duret-Lutz¹,

Renault²,

Colange³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

Spot is a C ++ 17 library for LTL and ω-automata manipulation, with command-line utilities, and Python bindings. This paper summarizes its evolution over the past six years, since the release of Spot 2.0, which was the first version to support ω-automata with arbitrary acceptance conditions, and the last version presented at a conference. Since then, Spot has been extended with several features such as acceptance transformations, alternating automata, games, LTL synthesis, and more. We also shed some lights on the data-structure used to store automata. Artifact: https://zenodo.org/record/6521395.

show abstract

Generic Emptiness Check for Fun and Profit

Cited by 9 publications

References 31 publications

Practical “Paritizing” of Emerson-Lei Automata

Practical “Paritizing” of Emerson-Lei Automata

LTL to Smaller Self-Loop Alternating Automata and Back

From Spot 2.0 to Spot 2.10: What's New?

Contact Info

Product

Resources

About