On Conditional Decomposability

Details On Conditional Decomposability On Conditional Decomposability

2012-01-09

arxiv.org/abs/1201.1733v2

Computer Science

Systems and Control

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Conditional Decomposability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Conditional Decomposability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Conditional Decomposability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-643198