東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Computations on distributed discrete...

Rohloff, Kurt Ryan.

Linked to FindBook

Google Book

Amazon

博客來

Computations on distributed discrete-event systems.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Computations on distributed discrete-event systems./
Author:	Rohloff, Kurt Ryan.
Description:	275 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 3075.
Contained By:	Dissertation Abstracts International65-06B.
Subject:	Engineering, Electronics and Electrical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3137937
ISBN:	049685107X

Computations on distributed discrete-event systems.
Rohloff, Kurt Ryan.

Computations on distributed discrete-event systems. - 275 p.

Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 3075.

Thesis (Ph.D.)--University of Michigan, 2004.

This thesis explores computational issues related to the control and verification of systems with distributed structure. The framework of supervisory control theory and discrete-event systems is used where system modules are modelled as sets of finite state automata whose behavior coordinates on the occurrence of common events. It is shown that in general many problems related to the supervision of these systems are PSPACE-complete. There are methods for solving these problems that are more efficient in memory than the current state-of-the-art methods, but there are most likely no time-efficient general solution methods that would aid in the study of such "large-scale" systems. This thesis explores methods for avoiding the computational difficulty of solving these problems.

ISBN: 049685107XSubjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Computations on distributed discrete-event systems.
LDR:02955nmm 2200325 4500 001 1839330
005 20050627125020.5
008 130614s2004 eng d
020 $a 049685107X
035 $a (UnM)AAI3137937
035 $a AAI3137937
040 $a UnM $c UnM
100 1 $a Rohloff, Kurt Ryan. $3 1927726
245 1 0 $a Computations on distributed discrete-event systems.
300 $a 275 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 3075.
500 $a Chair: Stephane Lafortune.
502 $a Thesis (Ph.D.)--University of Michigan, 2004.
520 $a This thesis explores computational issues related to the control and verification of systems with distributed structure. The framework of supervisory control theory and discrete-event systems is used where system modules are modelled as sets of finite state automata whose behavior coordinates on the occurrence of common events. It is shown that in general many problems related to the supervision of these systems are PSPACE-complete. There are methods for solving these problems that are more efficient in memory than the current state-of-the-art methods, but there are most likely no time-efficient general solution methods that would aid in the study of such "large-scale" systems. This thesis explores methods for avoiding the computational difficulty of solving these problems.
520 $a For decentralized control situations a new state estimator is presented that accounts for past local control actions when calculating the set of estimated system states. The new state estimator is used to develop new decentralized control protocols with a common sufficient safety condition.
520 $a It is also shown that it is difficult to approximate minimal solutions to a sensor selection problem for partial observation control situations. Heuristic methods for solving this approximation problem based on a type of edge-colored graph cutting problem are then discussed. It is also shown how to convert a type of communicating controller problem into this edge-colored graph cutting problem.
520 $a A notion of state permutation symmetry that defines an equivalence class for the distributed system states is introduced. A method is shown to reduce the complexity of verifying mu-calculus propositions for systems with state permutation symmetry. A special class of symmetric distributed systems is also shown that allows for an even greater reduction in the difficulty of testing several fundamental system properties. Control and verification problems related to both local and global specifications for these special systems are then explored.
590 $a School code: 0127.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Engineering, System Science. $3 1018128
650 4 $a Computer Science. $3 626642
690 $a 0544
690 $a 0790
690 $a 0984
710 2 0 $a University of Michigan. $3 777416
773 0 $t Dissertation Abstracts International $g 65-06B.
790 1 0 $a Lafortune, Stephane, $e advisor
790 $a 0127
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3137937