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

zbMATH Open1478.68179arXiv1511.09450MaRDI QIDQ5015286FDOQ5015286

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

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)