Distributed PROMPT-LTL synthesis

zbMATH Open1478.68163arXiv1509.05144MaRDI QIDQ5015281FDOQ5015281

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

Recommendations

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Fair synthesis for asynchronous distributed systems
• Synthesis of Asynchronous Systems
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Title not available (Why is that?)
• Parametric temporal logic for “model measuring”
• From liveness to promptness
• Optimal bounds in parametric LTL games
• Parametric linear dynamic logic
• Title not available (Why is that?)
• Distributed synthesis for well-connected architectures
• Distributed synthesis for regular and contextfree specifications
• Distributed synthesis is simply undecidable
• Parameterized linear temporal logics meet costs: still not costlier than LTL

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)