Dynamic Analysis of Petri Net-Based Discrete Systems [electronic resource] / by Andrei Karatkevich.

Main Notions, Problems and Methods -- Reduced Reachability Graphs -- Decomposition for Analysis -- Analysis by Solving Logical Equations Calculation of Siphons and Traps -- Verification of Detailed System Descriptions -- Conclusion.

Design of modern digital hardware systems and of complex software systems is almost always connected with parallelism. For example, execution of an object-oriented p- gram can be considered as parallel functioning of the co-operating objects; all modern operating systems are multitasking, and the software tends to be multithread; many complex calculation tasks are solved in distributed way. But designers of the control systems probably have to face parallelism in more evident and direct way. Controllers rarely deal with just one controlled object. Usually a system of several objects is to be controlled, and then the control algorithm naturally turns to be parallel. So, classical and very deeply investigated model of discrete device, Finite State Machine, is not expressive enough for the design of control devices and systems. Theoretically in most of cases behavior of a controller can be described by an FSM, but usually it is not convenient; such FSM description would be much more complex, than a parallel specification (even as a network of several communicating FSMs).

ZDB-2-ENG