Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Journal of the ACM (JACM)
Monotonic and Downward Closed Games*
Journal of Logic and Computation
Games for Counting Abstractions
Electronic Notes in Theoretical Computer Science (ENTCS)
Mathematics and Computers in Simulation
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Hi-index | 0.00 |
We propose to study concurrent games on a new extension of Vector Addition Systems with States, where inhibition conditions are added for modeling purposes. Games are a well-suited framework to solve control problems, and concurrent semantics reflect realistic situations where the environment can always produce a move before the controller, although it is never required to do so. This is in contrast with previous works, which focused mainly on turn-based semantics. Moreover, we consider asymmetric games, where environment and controller do not have the same capabilities, although they both have restricted power. In this setting, we investigate reachability and safety objectives, which are not dual to each other anymore, and we prove that (i) reachability games are undecidable for finite targets, (ii) they are 2-EXPTIME-complete for upward-closed targets and (iii) safety games are co-NP-complete for finite, upward-closed and semi-linear targets. Moreover, for the decidable cases, we build a finite representation of the corresponding controllers.