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