1999
DOI: 10.1007/978-1-4757-4070-7
|View full text |Cite
|
Sign up to set email alerts
|

Introduction to Discrete Event Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
1,568
0
28

Year Published

1999
1999
2011
2011

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 1,530 publications
(1,599 citation statements)
references
References 13 publications
3
1,568
0
28
Order By: Relevance
“…Let φ [t1,t2] (x(0), a) := t∈[t1,t2] φ t (x(0), a). Our objective is to design a supervisor [1], [2] for system (1) that prevents trajectories from entering the bad set. This requirement can be formally expressed using the concept of -safe trajectory:…”
Section: Problem Statementmentioning
confidence: 99%
See 3 more Smart Citations
“…Let φ [t1,t2] (x(0), a) := t∈[t1,t2] φ t (x(0), a). Our objective is to design a supervisor [1], [2] for system (1) that prevents trajectories from entering the bad set. This requirement can be formally expressed using the concept of -safe trajectory:…”
Section: Problem Statementmentioning
confidence: 99%
“…System Σ DT has an infinite number of states. We use the concept of bisimulation (see definition in [2]) to prove the an equivalence of Σ DT and a suitably constructed, finite discrete event system Σ DE . Consider the equivalence relation defined by z 1 z 2 if (z 1 ) = (z 2 ), with defined in (4), and the partition L of Y that it induces.…”
Section: A Supervisor Of the Trivial Systemmentioning
confidence: 99%
See 2 more Smart Citations
“…In this sense, the scheduling can be a class of Discrete Event Systems (DES) [2]. A variety of different solutions have been proposed to model the system using DES.…”
Section: Introductionmentioning
confidence: 99%