### Citations

219 |
Parallel program schemata
- Karp, Miller
- 1969
(Show Context)
Citation Context ...s equivalent to consider only subsets C that are singletons. In many works on counter systems, there are only nonnegative counter values, e.g., in vector addition systems with states (VASS, in short) =-=[1]-=-, an edge is disabled whenever it would make a counter become negative. In energy games [2,3], the objective is to bound counter values, especially with 0 as lower bound. ⋆ This work is supported by t... |

41 | Infinite runs in weighted timed automata with energy constraints
- Bouyer, Fahrenberg, et al.
- 2008
(Show Context)
Citation Context ...ms, there are only nonnegative counter values, e.g., in vector addition systems with states (VASS, in short) [1], an edge is disabled whenever it would make a counter become negative. In energy games =-=[2,3]-=-, the objective is to bound counter values, especially with 0 as lower bound. ⋆ This work is supported by the french Agence Nationale de la Recherche, REACHARD (grant ANR-11-BS02-001) ⋆⋆ reichert@lsv.... |

33 | A.: Reachability Games on Extended Vector Addition Systems with States
- Brázdil, Jančar, et al.
- 2010
(Show Context)
Citation Context ...roblem is undecidable for reachability games on counter systems of dimension two under the Z semantics, by an adaptation of the undecidability proof for reachability games on VASS of dimension two in =-=[4]-=-. We prove in Section 4 that the decision problem is PSPACE-complete for reachability games on short-ranged counter systems of dimension one under the Z semantics when the objective is (qf , 0), and u... |

27 | Model checking probabilistic timed automata with one or two clocks - Jurdzinski, Sproston, et al. |

12 | Energy Games in Multiweighted Automata
- Fahrenberg, Juhl, et al.
- 2011
(Show Context)
Citation Context ...ms, there are only nonnegative counter values, e.g., in vector addition systems with states (VASS, in short) [1], an edge is disabled whenever it would make a counter become negative. In energy games =-=[2,3]-=-, the objective is to bound counter values, especially with 0 as lower bound. ⋆ This work is supported by the french Agence Nationale de la Recherche, REACHARD (grant ANR-11-BS02-001) ⋆⋆ reichert@lsv.... |

2 | 2013): The Complexity of Robot Games on the Integer Line
- Arul, Reichert
(Show Context)
Citation Context ...lity games in dimension one. There are at least two particular cases of counter reachability games for which the decision problem is EXPTIME-hard in dimension one: countdown games [5] and robot games =-=[6]-=-. To the best of our knowledge, it is not known whether counter reachability games in dimension one are in EXPTIME. 2 Definitions When we write “positive” or “negative”, we always mean “strictly posit... |