Pages that link to "Item:Q5426071"
From MaRDI portal
The following pages link to From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata (Q5426071):
Displaying 43 items.
- Solving parity games in big steps (Q340584) (← links)
- Antichains and compositional algorithms for LTL synthesis (Q453498) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- Reactive synthesis without regret (Q520338) (← links)
- Doomsday equilibria for omega-regular games (Q528193) (← links)
- Program repair without regret (Q746769) (← links)
- Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← links)
- Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
- A tighter analysis of Piterman's Büchi determinization (Q989532) (← links)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- Safraless LTL synthesis considering maximal realizability (Q1674867) (← links)
- On relative and probabilistic finite counterability (Q1742987) (← links)
- Opacity for linear constraint Markov chains (Q1745942) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Linear temporal logic -- from infinite to finite horizon (Q2147173) (← links)
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games (Q2211871) (← links)
- From LTL to deterministic automata. A safraless compositional approach (Q2363815) (← links)
- Index appearance record with preorders (Q2675810) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- State of Büchi Complementation (Q3073645) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- New Optimizations and Heuristics for Determinization of Büchi Automata (Q3297598) (← links)
- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis (Q3297602) (← links)
- From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata (Q3303906) (← links)
- Index Appearance Record for Transforming Rabin Automata into Parity Automata (Q3303907) (← links)
- (Q3384171) (← links)
- Symmetric Strategy Improvement (Q3449491) (← links)
- Tighter Bounds for the Determinisation of Büchi Automata (Q3617728) (← links)
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (Q3617729) (← links)
- Realizability of Real-Time Logics (Q3648828) (← links)
- Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning (Q5039514) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- Model Checking Omega-regular Properties for Quantum Markov Chains (Q5111649) (← links)
- Rabin vs. Streett Automata (Q5136307) (← links)
- Ramsey-Based Inclusion Checking for Visibly Pushdown Automata (Q5277899) (← links)
- From LTL to Symbolically Represented Deterministic Automata (Q5452723) (← links)
- (Q5856426) (← links)
- Synthesis of Data Word Transducers (Q5875385) (← links)
- Good-for-Game QPTL: An Alternating Hodges Semantics (Q5875946) (← links)
- Realizability problem for constraint LTL (Q6178458) (← links)
