Parameterized linear temporal logics meet costs: still not costlier than LTL
From MaRDI portal
Publication:2413483
DOI10.1007/s00236-016-0279-9zbMath1390.68445OpenAlexW2963825040MaRDI QIDQ2413483
Publication date: 10 April 2018
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-016-0279-9
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items
Robust, expressive, and quantitative linear temporal logics: pick any two for free, Unnamed Item, Unnamed Item, Distributed synthesis for parameterized temporal logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal bounds in parametric LTL games
- Parametric linear dynamic logic
- Weak MSO with the unbounding quantifier
- From liveness to promptness
- Reasoning about infinite computations
- Visibly rational expressions
- On Promptness in Parity Games
- Finitary winning in ω-regular games
- Weak Cost Monadic Logic over Infinite Trees
- Visibly Linear Temporal Logic
- Temporal logic can be more expressive
- Regular Linear Temporal Logic
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- Parametric temporal logic for “model measuring”
- Visibly pushdown languages
- Energy Parity Games
- Better Quality in Synthesis through Quantitative Objectives
- The Theory of Stabilisation Monoids and Regular Cost Functions
- The complexity of propositional linear temporal logics
- Visibly Linear Dynamic Logic
- Weak MSO+U with Path Quantifiers over Infinite Trees
- Computer Science Logic
- Solving Parity Games in Big Steps
- Parity and Streett Games with Costs
