Bibliography: leaves 177-191. This thesis uses a new type of extended time Petri net to model and analyse command and control decision processes. A comprehensive review of existing time Petri net structures is given. This concludes with the introduction of time Petri net structure that incorporates the most commonly used time structures. This extended time Petri net structure is then used in the definition of the basic modelling blocks required to model command and control decision processes. This basic modelling block forms the basis of the direct analysis techniques that are introduced in the thesis.

Effective command and control is crucial to both military and non-military environments. Accurate representations of the processes associated with the inter and intra activities of nodes or agencies of such systems is essential in the analysis of command and control. One of the most important things is to be able to model the decision processes. These are the parts of the system that make decisions and then guide the direction of other elements in the system overall. This thesis uses a new type of extended time Petri net to model and analyse command and control decision processes. A comprehensive review of existing time Petri net structures is given. This concludes with the introduction of a time Petri net structure that incorporates the most commonly used time structures. This extended time Petri net structure is then used in the definition of the basic modelling blocks required to model command and control decision processes. This basic modelling block forms the basis of the direct analysis techniques that are introduced in the thesis. Due to the transient nature of the systems being modelled and the measures of interest a new type of measure is introduced, the mean conditional first hitting reward. This measure does not currently appear to be part of the stochastic process literature. Explicit procedures are given to determine the hitting probabilities and mean conditional first hitting reward for decision process models and discrete, continuous and semi-Markov chains. Finally the some extensions of the decision process sub-class are considered. / Thesis (Ph.D.) - University of Adelaide, Dept. of Applied Mathematics, 2001

Thesis (Ph.D)-- University of Adelaide, Dept. of Applied Mathematics, 2001. / Bibliography: leaves 177-191.

No description available.

A personal process is a coordination of personal activities, each requiring a joint effort between a user and an enacting organization. In this thesis, we model a personal process using Petri Nets to describe both the control flow and data flow pertaining to the personal process. We redefine the correctness of a personal process and address the verification method based on Petri Nets. In our architecture, we add an online execution engine for the user to execute and verify the correctness of a personal process in real time¡@through the Internet. A personal process can also be managed by a personal workflow management system (PWFMS) running on a handheld device. Because of the strict limitations on their computation power and battery consumptions, we support verification only when the wireless connection is available.

Petri nets are named in honor of Dr. Carl A. Petri for his famous Ph.D dissertation of general net theory in 1962. A substantial amount of work utilizing and modifying the Petri nets has been done since then, and they have turned out to be very useful in the study of asynchronous concurrent systems. The liveness and reachability problems are considered to be some of the major problems in Petri net theory.Since the structure of a Petri net can be regarded as sets of places and transitions form a graphical point of view, this thesis is concerned with utilizing the results of graph theory to investigate the liveness in terms of deadlock problems of a special subclass of Petri nets, free-choice Petri nets. As a subclass of Petri nets, the class of free-choice Petri nets possesse relatively strong analysis properties. This is especially true of complete free-choice Petri nets. We show in particular that any system which can be modeled by a general Petri net can also be modeled by a free-choice Petri net. / Department of Computer Science

Thesis (Ph. D.)--University of Hawaii at Manoa, 2005. / Includes bibliographical references (leaves 197-202). / Also available by subscription via World Wide Web / xi, 202 leaves, bound ill. 29 cm

Thesis (PhD)--University of South Australia, 1998

Thesis (PhD)--University of South Australia, 1998

Thesis (Ph. D.)--University of Hawaii at Manoa, 2005. / Includes bibliographical references (leaves 197-202).