Symbolic solution of Emerson-Lei games for reactive synthesis
From MaRDI portal
Publication:6629450
DOI10.1007/978-3-031-57228-9_4MaRDI QIDQ6629450FDOQ6629450
Authors: Daniel Hausmann, Mathieu Lehaut, Nir Piterman 
Publication date: 30 October 2024
Cites Work
- Mathematical Foundations of Computer Science 2005
- Quasipolynomial computation of nested fixpoints
- Experimental Evaluation of Classical Automata Constructions
- Title not available (Why is that?)
- Synthesis of Reactive(1) designs
- Receding Horizon Temporal Logic Planning
- Synthesis of Reactive Switching Protocols From Temporal Logic Specifications
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Modalities for model checking: Branching time logic strikes back
- Model checking of safety properties
- Verification, Model Checking, and Abstract Interpretation
- Unbeast: Symbolic Bounded Synthesis
- Minimization of symbolic automata
- Deciding parity games in quasipolynomial time
- The fixpoint-iteration algorithm for parity games
- Determinization and limit-determinization of Emerson-Lei automata
- LTL to deterministic Emerson-Lei automata
- Supervisory Controller Synthesis for Nonterminating Processes Is an Obliging Game
- Practical “Paritizing” of Emerson-Lei Automata
- From Spot 2.0 to Spot 2.10: What’s New?
- Practical applications of the alternating cycle decomposition
- On the size of good-for-games Rabin automata and its link with the memory in Muller games
- On the power of automata minimization in reactive synthesis
This page was built for publication: Symbolic solution of Emerson-Lei games for reactive synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629450)
