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