Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Dynamic Analysis of Petri Net-Based Discrete Systems

By: Karatkevich, Andrei [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Control and Information Sciences: 356Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.Description: XIII, 170 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540715603.Subject(s): Engineering | System theory | Control engineering | Robotics | Mechatronics | Engineering | Control, Robotics, Mechatronics | Systems Theory, ControlDDC classification: 629.8 Online 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).
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBK10114
Total holds: 0

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 for this item.

Log in to your account to post a comment.

Powered by Koha