Control Synthesis of Petri Nets Based on S-Decreases
Discrete Event Dynamic Systems
A synthesis rule for concurrent systems
DAC '78 Proceedings of the 15th Design Automation Conference
On liveness and boundedness of asymmetric choice nets
Theoretical Computer Science
The synthesis of petri nets from path-automatic specifications
Information and Computation
Model checking safety properties in modular high-level nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Soundness and separability of workflow nets in the stepwise refinement approach
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
| Hi-index | 0.00 |
Petri net synthesis can avoid the state exploration problem, which is of exponential complexity, by guaranteeing the correctness in the Petri net while incrementally expanding the net. The conventional Petri net synthesis approaches, in general, suffer the drawback of only being able to synthesize a few classes of nets, such as state machines, marked graphs or asymmetric choice(AC) nets. However, the synthesis technique of Petri nets shared PP-type subnets can synthesize Petri nets beyond AC nets. One major advantage of the synthesis technique is that the resultant Petri net is guaranteed to be live, bounded and reversible. Most current synthesis techniques cannot handle systems with shared subsystems. To solve resource-sharing problem, Jiao L. presented the conditions for an AC net satisfying siphon-trap-property (ST-property) to be live, bounded and reversible[3]. The major motivation of this work is to generalize the results in [3] and to extend the resource-sharing technique to subsystem-sharing technique on AC nets or Petri nets beyond AC nets.