Abstract | ||
---|---|---|
This paper describes a state-based approach for supervisor synthesis of discrete-event systems under partial observation, based on predicates and predicate transformers. We focus on the normality property and provide an iterative algorithm for state-based normality synthesis. A condition is provided to simplify the algorithm. To bridge the gap between language-based normality synthesis and state-based normality synthesis, we prove that their synthesis results are mutually consistent. This paper also aims to build a useful foundation for non-blocking supervisor synthesis of partially-observed state tree structures, which is essentially a state-based approach. The proposed approach is illustrated with a Guideway example taken from the literature. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1109/ACCESS.2018.2859798 | IEEE ACCESS |
Keywords | Field | DocType |
Discrete-event systems, partial observation, normality, symbolic computation | Supervisor,Normality,Observability,Computer science,Supervisory control,Iterative method,Theoretical computer science,Tree structure,Predicate (grammar),Distributed computing | Journal |
Volume | ISSN | Citations |
6 | 2169-3536 | 1 |
PageRank | References | Authors |
0.38 | 0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Deguang Wang | 1 | 3 | 2.10 |
Liyong Lin | 2 | 13 | 6.75 |
Zhi Wu Li | 3 | 470 | 38.43 |
Walter Murray Wonham | 4 | 2 | 1.42 |