Antichains and compositional algorithms for LTL synthesis
From MaRDI portal
Recommendations
Cites work
- Algorithms for Omega-Regular Games with Imperfect Information
- An Antichain Algorithm for LTL Realizability
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Automata, logics, and infinite games. A guide to current research
- Borel determinacy
- Bounded Synthesis
- Church’s Problem and a Tour through Automata Theory
- Compositional algorithms for LTL synthesis
- Compositional Control Synthesis for Partially Observable Systems
- CONCUR 2005 – Concurrency Theory
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- scientific article; zbMATH DE number 1670781 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 2209335 (Why is no real title available?)
- On bounded specifications
- Open Implication
- Safraless Compositional Synthesis
- Translating to co-Büchi made tight, unified, and useful
- Verification, Model Checking, and Abstract Interpretation
Cited in
(25)- Compositional and symbolic synthesis of reactive controllers for multi-agent systems
- Formally verified algorithms for upper-bounding state space diameters
- Decoy allocation games on graphs with temporal logic objectives
- Practical synthesis of reactive systems from LTL specifications via parity games
- A symbolic algorithm for lazy synthesis of eager strategies
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
- Synthesising succinct strategies in safety games with an application to real-time scheduling
- Symbolic model checking in non-Boolean domains
- An Antichain Algorithm for LTL Realizability
- Down the Borel hierarchy: solving Muller games via safety games
- LTL-model-checking via model composition
- Compositional algorithms for LTL synthesis
- The complexity of transducer synthesis from multi-sequential specifications
- Approximating optimal bounds in prompt-LTL realizability in doubly-exponential time
- Parametric linear dynamic logic
- scientific article; zbMATH DE number 7147442 (Why is no real title available?)
- Synthesis from LTL specifications with mean-payoff objectives
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Real-time policy enforcement with metric first-order temporal logic
- LTL reactive synthesis with a few hints
- Synthesis from component libraries with costs
- LTL reactive synthesis with a few hints
- Towards the usage of window counting constraints in the synthesis of reactive systems to reduce state space explosion
- Towards the usage of window counting constraints in the synthesis of reactive systems to reduce state space explosion
- Chance and mass interpretations of probabilities in Markov decision processes
This page was built for publication: Antichains and compositional algorithms for LTL synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453498)
