2016
DOI: 10.4204/eptcs.226.16
|View full text |Cite
|
Sign up to set email alerts
|

Distributed PROMPT-LTL Synthesis

Abstract: We consider the synthesis of distributed implementations for specifications in Prompt Linear Temporal Logic (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 systems, we show that, despite being more powerful, the distributed realizability problem for PROMPT-LTL is not harder than its LTL counterpart. For asynchronous sy… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 20 publications
(51 reference statements)
0
1
0
Order By: Relevance
“…Finally, we show that all these results also hold for PLTL and PLDL, even stronger logics to which the alternating color technique and bounded synthesis are still applicable. This is a revised and extended version of a paper that appeared at GandALF 2016 [16].…”
Section: Our Contributionsmentioning
confidence: 99%
“…Finally, we show that all these results also hold for PLTL and PLDL, even stronger logics to which the alternating color technique and bounded synthesis are still applicable. This is a revised and extended version of a paper that appeared at GandALF 2016 [16].…”
Section: Our Contributionsmentioning
confidence: 99%