Hierarchical interface-based supervisory Control-part I: serial case

Leduc, Ryan J.; Brandin, B.A.; Lawford, Mark; Wonham, W. M.

doi:10.1109/tac.2005.854586

Cited by 95 publications

(60 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We present below a state based interface definition as it is more straightforward to verify. We show in [19] that it is equivalent to the language based definition given in [5]- [7] as long as G I j is reachable.…”

Section: High-levelmentioning

confidence: 99%

“…We feel the tradeoff is worthwhile due to the increase in scalability and the other benefits of our approach [5].…”

Section: A Automata Based Algorithmsmentioning

confidence: 99%

“…As the HISC method has already been explained and justified in detail in [5]- [7], we will only discuss it briefly here. For a small illustrative HISC example, please see [5].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Synthesis Method for Hierarchical Interface-based Supervisory Control

Leduc

Dai

2007

2007 American Control Conference

View full text Add to dashboard Cite

Hierarchical Interface-Based Supervisory Control (HISC) decomposes a discrete-event system (DES) into a high-level subsystem which communicates with n ≥ 1 low-level subsystems, through separate interfaces. It provides a set of local conditions that can be used to verify global conditions such as nonblocking and controllability such that the complete system model never needs to be constructed.Currently, a designer must create the supervisors himself and then verify that they satisfy the HISC conditions. In this paper, we develop a synthesis method that can take advantage of the HISC structure.We replace the supervisor for each level by a corresponding specification DES. We then construct for each level a maximally permissive supervisor that satisfies the corresponding HISC conditions.We define a set of language based fixpoint operators and show that they compute the required level-wise supremal languages. We then discuss the complexity of our algorithms and show that they potentially offer significant savings over the monolithic approach. We also briefly discuss a symbolic HISC verification and synthesis method using Binary Decision Diagrams, that we have also developed.A large manufacturing system example (worst case state space on the order of 10 30 ) extended from the AIP example is briefly discussed. The example showed that we can now handle a given level with a statespace as large as 10 15 states, using less than 160MB of memory. This represents a significant improvement in the size of systems that can be handled by the HISC approach. A software tool for synthesis and verification of HISC systems using our approach was also developed.

show abstract

Section: High-levelmentioning

confidence: 99%

“…We feel the tradeoff is worthwhile due to the increase in scalability and the other benefits of our approach [5].…”

Section: A Automata Based Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Synthesis Method for Hierarchical Interface-based Supervisory Control

Leduc

Dai

2007

2007 American Control Conference

View full text Add to dashboard Cite

show abstract

“…Leduc et al [21][22][23][24][25][26][27] proposed the Hierarchical Interface-based Supervisory Control (HISC) by bringing the information hiding theory from software engineering into supervisory control. By using this method, a system is decomposed into one high-level subsystem and multiple low-level subsystems.…”

Section: By Using Idd (Integer Decision Diagram An Extension Of Binamentioning

confidence: 99%

Symbolic Synthesis and Verification of Hierarchical Interface-based Supervisory Control

Song

Leduc

2006

2006 8th International Workshop on Discrete Event Systems

View full text Add to dashboard Cite

Hierarchical Interface-based Supervisory Control (HISC) is a method to alleviate the state-explosion problem when verifying the controllable and nonblocking properties of a large discrete event system. By decomposing a system as a number of subsystems according to the HISC method, we can verify the subsystems separately and the global system controllability and nonblocking property are guaranteed, so that potentially great computation effort is saved.In this thesis, we first present a predicate-based synthesis algorithm for each type of subsystem and then prove the correctness of the algorithms. Then a predicatebased verification algorithm for each type of subsystem is provided. Based on the predicate-based algorithms, a symbolic implementation is proposed by using Binary Decision Diagrams (BDD) and the fact that a subsystem is usually composed of a number of components. With the symbolic implementation, we can handle a much larger subsystem of each type.Two large and complicated examples (with estimated worst-case state space on the order of 10 30 ) extended from the AIP example are provided for demonstrating the capabilities of the algorithms and the implementation. A software tool for the synthesis and verification using our approach is also developed.

show abstract

“…Researchers are seeking effective control methods for various subclasses of DES that enjoy special structures. Such structures will admit modularity [13], [14], [15], [16] and model abstraction [17], [18], [19], [20] to circumvent computing global dynamic models.…”

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

Hierarchical interface-based supervisory Control-part I: serial case

Cited by 95 publications

References 33 publications

Synthesis Method for Hierarchical Interface-based Supervisory Control

Synthesis Method for Hierarchical Interface-based Supervisory Control

Symbolic Synthesis and Verification of Hierarchical Interface-based Supervisory Control

Supervisory control of extended finite automata using transition projection

Contact Info

Product

Resources

About