English

Reduction Using Induced Subnets To Systematically Prove Properties For Free-Choice Nets

Formal Languages and Automata Theory 2021-06-18 v2

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).

Cite

@article{arxiv.2106.03658,
  title  = {Reduction Using Induced Subnets To Systematically Prove Properties For Free-Choice Nets},
  author = {Wil M. P. van der Aalst},
  journal= {arXiv preprint arXiv:2106.03658},
  year   = {2021}
}

Comments

Keywords: Petri Nets, Free-Choice Nets, Net Reduction, Lucency

R2 v1 2026-06-24T02:54:57.145Z