Decompositions of asynchronous systems

Abstract-In decentralized discrete-event system (DES) architectures, agents fuse their local decisions to arrive at the global decision. The contribution of each agent to the final decision is never assessed; however, it may be the case that only a subset of agents, i.e., a (static) coalition, perpetually contribute towards the correct final decisions. In casting the decentralized DES control (with and without communication) problem as a cooperative game, it is possible to quantify the average contribution that each agent makes towards synthesizing the overall correct control strategy. Specifically, we explore allocations that assess contributions of non-communicating and communicating controllers for this class of problems. This allows a quantification of the contribution that each agent makes to the coalition with respect to decisions made solely based on its partial observations and decisions made based on messages sent to another agent(s) to facilitate a correct control decision.

show abstract

“…Definition 4: ( [19]) Let Ω = A. The relation ∼ Ω is the least equivalence on the set Q such that the following two axioms are satisfied…”

Section: B Synchronized Compositionmentioning

confidence: 99%

Finding the weakest link(s): Coalition games for decentralized discrete-event control

Ricker

Marchand

2016

2016 IEEE 55th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

show abstract

“…A crushed automaton of U can be calculated with a computational complexity of O(|X| + |T U |). To ensure that the crushed automata κ Ωi (U) are correctly constructed, κ Ωi (U) must satisfy the following axioms related to Theorem 2.3 in [15]:…”

Section: B Verifying Distributed Observabilitymentioning

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

“…The general idea of synthesizing programs from specifications goes back to [12]. The particular case of non-recursive distributed systems is, e.g., dealt with in [7,9,19].…”

Section: Introductionmentioning

confidence: 99%

Realizability of concurrent recursive programs

Bollig¹,

Grindei²,

Habermehl

2017

Form Methods Syst Des

View full text Add to dashboard Cite

Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicating via shared actions. Actually, we combine multi-stack visibly pushdown automata and Zielonka's asynchronous automata towards a model with an undecidable emptiness problem. However, a reasonable restriction allows us to lift Zielonka's Theorem to this recursive setting and permits a logical characterization in terms of a suitable monadic second-order logic. Building on results from Mazurkiewicz trace theory and recent work by La Torre, Madhusudan, and Parlato, we thus develop a framework for the specification, synthesis, and verification of concurrent recursive processes.

show abstract

Decompositions of asynchronous systems

Cited by 32 publications

References 11 publications

Finding the weakest link(s): Coalition games for decentralized discrete-event control

Finding the weakest link(s): Coalition games for decentralized discrete-event control

A parity-based architecture for decentralized discrete-event control

Realizability of concurrent recursive programs

Contact Info

Product

Resources

About