Joachim Wehler - Perpetual Free-choice Petri nets are lucent -- proof of a theorem of van der Aalst using CP-exhaustions

fi:8512 - Fundamenta Informaticae, November 18, 2021, Volume 182, Issue 4 - https://doi.org/10.3233/FI-2021-2078
Perpetual Free-choice Petri nets are lucent -- proof of a theorem of van der Aalst using CP-exhaustions

Authors: Joachim Wehler

Van der Aalst's theorem is an important result for the analysis and synthesis of process models. The paper proves the theorem by exhausting perpetual free-choice Petri nets by CP-subnets. The resulting T-systems are investigated by elementary methods.


Volume: Volume 182, Issue 4
Published on: November 18, 2021
Accepted on: September 22, 2021
Submitted on: September 22, 2021
Keywords: Computer Science - Logic in Computer Science,D.2.2,F.3.2,F.4.3


Share

Consultation statistics

This page has been seen 23 times.
This article's PDF has been downloaded 11 times.