4 citations · 20 across the 27 of their papers we have counts for
4 papers · 1 filter
Synchronizing Data Words for Register Automata
Karin Quaas, Mahsa Shirmohammadi
Register automata (RAs) are finite automata extended with a finite set of registers to store and compare data from an infinite domain. We study the concept of synchronizing data wo…
On Strong Determinacy of Countable Stochastic Games
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study 2-player turn-based perfect-information stochastic games with countably infinite state space. The players aim at maximizing/minimizing the probability of a given event (i.…
Parity Objectives in Countable MDPs
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study countably infinite MDPs with parity objectives, and special cases with a bounded number of colors in the Mostowski hierarchy (including reachability, safety, Buchi and co-…
Revisiting Reachability in Timed Automata
Karin Quaas, Mahsa Shirmohammadi, James Worrell
We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear ari…