Reduction using induced subnets to systematically prove properties for free-choice nets
From MaRDI portal
Publication:2117169
Abstract: We use sequences of t-induced T-nets and p-induced P-nets to convert free-choice nets into T-nets and P-nets while preserving properties such as well-formedness, liveness, lucency, pc-safety, and perpetuality. The approach is general and can be applied to different properties. This allows for more systematic proofs that "peel off" non-trivial parts while retaining the essence of the problem (e.g., lifting properties from T-net and P-net to free-choice nets).
Recommendations
Cites work
- A fresh look at free choice nets
- Blocking a transition in a free choice net and what it tells about its throughput.
- Free-choice Nets with Home Clusters are Lucent
- scientific article; zbMATH DE number 3980500 (Why is no real title available?)
- Lucent process models and translucent event logs
- Markings in perpetual free-choice nets are fully characterized by their enabled transitions
- Shortest paths in reachability graphs
- Simplified proof of the blocking theorem for free-choice Petri nets
- Structure theory of Petri nets
This page was built for publication: Reduction using induced subnets to systematically prove properties for free-choice nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117169)