For the most recent entries see the Petri Nets Newsletter.

Algebraic Analysis of Petri Net based Control Algorithms.

Frey, G.; Schettler, H.-G.

In: Proceedings of the The Fourth International Workshop on Discrete Event Systems (WODES'98), Cagliari, pages 94-96. IEE, August 1998.

Abstract: 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.

Keywords: Interpreted Petri Nets, Automatic Control, Algebraic Analysis, Invariants.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography