| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 721457 | IFAC Proceedings Volumes | 2006 | 4 Pages |
Abstract
This paper presents a semantic integrity of classical flat interpreted Petri net and hierarchical net. There are some known algorithms for a flat net analysis (e.g. liveness, safeness, etc.). The paper shows some elements of behavioral description (which are characteristic for hierarchical Petri net), such as enabling and prohibiting arcs, time dependencies, history of macroplaces, preemption, etc., and representation of them with using of flat net.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Grzegorz Andrzejewski,