Related Experiment Videos
A modified reachability tree approach to analysis of unbounded Petri nets
Fei-Yue Wang1, Yanqing Gao, MengChu Zhou
1The Complex Systems and Intelligence Science Laboratory, Institute of Automation, Chinese Academy of Sciences, Beijing 100080, China.
Abstract:
Reachability trees, especially the corresponding Karp-Miller's finite reachability trees generated for Petri nets are fundamental for systematically investigating many characteristics such as boundedness, liveness, and performance of systems modeled by Petri nets. However, too much information is lost in a FRT to render it useful for many applications. In this paper, modified reachability trees (MRT) of Petri nets are introduced that extend the capability of Karp-Miller's FRTs in solving the liveness, deadlock, and reachability problems, and in defining or determining possible firing sequences. The finiteness of MRT is proved and several examples are presented to illustrate the advantages of MRT over FRT.
Related Concept Videos
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
State Space Representation
Consider an RLC circuit, a...
Plotting and Calibrating the Root Locus
The maximum gain occurs at the breakaway points between open-loop poles on the real axis, while the minimum gain is observed...
Signal Flow Graphs
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
Node Analysis for AC Circuits
To unravel the complexities of this system, nodal analysis is employed, a powerful technique founded on Kirchhoff's current law (KCL), which remains valid for phasors. AC circuits can effectively be...
Circuit Terminology
A circuit, on the other hand, is also an interconnected system of electrical elements but must contain one or more closed paths.