Frey, G.;Schettler, H.-G.:
Algebraic Analysis of Petri Net based Control Algorithms
Proceedings of the The Fourth International Workshop on Discrete Event Systems IEE WODES'98, Cagliari, 26.-28.08.98, pp. 94-96.

    The algebraic analysis of Petri Nets combines structural analysis (Transition and Place-Invariants) with information about the initial marking of the net. The main advantage of algebraic analysis over graph based methods is, that the problem of state space explosion is avoided. Hence, algebraic conditions are - in most cases - easier to check for large systems. In this contribution necessary and sufficient algebraic conditions for the correctness of Petri Net based control algorithms are presented.

Download full paper:

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by the authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works or parts of it may not be used to repost reprint/republish or for creating new collective works for resale or redistribution to servers or lists without the explicit permission of the copyright holder.