Analysis of Phase-Type Stochastic Petri Nets with Discrete and Continuous Timing
Author | : National Aeronautics and Space Administration (NASA) |
Publisher | : Createspace Independent Publishing Platform |
Total Pages | : 50 |
Release | : 2018-05-29 |
ISBN-10 | : 1720383715 |
ISBN-13 | : 9781720383710 |
Rating | : 4/5 (710 Downloads) |
Download or read book Analysis of Phase-Type Stochastic Petri Nets with Discrete and Continuous Timing written by National Aeronautics and Space Administration (NASA) and published by Createspace Independent Publishing Platform. This book was released on 2018-05-29 with total page 50 pages. Available in PDF, EPUB and Kindle. Book excerpt: The Petri net formalism is useful in studying many discrete-state, discrete-event systems exhibiting concurrency, synchronization, and other complex behavior. As a bipartite graph, the net can conveniently capture salient aspects of the system. As a mathematical tool, the net can specify an analyzable state space. Indeed, one can reason about certain qualitative properties (from state occupancies) and how they arise (the sequence of events leading there). By introducing deterministic or random delays, the model is forced to sojourn in states some amount of time, giving rise to an underlying stochastic process, one that can be specified in a compact way and capable of providing quantitative, probabilistic measures. We formalize a new non-Markovian extension to the Petri net that captures both discrete and continuous timing in the same model. The approach affords efficient, stationary analysis in most cases and efficient transient analysis under certain restrictions. Moreover, this new formalism has the added benefit in modeling fidelity stemming from the simultaneous capture of discrete- and continuous-time events (as opposed to capturing only one and approximating the other). We show how the underlying stochastic process, which is non-Markovian, can be resolved into simpler Markovian problems that enjoy efficient solutions. Solution algorithms are provided that can be easily programmed.Jones, Robert L. and Goode, Plesent W. (Technical Monitor)Langley Research CenterPETRI NETS; MARKOV PROCESSES; SYNCHRONISM; ALGORITHMS