Algebraic representation for ordinary place transition petri nets

Abstract

Ordinary place transition Petri nets are useful for modeling discrete systems at a low level. It can be shown that the behavior of these structures does not entirely depend on the static model but also on the resource distribution in the net. In this work the problem of representing Petri nets is presented. Some algebraic notations for modeling at the i) structural and ii) operational level are presented. Some simple examples are used to illustrate the usefulness of these notations and expose hidden concurrency issues in Petri nets. The results are discussed. The ideas presented here are just an outline of what can be done in this area.