Distributed synthesis for parameterized temporal logics

Jacobs, Swen and Tentrup, Leander and Zimmermann, Martin
(2018) Distributed synthesis for parameterized temporal logics.
Information and Computation, 262 (2). pp. 311-328.

[img]
Preview
 Text
1705.08112.pdf
Download (398kB) | Preview
Official URL: https://doi.org/10.1016/j.ic.2018.09.009

Abstract

We consider the synthesis of distributed implementations for specifications in parameterized temporal logics such as PROMPT–LTL, which extends LTL by temporal operators equipped with parameters that bound their scope. For single process synthesis, it is well-established that such parametric extensions do not increase worst-case complexities. For synchronous distributed systems, we show that, despite being more powerful, the realizability problem for PROMPT–LTL is not harder than its LTL counterpart. For asynchronous systems, we have to express scheduling assumptions and therefore consider an assume-guarantee synthesis problem. As asynchronous distributed synthesis is already undecidable for LTL, we give a semi-decision procedure for the PROMPT–LTL assume-guarantee synthesis problem based on bounded synthesis. Finally, we show that our results extend to the stronger logics PLTL and PLDL.

Item Type: Article
Divisions: Swen Jacobs (SJ)
Depositing User: Swen Jacobs
Date Deposited: 26 Nov 2018 10:57
Last Modified: 04 Jun 2021 08:42
Primary Research Area: NRA2: Reliable Security Guarantees
URI: https://publications.cispa.saarland/id/eprint/2743

Actions

Actions (login required)

View Item View Item
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.