On the analysis and synthesis of free choice systems
APN 90 Proceedings on Advances in Petri nets 1990
Reduction and synthesis of live and bounded free choice Petri nets
Information and Computation
Free choice Petri nets
Structure theory of equal conflict systems
Theoretical Computer Science - Special volume on Petri nets
Compositional Synthesis of Live and Bounded Free Choice Petri Nets
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
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
Characterizing Liveness of Petri Nets in Terms of Siphons
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
A Proof of the Rank Theorem for Extended Free Choice Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Liveness and Boundedness Analysis for Petri Nets with Event Graph Modules
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
A synthesis rule for concurrent systems
DAC '78 Proceedings of the 15th Design Automation Conference
ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS
ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS
Invariant-preserving transformations for the verification of place/transition systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Property-preserving subnet reductions for designing manufacturing systems with shared resources
Theoretical Computer Science
Checking system boundedness using ordinary differential equations
Information Sciences: an International Journal
Analysis of properties of petri synthesis net
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Hi-index | 5.24 |
This paper concerns two important techniques, characterization and property-preserving transformation, for verifying some basic properties of asymmetric choice Petri nets (AC nets). In the literature, a majority of the characterizations are for ordinary free choice nets. This paper presents many extended (from free choice nets) and new characterizations for four properties: liveness with respect to an initial marking, liveness monotonicity with respect to an initial marking, well-formedness, liveness and boundedness with respect to an initial marking. The nets involved are extended to homogeneous free choice nets, ordinary AC nets and homogeneous AC nets. This paper also investigates the transformation of merging a set of places of an ordinary AC net and proposes the conditions for it to preserve the siphon-trap-property (ST-property), liveness, boundedness and reversibility. The results are then applied to the verification of resource-sharing systems. At present, the major approaches for solving this problem are based on state machines or marked graphs and are not based on property preservation. Our approach extends the scopes of the underlying nets to AC nets and the verification techniques. It is found that the ST-property plays a very important role in many of the results. Furthermore, mainly through examples, the importance of the assumptions in the proposed characterizations and transformation and the limitation on further extensions are pointed out.