Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator

Komenda, Jan; Masopust, Tomáš; Schuppen, Jan H. van

doi:10.1016/j.sysconle.2011.04.005

Cited by 24 publications

(20 citation statements)

References 16 publications

(24 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we recall the coordination control problem and revise the necessary and sufficient conditions established in [8,9,12] under which the problem is solvable. This revision leads to a simplification of existing notions and proofs, e.g., compare Definition 3 with [8, Definition 9] or the proof of Proposition 1 with the proof of [8, Proposition 10].…”

Section: Coordination Control Synthesismentioning

confidence: 99%

“…The fundamental question is the construction of such a coordinator. We now discuss one of the possible constructions of a suitable coordinator, which has already been discussed in the literature [8,9,12]. We recall it here for the completeness.…”

Section: Problem 3 (Coordination Control Problem)mentioning

confidence: 99%

“…Recently, Komenda and Van Schuppen [13] have proposed a coordination control architecture as a trade-off between the purely local control synthesis, which is not effective in general because the composition of local supervisors may violate the specification, and the global control synthesis, which is not always possible because of the complexity reasons since the composition of all subsystems can result in an exponential blow-up of states in the monolithic plant. The coordination control approach has been developed for prefix-closed languages in [12] and extended to systems with partial observations in [9]. The case of non-prefix-closed languages has partially been discussed in [8].…”

mentioning

confidence: 99%

See 2 more Smart Citations

Coordination control of discrete-event systems revisited

Komenda

Masopust

Schuppen³

2014

Discrete Event Dyn Syst

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we revise and further investigate the coordination control approach proposed for supervisory control of distributed discrete-event systems with synchronous communication based on the Ramadge-Wonham automata framework. The notions of conditional decomposability, conditional controllability, and conditional closedness ensuring the existence of a solution are carefully revised and simplified. The paper is generalized to non-prefix-closed languages, that is, supremal conditionally controllable sublanguages of not necessary prefixclosed languages are discussed. Non-prefix-closed languages introduce the blocking issue into coordination control, hence a procedure to compute a coordinator for nonblockingness is included. The optimization problem concerning the size of a coordinator is under investigation. We prove that to find the minimal extension of the coordinator event set for which a given specification language is conditionally decomposable is NP-hard. In other words, unless P=NP, it is not possible to find a polynomial algorithm to compute the minimal coordinator with respect to the number of events.

show abstract

Section: Coordination Control Synthesismentioning

confidence: 99%

Section: Problem 3 (Coordination Control Problem)mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Coordination control of discrete-event systems revisited

Komenda

Masopust

Schuppen³

2014

Discrete Event Dyn Syst

Self Cite

View full text Add to dashboard Cite

show abstract

“…[20]. The study of statepartition automata is thus a further step to the understanding and characterization of the class of automata useful for practical applications in, e.g., coordination or hierarchical supervisory control of discrete-event systems [1,9,10,17,18].…”

Section: Introductionmentioning

confidence: 99%

On Properties and State Complexity of Deterministic State-Partition Automata

Jirásková¹,

Masopust²

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

A deterministic automaton accepting a regular language L is a state-partition automaton with respect to a projection P if the state set of the deterministic automaton accepting the projected language P (L), obtained by the standard subset construction, forms a partition of the state set of the automaton. In this paper, we study fundamental properties of state-partition automata. We provide a construction of the minimal state-partition automaton for a regular language and a projection, discuss closure properties of state-partition automata under the standard constructions of deterministic automata for regular operations, and show that almost all of them fail to preserve the property of being a statepartition automaton. Finally, we define the notion of a state-partition complexity, and prove the tight bound on the state-partition complexity of regular languages represented by incomplete deterministic automata.

show abstract

“…If M 1 is controllable with respect to M 2 and M 2 is controllable with respect to M 3 , then M 1 is controllable with respect to M 3[9].…”

mentioning

confidence: 99%

A Unifying Approach to Maximal Permissiveness in Modular Control of Discrete-Event Systems

Komenda

Lin

Schuppen³

2019

2019 IEEE 58th Conference on Decision and Control (CDC)

Self Cite

View full text Add to dashboard Cite

In this paper, a uniform approach to maximal permissiveness in modular control of discrete-event systems is proposed. It is based on three important concepts of modular closed-loops: monotonicity, distributivity, and exchangeability. Monotonicity of various closed-loops satisfying a given property considered in this paper holds whenever the underlying property is preserved under language unions. Distributivity holds if the inverse projections of local plants satisfy the given property with respect to each other. Among new results, sufficient conditions are proposed for distributed computation of supremal relatively observable sublanguages.

show abstract

Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator

Cited by 24 publications

References 16 publications

Coordination control of discrete-event systems revisited

Coordination control of discrete-event systems revisited

On Properties and State Complexity of Deterministic State-Partition Automata

A Unifying Approach to Maximal Permissiveness in Modular Control of Discrete-Event Systems

Contact Info

Product

Resources

About