Wehler, Joachim
(2021):
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions.
In: Fundamenta Informaticae, Vol. 182, No. 3: pp. 363-393
DOI: 10.3233/FI-2021-2078
Abstract
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.
| Item Type: | Journal article |
|---|---|
| Faculties: | Mathematics, Computer Science and Statistics > Computer Science |
| Subjects: | 000 Computer science, information and general works > 004 Data processing computer science |
| ISSN: | 0169-2968 |
| Language: | English |
| Item ID: | 102978 |
| Date Deposited: | 05. Jun 2023, 15:41 |
| Last Modified: | 05. Jun 2023, 15:41 |
Actions (login required)
- View Item
