Achieving distributed control through model checking
Susanne Graf,Doron Peled,Sophie Quinton +2 more
- 15 Jul 2010
- pp 396-409
TL;DR: This work applies model checking of knowledge properties to the design of distributed controllers that enforce global constraints on concurrent systems and shows how this framework is applied to theDesign of controllers that guarantee a priority policy among transitions.
read more
Abstract: We apply model checking of knowledge properties to the design of distributed controllers that enforce global constraints on concurrent systems We calculate when processes can decide, autonomously, to take or block an action so that the global constraint will not be violated When the separate processes cannot make this decision alone, it may be possible to temporarily coordinate several processes in order to achieve sufficient knowledge jointly and make combined decisions Since the overhead induced by such coordinations is important, we strive to minimize their number, again using model checking We show how this framework is applied to the design of controllers that guarantee a priority policy among transitions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Priority scheduling of distributed systems based on model checking
Ananda Basu,Saddek Bensalem,Doron Peled,Joseph Sifakis +3 more
- 01 Dec 2011
TL;DR: Identifying where the local information of a process is sufficient to schedule the execution of a high priority transition is allowed, which allows the transformed version of the program to react upon the knowledge it has at each point.
Synthesis of distributed control through knowledge accumulation
Gal Katz,Doron Peled,Sven Schewe +2 more
- 14 Jul 2011
TL;DR: This work introduces the use of simple supervisor processes that accumulate information about processes until sufficient knowledge is collected to allow for safe progression, and combines the knowledge approach with a game theoretic search that prevents progressing to states from which there is no way to guarantee the imposed constraints.
Algorithms for synthesizing priorities in component-based systems
Chih-Hong Cheng,Saddek Bensalem,Yu-Fang Chen,Rongjie Yan,Barbara Jobstmann,Harald Ruess,Christian Buckl,Alois Knoll +7 more
- 11 Oct 2011
TL;DR: In this paper, the authors present algorithms to synthesize component-based systems that are safe and deadlock-free using priorities, which define stateless-precedence between enabled actions.
19
Monitoring distributed systems using knowledge
Susanne Graf,Doron Peled,Sophie Quinton +2 more
- 06 Jun 2011
TL;DR: This paper controls the system to enforce that if a given global property is violated, at least one process knows this fact, and therefore may report it, using knowledge properties that are precalculated based on model checking.
•Posted Content
Algorithms for Synthesizing Priorities in Component-based Systems
Chih-Hong Cheng,Saddek Bensalem,Yu-Fang Chen,Rongjie Yan,Barbara Jobstmann,Harald Ruess,Christian Buckl,Alois Knoll +7 more
TL;DR: This work proposes three complementary methods as preprocessing steps for priority synthesis, namely data abstraction to reduce component complexities, alphabet abstraction and #-deadlock to ignore components, and automated assumption learning for compositional priority synthesis.
13
References
On the synthesis of strategies in infinite games
Wolfgang Thomas
- 02 Mar 1995
TL;DR: The automata theoretic setting of infinite games (given by “game graphs”), a new construction of winning strategies in finite-state games, and some questions which arise for games over effectively presented infinite graphs are described.
496
Modeling Heterogeneous Real-time Components in BIP
Ananda Basu,Marius Bozga,Joseph Sifakis +2 more
- 11 Sep 2006
TL;DR: In this article, the authors present a methodology for modeling heterogeneous real-time components, which are obtained as the superposition of three layers: Behavior, specified as a set of transitions; Interactions between transitions of the behavior; Priorities, used to choose amongst possible interactions.
Think Globally, Act Locally: Decentralized Supervisory Control
Karen Rudie,W. Murray Wonham +1 more
- 26 Jun 1991
TL;DR: A necessary and sufficient condition is given for the existence of a solution to the problem of finding decentralized supervisors that ensure that the behaviour of the closed-loop system lies in a given range.
397
Contentment in graph theory: Covering graphs with cliques
James B. Orlin
- 01 Jan 1977
TL;DR: In this article, the minimum number of complete subgraphs of a graph G which include all of the edges of G, and the minimum bipartite subgraph of G which cover G are both shown to be NP-complete.
333
A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems
Tae-Sic Yoo,Stéphane Lafortune +1 more
TL;DR: It is shown that under this architecture, a larger class of languages can be achieved than before since a relaxed version of the notion of co-observability appears in the necessary and sufficient conditions for the existence of supervisors.
276