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
Perpetual Free-choice Petri nets are lucent -- proof of a theorem of van der Aalst using CP-exhaustionsArticle

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.

    Comment: Published by Fundamenta Informaticae

    Source: arXiv.org:2109.10002
    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
    Licence: Attribution 4.0 International (CC BY 4.0)

    Share and export

    Consultation statistics

    This page has been seen 276 times.
    This article's PDF has been downloaded 178 times.