32 citations · 149 across the 42 of their papers we have counts for
9 papers · 1 filter
Visibly Linear Dynamic Logic
Alexander Weinert, Martin Zimmermann
We introduce Visibly Linear Dynamic Logic (VLDL), which extends Linear Temporal Logic (LTL) by temporal operators that are guarded by visibly pushdown languages over finite words.…
Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time
Leander Tentrup, Alexander Weinert, Martin Zimmermann
We consider the optimization variant of the realizability problem for Prompt Linear Temporal Logic, an extension of Linear Temporal Logic (LTL) by the prompt eventually operator wh…
Limit Your Consumption! Finding Bounds in Average-energy Games
Kim G. Larsen, Simon Laursen, Martin Zimmermann
Energy games are infinite two-player games played in weighted arenas with quantitative objectives that restrict the consumption of a resource modeled by the weights, e.g., a batter…
Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL
Martin Zimmermann
We continue the investigation of parameterized extensions of Linear Temporal Logic (LTL) that retain the attractive algorithmic properties of LTL: a polynomial space model checking…
Unbounded Lookahead in WMSO+U Games
Martin Zimmermann
Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent's moves. We consider delay games with winning co…
Distributed PROMPT-LTL Synthesis
Swen Jacobs, Leander Tentrup, Martin Zimmermann
We consider the synthesis of distributed implementations for specifications in Prompt Linear Temporal Logic (PROMPT-LTL), which extends LTL by temporal operators equipped with para…