20 citations · 41 across the 31 of their papers we have counts for
14 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…
Parity Games on Temporal Graphs
Pete Austin, Sougata Bose, Patrick Totzke
Temporal graphs are a popular modelling mechanism for dynamic complex systems that extend ordinary graphs with discrete time. Simply put, time progresses one unit per step and the…
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL is Even Harder
Marie Fortin, Louwe B. Kuijer, Patrick Totzke +1
Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are H…
HyperLTL Satisfiability is -complete, HyperCTL* Satisfiability is -complete
Marie Fortin, Louwe B. Kuijer, Patrick Totzke +1
Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are H…
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…