scientific article; zbMATH DE number 7438574
From MaRDI portal
Publication:5013884
zbMath1476.03020arXiv1509.07206MaRDI QIDQ5013884
Publication date: 3 December 2021
Full work available at URL: https://arxiv.org/abs/1509.07206
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (3)
Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal bounds in parametric LTL games
- Weak MSO with the unbounding quantifier
- From liveness to promptness
- Reasoning about infinite computations
- On Promptness in Parity Games
- Finitary winning in ω-regular games
- Weak Cost Monadic Logic over Infinite Trees
- Temporal logic can be more expressive
- Regular Linear Temporal Logic
- Parametric temporal logic for “model measuring”
- 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
- Weak MSO+U with Path Quantifiers over Infinite Trees
- Computer Science Logic
- Solving Parity Games in Big Steps
- Parity and Streett Games with Costs
- Formal Methods for Components and Objects
This page was built for publication: