5 citations · 11 across the 5 of their papers we have counts for
3 papers · 1 filter
Strategy Complexity of Parity Objectives in Countable MDPs
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study countably infinite MDPs with parity objectives. Unlike in finite MDPs, optimal strategies need not exist, and may require infinite memory if they do. We provide a complete…
Universal Safety for Timed Petri Nets is PSPACE-complete
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu +2
A timed network consists of an arbitrary number of initially identical 1-clock timed automata, interacting via hand-shake communication. In this setting there is no unique central…
Petri Nets with Time and Cost
Parosh Aziz Abdulla, Richard Mayr
We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on…