scientific article; zbMATH DE number 2086664
From MaRDI portal
Publication:4737201
Recommendations
Cited in
(29)- Model checking procedural programs
- Domains for Higher-Order Games
- Strategy composition in compositional games
- Formats of winning strategies for six types of pushdown games
- Synthesis of finite-state and definable winning strategies
- scientific article; zbMATH DE number 1017515 (Why is no real title available?)
- Efficient CTL model-checking for pushdown systems
- A saturation method for the modal \(\mu \)-calculus over pushdown systems
- Qualitative reachability in stochastic BPA games
- Note on winning positions on pushdown games with \(\omega\)-regular conditions
- Uniform solution of parity games on prefix-recognizable graphs
- A Branching Time Variant of CaRet
- Infinite-state games with finitary conditions
- Modular strategies for recursive game graphs
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
- Symbolic computational techniques for solving games
- Mean-payoff pushdown games
- Optimal strategies in weighted limit games
- On-the-Fly Synthesis for Strictly Alternating Games
- Exploring the boundary of half-positionality
- Optimally Resilient Strategies in Pushdown Safety Games
- Reachability games on automatic graphs
- Summaries for context-free games
- Optimal strategies in pushdown reachability games
- Regular strategies in pushdown reachability games
- Two-Way Tree Automata Solving Pushdown Games
- Positional Strategies for Higher-Order Pushdown Parity Games
- Solving μ-Calculus Parity Games by Symbolic Planning
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 Q4737201)
