Article ID Journal Published Year Pages File Type
10331857 Information Processing Letters 2014 5 Pages PDF
Abstract
The distributed synthesis problem of safety and reachability languages is known to be undecidable. In this article, we establish that this is the case for very simple languages, namely for safety and reachability specifications in the intersection of LTL and ACTL.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Distributed synthesis is simply undecidable
Authors
,