Distributed PROMPT-LTL synthesis

MaRDI QIDQ5015281zbMATH OpenFDO

Authors Swen Jacobs, Leander Tentrup, Martín G. Zimmermann

Publication date 7 December 2021

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• Distributed synthesis for parameterized temporal logics
• Synthesis of Asynchronous Systems
• Parameterized synthesis
• Distributed Synthesis for Alternating-Time Logics
• Parameterized Synthesis

Cites work

• scientific article; zbMATH DE number 2080056 (Why is no real title available?)
• scientific article; zbMATH DE number 1754607 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Distributed synthesis for regular and contextfree specifications
• Distributed synthesis for well-connected architectures
• Distributed synthesis is simply undecidable
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Fair synthesis for asynchronous distributed systems
• 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”
• Synthesis of Asynchronous Systems

Cited in

(2)

• Distributed synthesis for parameterized temporal logics
• Approximating optimal bounds in prompt-LTL realizability in doubly-exponential time

This page was built for publication: Distributed PROMPT-LTL synthesis

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