2 citations · 2 across the 5 of their papers we have counts for
4 papers · 1 filter
Memoryless Strategies in Stochastic Reachability Games
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study concurrent stochastic reachability games played on finite graphs. Two players, Max and Min, seek respectively to maximize and minimize the probability of reaching a set of…
Handling of Past and Future with Phenesthe+
Manolis Pitsikalis, Alexei Lisitsa, Patrick Totzke
Writing temporal logic formulae for properties that combine instantaneous events with overlapping temporal phenomena of some duration is difficult in classical temporal logics. To…
Linear Combinations of Unordered Data Vectors
Piotr Hofman, Jérôme Leroux, Patrick Totzke
Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite…
Trace Inclusion for One-Counter Nets Revisited
Piotr Hofman, Patrick Totzke
One-Counter nets (OCN) consist of a nondeterministic finite control and a single integer counter that cannot be fully tested for zero. They form a natural subclass of both One-Coun…