On the Computation of Observers in Discrete-Event Systems

Wong, Kai C.; Wonham, W. M.

doi:10.1023/b:disc.0000005010.55515.27

Cited by 83 publications

(107 citation statements)

References 11 publications

Supporting

Mentioning

107

Contrasting

Order By: Relevance

“…The OP-verifier does not require explicitly computing the abstraction to check for the OP and has been shown to have better computational performance when compared to other similar procedures (Wong and Wonham, 2004;Jiang et al, 2003;Feng and Wonham, 2010;Pena et al, 2010a). Nevertheless, the OP-verifier algorithm as proposed in (Pena et al, 2008) can only be applied to automata that do not have cycles of non-relevant events.…”

Section: Introductionmentioning

confidence: 99%

Generalised Verification of the Observer Property in Discrete Event Systems

Bravo

Cunha

Pena

et al. 2012

IFAC Proceedings Volumes

View full text Add to dashboard Cite

Abstract:The observer property is an important condition to be satisfied by abstractions of Discrete Event Systems (DES) models. This paper presents a generalised version of a previous algorithm which tests if an abstraction of a DES obtained through natural projection has the observer property. The procedure called OP-verifier II overcomes the limitations of the previously proposed verifier while keeping its computational complexity. Results are illustrated by a case study of a transfer line system.

show abstract

Section: Introductionmentioning

confidence: 99%

Generalised Verification of the Observer Property in Discrete Event Systems

Bravo

Cunha

Pena

et al. 2012

IFAC Proceedings Volumes

View full text Add to dashboard Cite

show abstract

“…The most effective model abstraction operator in SCT is the causal reporter map having the observer property [15], which later was substituted by Feng and Wonham [16], [17] with the natural observer. In this, components which are sharing only a small number of common events, their abstractions tend to be small, and designing controllers may require only a modest effort.…”

Section: Introductionmentioning

confidence: 99%

Abstractions for nonblocking supervisory control of Extended Finite Automata

Shoaei

Feng

Lennartson

2012

2012 IEEE International Conference on Automation Science and Engineering (CASE)

View full text Add to dashboard Cite

Abstract-An abstraction method for Extended Finite Automata (EFAs), i.e., finite automata extended with variables, using transition projection is presented in this work. A manufacturing system modeled by EFAs is abstracted into subsystems that embody internal interacting dependencies. Synthesis and verification of subsystems are achieved through their model abstractions rather than their global model. Sufficient conditions are presented to guarantee that supervisors result in maximally permissive and nonblocking control. An examples demonstrate the computational effectiveness and practical usage of the approach.

show abstract

“…While [21] treats hierarchical control using general causal reporter maps, Feng and Wonham [22], [23], construct model abstractions only with natural observers, i.e., natural projections [24], [25], [26] with the observer property. In this method, if two components share only a small number of common events, their abstractions tend to be small, and either verifying the nonconflicting property (if it holds) or designing a coordinator to achieve it may require only modest effort.…”

Section: Introductionmentioning

confidence: 99%

Supervisory control of extended finite automata using transition projection

Shoaei

Feng

Lennartson

2012

2012 IEEE 51st IEEE Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

Abstract-A limitation of the Ramadge and Wonham (RW) framework for the supervisory control theory is the explicit state representation using finite automata, often resulting in complex and unintelligible models. Extended finite automata (EFAs), i.e., deterministic finite automata extended with variables, provide compact state representation and then make the control logic transparent through logic expressions of the variables. A challenge with this new control framework is to exploit the rich control structure established in RW's framework. This paper studies the decentralized control structure with EFAs. To reduce the computational complexity, the controller is synthesized based on model abstraction of subsystems, which means that the global model of the entire system is unnecessary. Sufficient conditions are presented to that guarantee the decentralized supervisors result in maximally permissive and nonblocking control to the entire system.

show abstract

On the Computation of Observers in Discrete-Event Systems

Cited by 83 publications

References 11 publications

Generalised Verification of the Observer Property in Discrete Event Systems

Generalised Verification of the Observer Property in Discrete Event Systems

Abstractions for nonblocking supervisory control of Extended Finite Automata

Supervisory control of extended finite automata using transition projection

Contact Info

Product

Resources

About