Reachability Games on Extended Vector Addition Systems with States

DOI10.1007/978-3-642-14162-1_40zbMath1288.68179MaRDI QIDQ3587462

Tomáš Brázdil, Petr Jančar, Antonín Kučera

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_40

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Unnamed Item, Unnamed Item, State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems, Unnamed Item, On the complexity of resource-bounded logics, Compositional strategy synthesis for stochastic games with multiple objectives, Maker-breaker percolation games. II: Escaping to infinity, On decidability and complexity of low-dimensional robot games, Weighted automata on infinite words in the context of attacker-defender games, Strategy synthesis for multi-dimensional quantitative objectives, The complexity of multi-mean-payoff and multi-energy games, On effective construction of the greatest solution of language inequality \(XA\subseteq BX\), On Robot Games of Degree Two, Optimal Bounds for Multiweighted and Parametrised Energy Games, Energy Games in Multiweighted Automata, Weighted Automata on Infinite Words in the Context of Attacker-Defender Games, Playing with Repetitions in Data Words Using Energy Games, Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time