Similarity-based supervisory control of discrete-event systems

@article{Cao2006SimilaritybasedSC,
  title={Similarity-based supervisory control of discrete-event systems},
  author={Yongzhi Cao and Mingsheng Ying},
  journal={IEEE Trans. Autom. Control.},
  year={2006},
  volume={51},
  pages={325-330}
}
Due to the appearance of uncontrollable events in discrete-event systems, one may wish to replace the behavior leading to the uncontrollability of pre-specified language by some quite similar one. To capture this similarity, we introduce metric to traditional supervisory control theory and generalize the concept of original controllability to /spl lambda/-controllability, where /spl lambda/ indicates the similarity degree of two languages. A necessary and sufficient condition for a language to… 

Figures from this paper

Approximate reachability and bisimulation equivalences for transition systems

TLDR
Using Baire metric, a generalized framework of transition system approximation is proposed by developing the notions of approximate reachability and approximate bisimulation equivalences, which satisfy the transitive property of exact equivalence.

Towards approximate equivalences of workflow processes

TLDR
An approximate version of trace equiva-lence and bisimulation is introduced in this paper, aiming to answer when two workflows are the same with respect to some criterion.

References

SHOWING 1-10 OF 26 REFERENCES

On tolerable and desirable behaviors in supervisory control of discrete event systems

TLDR
A new supervisory control problem for discrete event systems to design a logical controller—or supervisor—such that the discrete event system satisfies a given set of requirements that involve event ordering.

Supervisory control of a class of discrete event processes

The paper studies the control of a class of discrete event processes, i.e., processes that are discrete, asynchronous and possibly nondeterministic. The controlled process is described as the

Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata

TLDR
It is shown that several interesting control synthesis problems for DES composed of a finite set of asynchronous components are computationally feasible, and algorithms are developed for solution.

Dealing with blocking in supervisory control of discrete-event systems

TLDR
The issue of blocking in the context of a general supervisory control problem with blocking which was introduced in a previous work is studied and techniques to improve both measures successively in order to optimize a given supervisor are presented.

Supervisory control of probabilistic discrete-event systems with recovery

TLDR
The authors discuss supervisory control of probabilistic discrete event systems and standard supervisor synthesis problems and reset supervisor (with recovery mechanism) synthesis problems for both fully observed and partially observed systems.

The infimal closed controllable superlanguage and its application in supervisory control

TLDR
It is shown that the computation of the infimal closed controllable superlanguage plays a central role in problems that involve a tradeoff between satisficing and blocking.

On the supremal controllable sublanguage of a given language

The concept of controllable language has been shown to play a basic role in the existence theory of supervisory controls for discrete event processes. In this paper the supremal controllable

On the supermal controllable sublanguage of a given language

The concept of controllable language has been shown to play a basic role in the existence theory of supervisory controls for discrete event processes. In this paper the supremal controllable

Control of Discrete Event Systems

TLDR
The main focus of this paper is the presentation of the automata and formal language model for DES introduced by Raniadge and Wonham in 1985, suitable for the examination of some important control theoretic issues, and provides a good basis for modular synthesis of controllers.