Optimal Bounds in Parametric LTL Games
We consider graph games of infinite duration with winning conditions in parameterized linear temporal logic, where the temporal operators are equipped with variables for time bounds. In model checking such specifications were introduced as "PLTL" by Alur et al. and (in a different version...
Main Author: | Martin Zimmermann |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2011-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1106.1237v1 |
Similar Items
-
Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time
by: Leander Tentrup, et al.
Published: (2016-09-01) -
Distributed PROMPT-LTL Synthesis
by: Swen Jacobs, et al.
Published: (2016-09-01) -
Model checking LTL properties over C programs with bounded traces
by: Morse, Jeremy, et al.
Published: (2013) -
Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL
by: Martin Zimmermann
Published: (2015-09-01) -
LTL-Specification of Counter Machines
by: Egor V. Kuzmin
Published: (2021-03-01)