Know means no: Incorporating knowledge into discrete-event control systems

Ricker, S.L.; Rudie, Karen

doi:10.1109/9.880616

Cited by 72 publications

(29 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Van der Meyden [13] introduced knowledge with perfect recall. Knowledge has been applied to control distributed discrete event systems [15] and to implement priorities between multiparty interactions [2,4]. However, the previous works assume a conflict resolution mechanism.…”

Section: Knowledge-based Optimizationmentioning

confidence: 99%

Knowledge Based Transactional Behavior

Bensalem

Bozga

Peled

et al. 2013

Hardware and Software: Verification and Testing

View full text Add to dashboard Cite

Component-based systems (including distributed programs and multiagent systems) involve a lot of coordination. This coordination is done in the background, and is transparent to the operation of the system. The reason for this overhead is the interplay between concurrency and non-deterministic choice: processes alternate between progressing independently and coordinating with other processes, where coordination can involve multiple choices of the participating components. This kind of interactions appeared as early as some of the main communication-based programming languages, where overhead effort often causes a restriction on the possible coordination. With the goal of enhancing the efficiency of coordination for component-based systems, we propose here a method for coordination-based on the precalculation of the knowledge of processes and coordination agents. This knowledge can be used to lift part of the communication or synchronization that appears in the background of the execution to support the interaction. Our knowledge-based method is orthogonal to the actual algorithms or primitives that are used to guarantee the synchronization: it only removes messages conveying information that knowledge can infer.

show abstract

Section: Knowledge-based Optimizationmentioning

confidence: 99%

Knowledge Based Transactional Behavior

Bensalem

Bozga

Peled

et al. 2013

Hardware and Software: Verification and Testing

View full text Add to dashboard Cite

show abstract

“…This class of languages was first examined in [10]. When a language is distributed observable, if the controllers combined or pooled their individual estimates then they could all definitively discern that σ must be disabled.…”

Section: Classifying Decentralized Languagesmentioning

confidence: 99%

“…These assignments do not lend themselves easily to a straightforward explanation of a parity-based architecture. In the epistemic logic formulation of the decentralized control problem for the unconditional architecture [10], a disablement control decision was issued locally if an agent "knew" or was certain of the truth about disabling. Thus, we will assume that 0 corresponds to enable, 1 corresponds to disable and, therefore, the fusion rule for the unconditional architecture is disjunction, while conjunction is now used for the conditional architecture.…”

Section: Background and Notationmentioning

confidence: 99%

A parity-based architecture for decentralized discrete-event control

Ricker

Marchand

2013

2013 American Control Conference

View full text Add to dashboard Cite

Abstract-We introduce a new architecture that extends the class of problems that can be solved in decentralized DES control in the absence of communication. In this architecture, unlike previous architectures that use either conjunction(∧) or disjunction (∨) to fuse local control decisions, the fusion rule is exclusive or (⊕). We also characterize the new architecture, where controllers take a single decision, with respect to the recently-proposed multidecision framework of Chakib and Khoumsi. Unlike previous architectures, parity-based controllers cannot predetermine their local control decision based solely on their local observations. Instead, the local control decisions are calculated a priori.

show abstract

“…In [44], Knowledge is applied to decentralized control of a plant. A plant is an automaton whose interactions are labeled by actions, some of them being forbidden.…”

Section: Related Workmentioning

confidence: 99%

Optimized distributed implementation of multiparty interactions with Restriction

Bensalem

Bozga

Quilbeuf

et al. 2015

Science of Computer Programming

View full text Add to dashboard Cite

Using high level coordination primitives allows enhanced expressiveness of componentbased frameworks to cope with the inherent complexity of present-day systems designs. Nonetheless, their distributed implementation raises multiple issues, regarding both the correctness and the runtime performance of the final implementation. We propose a novel approach for distributed implementation of multiparty interactions subject to scheduling constraints expressed by priorities. We rely on a new composition operator named Restriction, whose semantics dynamically restricts the set of interactions allowed for execution, depending on the current state. We show that this operator provides a natural encoding for priorities. We provide a knowledge-based optimization that modifies the Restriction operator to avoid superfluous communication in the final implementation. We complete our framework through an enhanced conflict resolution protocol that natively implements Restriction. A prototype implementation allows us to compare performances of different optimizations.

show abstract

Know means no: Incorporating knowledge into discrete-event control systems

Cited by 72 publications

References 28 publications

Knowledge Based Transactional Behavior

Knowledge Based Transactional Behavior

A parity-based architecture for decentralized discrete-event control

Optimized distributed implementation of multiparty interactions with Restriction

Contact Info

Product

Resources

About