Distributed synthesis for well-connected architectures

Gastin, Paul; Sznajder, Nathalie; Zeitoun, Marc

doi:10.1007/s10703-008-0064-7

Cited by 24 publications

(20 citation statements)

References 22 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As already pointed out in [5], the definition of uniform well-connectedness is not symmetric: whereas the routing functions are memoryless, some memory is required for the decoding functions. We take the example given in [5] to prove this fact.…”

Section: Preliminariesmentioning

confidence: 99%

“…Following these results, a decidability criterion has been exhibited [4], when the specifications considered are in CTL * and total : they are allowed to constrain all the variables of the system, even those serving as internal communications between the processes. We have advocated in [5] that total specifications are too powerful, and that external specifications, that only relate input and output variables (those allowing communication with the environment) and let internal communications unconstrained, were both more natural from a practical point of view, ✩ Partially supported by LIA INFORMEL.…”

Section: Introductionmentioning

confidence: 99%

“…It is thus important to be able to decide whether a given architecture is uniformly well-connected. This is not trivial and has not been addressed in [5]. Informally, an architecture is UWC if there exists a routing allowing each output process to get, as soon as possible, the values of all inputs it is connected to.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Decidability of well-connectedness for distributed synthesis

Gastin

Sznajder

2012

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

Although the synthesis problem is often undecidable for distributed, synchronous systems, it becomes decidable for the subclass of uniformly well-connected (UWC) architectures, provided that only robust specifications are considered. It is then an important issue to be able to decide whether a given architecture falls in this class. This is the problem addressed in this paper: we establish the decidability and precise complexity of checking this property. This problem is in EXPSPACE and NP-hard in the general case, but falls into PSPACE when restricted to a natural subclass of architectures.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Decidability of well-connectedness for distributed synthesis

Gastin

Sznajder

2012

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

show abstract

“…Over the past years a considerable research effort has been done in decentralized supervisory control [22], [26], [21], [11] that allows to synthesize individual controllers that have a partial observation of the system's moves and can communicate with each other [21], [1], [16]. In [8], Gastin et al study the decidability of LTL synthesis depending on the architecture of the distributed system. However, in these works the authors consider a synchronous architecture between the controllers.…”

Section: Introductionmentioning

confidence: 99%

Synthesis of communicating controllers for distributed systems

Kalyon¹,

Gall

Marchand

et al. 2011

IEEE Conference on Decision and Control and European Control Conference

View full text Add to dashboard Cite

Abstract-We consider the control of distributed systems composed of subsystems communicating asynchronously; the aim is to build local controllers that restrict the behavior of a distributed system in order to satisfy a global state avoidance property. We model our distributed systems as communicating finite state machines with reliable unbounded FIFO queues between subsystems. Local controllers can only observe their proper local subsystems and do not observe the queues. To refine their control policy, they can use the FIFO queues to communicate by piggybacking extra information to the messages sent by the subsystems. We define synthesis algorithms allowing to compute the local controllers. We explain how we can ensure the termination of this control algorithm by using abstract interpretation techniques, to overapproximate queue contents by regular languages. An implementation of our algorithms provides an empirical evaluation of our method. I. INTRODUCTIONIn the framework of control of distributed systems, two classes of systems are generally considered, depending on whether the communications between subsystems are synchronous or not. When the synchrony hypothesis [3] can be made, the decentralized control problem and the modular control problem address the design of coordinated controllers that jointly ensure the desired properties for this kind of systems [26], [22], [21], [9], [13]. When considering asynchronous distributed systems, one have to take into account some communication delays between the components of the system, which renders the distributed control problem much harder even undecidable [24].We are here interested in the second problem i.e., the distributed control problem. Our aim is to solve this problem when the system to be controlled is composed of n subsystems that asynchronously communicate through reliable unbounded FIFO channels (or queues). These subsystems are modeled by communicating finite state machines [5] (CFSM for short) that explicitly express the work and communications of a distributed system. This model appears to be essential for concurrent systems in which components cooperate via asynchronous message passing through unbounded buffers (they are e.g. widely used to model communication protocols). We thus assume that the distributed system is already built and the architecture of communication between the different subsystems is fixed. Following the architecture described in Figure 1, we assume that each subsystem is

show abstract

“…Asynchronous composition raises additional difficulties already in the case of one player against nature performing unobservable moves, and thus the classes of games for which distributed winning strategies can be effectively constructed are even more restrictive. A comprehensive classification of the current state of research is presented in [6].…”

Section: Introductionmentioning

confidence: 99%

Information Tracking in Games on Graphs

Berwanger

Kaiser

2010

J of Log Lang and Inf

View full text Add to dashboard Cite

When seeking to coordinate in a game with imperfect information, it is often relevant for a player to know what other players know. Keeping track of the information acquired in a play of infinite duration may, however, lead to infinite hierarchies of higher-order knowledge. We present a construction that makes explicit which higher-order knowledge is relevant in a game and allows us to describe a class of games that admit coordinated winning strategies with finite memory.

show abstract

Distributed synthesis for well-connected architectures

Cited by 24 publications

References 22 publications

Decidability of well-connectedness for distributed synthesis

Decidability of well-connectedness for distributed synthesis

Synthesis of communicating controllers for distributed systems

Information Tracking in Games on Graphs

Contact Info

Product

Resources

About