Free-choice Nets with Home Clusters are Lucent

DOI10.3233/FI-2021-2059OpenAlexW3190002971MaRDI QIDQ5158668

Wil M. P. van der Aalst

Publication date: 25 October 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.03554

zbMATH Keywords

Petri netsfree-choice netslucent process models

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

Reduction using induced subnets to systematically prove properties for free-choice nets

Cites Work

• Unnamed Item
• Soundness of workflow nets: classification, decidability, and analysis
• Simplified proof of the blocking theorem for free-choice Petri nets
• Advances in Petri nets 1987. (7th European Workshop on Applications and Theory of Petri Nets, Oxford, Great Britain, June 1986)
• Reachability in live and safe free-choice Petri nets is NP-complete
• Traps characterize home states in free choice systems
• Blocking a transition in a free choice net and what it tells about its throughput.
• Reduction using induced subnets to systematically prove properties for free-choice nets
• Markings in perpetual free-choice nets are fully characterized by their enabled transitions
• Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
• A fresh look at free choice nets
• Free Choice Petri Nets
• Understanding Petri Nets
• Structure Theory of Petri Nets
• Lucent Process Models and Translucent Event Logs

This page was built for publication: Free-choice Nets with Home Clusters are Lucent