scientific article; zbMATH DE number 6527944
From MaRDI portal
Publication:3459475
Recommendations
- LTL to Büchi automata translation: fast and more deterministic
- Optimal Translation of LTL to Limit Deterministic Automata
- From LTL to Symbolically Represented Deterministic Automata
- From LTL to deterministic automata. A safraless compositional approach
- scientific article; zbMATH DE number 7649960
- Efficient approach of translating LTL formulae into Büchi automata
- Effective translation of LTL to deterministic Rabin automata: beyond the \((\mathrm F,\mathrm G)\)-fragment
- LTL to deterministic Emerson-Lei automata
- One theorem to rule them all: a unified translation of LTL into -automata
Cited in
(14)- From LTL to unambiguous Büchi automata via disambiguation of alternating automata
- From LTL to deterministic automata. A safraless compositional approach
- Translating to co-Büchi made tight, unified, and useful
- New optimizations and heuristics for determinization of Büchi automata
- From LTL and limit-deterministic Büchi automata to deterministic parity automata
- Optimal Translation of LTL to Limit Deterministic Automata
- The Complexity of Translating Logic to Finite Automata
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited
- Dissecting \texttt{ltlsynt}
- On the translation of automata to linear temporal logic
- Guessing winning policies in LTL synthesis by semantic learning
- Synthesis with privacy against an observer
- Monotonicity characterizations of regular languages
- Synthesis with privacy against an observer
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459475)
