Rabinizer 2: small deterministic automata for LTL_
From MaRDI portal
Publication:5166706
Recommendations
- Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
- Rabinizer 3: Safraless translation of LTL to small deterministic automata
- Effective translation of LTL to deterministic Rabin automata: beyond the \((\mathrm F,\mathrm G)\)-fragment
- Comparison of LTL to Deterministic Rabin Automata Translators
- From LTL to deterministic automata. A safraless compositional approach
Cited in
(13)- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)
- Extending fairness expressibility of ECTL\(^+\): a tree-style one-pass tableau approach
- Efficient analysis of probabilistic programs with an unbounded counter
- Functional encryption for inner product with full function privacy
- Back to the future: a fresh look at linear temporal logic
- Generic emptiness check for fun and profit
- Rabinizer
- Limit deterministic and probabilistic automata for \(\mathrm{LTL}\backslash GU\)
- Optimal Translation of LTL to Limit Deterministic Automata
- From LTL to deterministic automata. A safraless compositional approach
- Guessing winning policies in LTL synthesis by semantic learning
- Rabinizer: small deterministic automata for \({\mathrm{LTL}(\mathrm{F},\mathrm{G})}\)
- Rabinizer 3: Safraless translation of LTL to small deterministic automata
This page was built for publication: Rabinizer 2: small deterministic automata for \(\mathrm{LTL}_{ \setminus\mathbf{GU}}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166706)
