History


Please fill in your query. A complete syntax description you will find on the General Help page.
Synthesis of a class of deadlock-free Petri nets. (English)
J. Assoc. Comput. Mach. 31, 486-506 (1984).
A new class of Petri nets called regular nets is described. The structure of these nets guarantees liveness once the invariants are marked with tokens. Some graphical properties of invariants and variants are discussed. The concept of net labeling is introduced and a systematic method of synthesizing regular nets is presented. It is shown how the safety of such nets can be trivially assured, thus producing live and safe control structures.
WorldCat.org
Valid XHTML 1.0 Transitional Valid CSS!