Dissecting \texttt{ltlsynt}
From MaRDI portal
Publication:6151759
Recommendations
Cites work
- scientific article; zbMATH DE number 6527944 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- scientific article; zbMATH DE number 1759609 (Why is no real title available?)
- An improved construction of deterministic omega-automaton using derivatives
- Effective reductions of Mealy machines
- Efficient minimization of deterministic weak -automata
- From Spot 2.0 to Spot 2.10: What’s New?
- Graph-Based Algorithms for Boolean Function Manipulation
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- LTL to deterministic Emerson-Lei automata
- Mathematical Foundations of Computer Science 2003
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata
- Modalities for model checking: Branching time logic strikes back
- One theorem to rule them all: a unified translation of LTL into \(\omega \)-automata
- Practical “Paritizing” of Emerson-Lei Automata
- State Reduction in Incompletely Specified Finite-State Machines
This page was built for publication: Dissecting \texttt{ltlsynt}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151759)