Dynamic Analysis of Petri Net-Based Discrete Systems

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Control and Information Sciences 356

ISBN: 3-540-71464-2, 978-3-540-71464-4

Size: 2 MB (2099658 bytes)

Pages: 170/171

File format:

Language:

Publishing Year:

Category: Tags: , ,

Dr. Andrei Karatkevich (auth.)3-540-71464-2, 978-3-540-71464-4

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).

Table of contents :
Front Matter….Pages I-XIII
Introduction….Pages 1-8
Main Notions, Problems and Methods….Pages 9-26
Reduced Reachability Graphs….Pages 27-62
Decomposition for Analysis….Pages 63-85
Analysis by Solving Logical Equations — Calculation of Siphons and Traps….Pages 87-93
Verification of Detailed System Descriptions….Pages 95-121
Conclusion….Pages 123-125
Back Matter….Pages 127-166

Reviews

There are no reviews yet.

Be the first to review “Dynamic Analysis of Petri Net-Based Discrete Systems”
Shopping Cart
Scroll to Top