On Conditional Decomposability
arXiv:1201.1733 · doi:10.1016/j.sysconle.2012.07.013
Abstract
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to extend the common alphabet so that the language becomes conditionally decomposable. A relationship of conditional decomposability to nonblockingness of modular discrete-event systems is also discussed in this paper in the general settings. It is shown that conditional decomposability is a weaker condition than nonblockingness.
A few minor corrections
References in corpus (1)
Cited by in corpus (7)
- Coordination Control of Discrete-Event Systems Revisited
- Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication
- On a Distributed Computation of Supervisors in Modular Supervisory Control
- A Note on Relative Observability in Coordination Control
- Optimal Non-blocking Decentralized Supervisory Control Using G-Control Consistency
- A Uniform Approach to Maximal Permissiveness in Modular Control of Discrete-Event Systems
- Combined Top-down and Bottom-up Approach to Multilevel Supervisory Control