scientific article; zbMATH DE number 3990873
From MaRDI portal
Publication:3753490
Recommendations
Cited in
(45)- A survey of stochastic \(\omega \)-regular games
- Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
- Computing the Rabin Index of a Parity Automaton
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- Automata on infinite trees
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Graph Games and Reactive Synthesis
- Good-for-Game QPTL: An Alternating Hodges Semantics
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Alternating automata with start formulas
- Ambiguous classes in \(\mu\)-calculi hierarchies
- \(\omega \)-automata
- Axiomatising extended computation tree logic
- Model checking \(\omega\)-regular properties for quantum Markov chains
- On model checking for the \(\mu\)-calculus and its fragments
- Determinization and memoryless winning strategies
- Note on winning positions on pushdown games with \(\omega\)-regular conditions
- μ-Bicomplete Categories and Parity Games
- Hierarchies of weak automata and weak monadic formulas
- Choice functions and well-orderings over the infinite binary tree
- scientific article; zbMATH DE number 7559495 (Why is no real title available?)
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- Half-positional objectives recognized by deterministic Büchi automata
- The mu-calculus and Model Checking
- Semantic flowers for good-for-games and deterministic automata
- Permissive strategies: from parity games to safety games
- Solving parity games via priority promotion
- Rabin vs. Streett automata
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Church’s Problem and a Tour through Automata Theory
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Monadic second-order logic, graph coverings and unfoldings of transition systems
- Construction of Tree Automata from Regular Expressions
- Index appearance record with preorders
- Pushdown processes: Games and model-checking
- Fixed point characterization of infinite behavior of finite-state systems
- Quantitative solution of omega-regular games
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Unambiguous Büchi automata.
- A delayed promotion policy for parity games
- Certifying inexpressibility
- Automated temporal reasoning about reactive systems
- A delayed promotion policy for parity games
- Backward Deterministic Büchi Automata on Infinite Words
- Robust worst cases for parity games algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753490)
