Please use this identifier to cite or link to this item:
|Title:||Towards decentralized and parameterized supervisor synthesis||Authors:||Lin, Liyong||Keywords:||DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Control engineering||Issue Date:||2015||Source:||Lin, L. (2015). Towards decentralized and parameterized supervisor synthesis. Doctoral thesis, Nanyang Technological University, Singapore.||Abstract:||This thesis studies the decentralized and parameterized supervisor synthesis problems in the Ramadge-Wonham paradigm. We obtain a characterization of the solvability of the decentralized realization problem, by reducing it to the problem of solving a set of language equations. The close relationship among the problems of language decomposition, supervisor decomposition and decentralized realization is then studied. Complexity-theoretic lower bound proofs are provided by reductions from the language decomposition problem. We then develop complexity reduction techniques for language decomposability verification. A sufficient condition for the undecidability of the distributed supervisor synthesis problem is derived based on the structure of the distributed control architecture. We also present a sufficient condition for the undecidability of a language based parameterized supervisor synthesis problem. The expressive power of the symbolic reachability relations of a class of parameterized systems is investigated and a sound state based parameterized supervisor synthesis procedure is develped in the frameowrk of regular model checking.||URI:||https://hdl.handle.net/10356/65641||DOI:||10.32657/10356/65641||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Theses|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.