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

By: Karatkevich, Andrei [author.]Contributor(s): SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Control and Information Sciences: 356Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: XIII, 170 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540715603Subject(s): Engineering | Systems theory | Engineering | Control Engineering | Systems Theory, ControlAdditional physical formats: Printed edition:: No titleOnline resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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).
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha