Parametric linear dynamic logic

DOI10.1016/j.ic.2016.07.009zbMath1362.68169arXiv1408.5957OpenAlexW2963943124MaRDI QIDQ515660

Peter Faymonville, Martín G. Zimmermann

Publication date: 16 March 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.5957

zbMATH Keywords

realizabilitymodel checkinglinear temporal logicparametric linear temporal logiclinear dynamic logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (13)

Incorporating monitors in reactive synthesis without paying the price ⋮ Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Robust, expressive, and quantitative linear temporal logics: pick any two for free ⋮ Delay Games with WMSO+U Winning Conditions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Almost event-rate independent monitoring ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Distributed synthesis for parameterized temporal logics ⋮ Visibly linear dynamic logic ⋮ Quantitative reductions and vertex-ranked infinite games ⋮ Propositional Dynamic Logic for Hyperproperties

Uses Software

• LTL2BA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal bounds in parametric LTL games
• Antichains and compositional algorithms for LTL synthesis
• Parametric metric interval temporal logic
• Alternating finite automata on \(\omega\)-words
• Observations on determinization of Büchi automata
• From liveness to promptness
• Propositional dynamic logic of regular programs
• Reasoning about infinite computations
• Temporal logic can be more expressive
• Regular Linear Temporal Logic
• Parametric temporal logic for “model measuring”
• Tighter Bounds for the Determinisation of Büchi Automata
• The complexity of propositional linear temporal logics
• FINITE STATE PROCESSES, Z-TEMPORAL LOGIC AND THE MONADIC THEORY OF THE INTEGERS
• Programming Techniques: Regular expression search algorithm
• Solving Sequential Conditions by Finite-State Strategies

This page was built for publication: Parametric linear dynamic logic