Approximating optimal bounds in prompt-LTL realizability in doubly-exponential time

MaRDI QIDQ5015286zbMATH OpenFDO

Authors Leander Tentrup, Alexander Weinert, Martín G. Zimmermann

Publication date 7 December 2021

Full work available at URL https://arxiv.org/abs/1511.09450, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2016.21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• Distributed PROMPT-LTL synthesis
• From Liveness to Promptness
• Optimal bounds in parametric LTL games
• Optimal bounds in parametric LTL games
• From liveness to promptness

Cites work

• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• Antichains and compositional algorithms for LTL synthesis
• Automata, logics, and infinite games. A guide to current research
• From liveness to promptness
• Optimal bounds in parametric LTL games
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Parametric linear dynamic logic
• Parametric temporal logic for “model measuring”
• Safraless Compositional Synthesis
• Solving Parity Games in Big Steps
• Symbolic bounded synthesis

Cited in

(1)

• Parameterized linear temporal logics meet costs: still not costlier than LTL

Describes a project that uses

Uses Software

• Acacia+

This page was built for publication: Approximating optimal bounds in prompt-LTL realizability in doubly-exponential time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015286)