Structure theory of Petri nets: the free choice hiatus
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
On the analysis and synthesis of free choice systems
APN 90 Proceedings on Advances in Petri nets 1990
A polynomial-time algorithm to decide liveness of bounded free choice nets
Theoretical Computer Science
Reduction and synthesis of live and bounded free choice Petri nets
Information and Computation
Free choice Petri nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
On Liveness in Extended non Self-Controlling Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
On Liveness and Controlled Siphons in Petri Nets
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Generalized Conditions for Liveness Enforcement and Deadlock Prevention in Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
On liveness preservation by composition of nets via a set of places
Papers from the 11th International Conference on Applications and Theory of Petri Net: Advances in Petri Nets 1991
A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Liveness in Bounded Petri Nets Which Are Covered by T-Invariants
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Invariant-preserving transformations for the verification of place/transition systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
On liveness and boundedness of asymmetric choice nets
Theoretical Computer Science
Une approche à base de modèles pour l'ingénierie logicielle de techniques d'interaction
Conference Internationale Francophone sur I'Interaction Homme-Machine
A model-based approach for supporting engineering usability evaluation of interaction techniques
Proceedings of the 3rd ACM SIGCHI symposium on Engineering interactive computing systems
| Hi-index | 0.00 |
Several new characterizations relating the liveness, liveness monotonicity and siphons of general and asymmetric choice nets are first proposed in this article. The first major one states that, if a pure ordinary net satisfies liveness monotonicity, then every siphon of it contains at least one trap. The second major one characterizes the nonliveness of an individual transition of a homogeneous asymmetric choice net in terms of some properties of its siphons. Then, based on these new characterizations, extension and new proofs for several existing characterizations of asymmetric choice nets are given.