Synthesis of a Class of Deadlock-Free Petri Nets

Abstract

A new class of Petri nets called regular nets is described. The structure of these nets guarantees liveness once the invanants are marked with tokens. Some graphical properties ofmvariants and variants are discussed. The concept of net labeling is introduced and a systematic method of synthesizing regular nets ts presented. It is shown how the safety of such nets can be trivially assured, thus producing live and safe control structures.