Perpetual Free-choice Petri nets are lucent - proof of a theorem of van der Aalst using CP-exhaustions.
Joachim WehlerPublished in: CoRR (2021)
Keyphrases
- petri net
- van der
- interactive theorem proving
- petri net model
- discrete event systems
- manufacturing systems
- high level petri nets
- constraint programming
- colored petri nets
- fuzzy petri net
- ims ld
- service composition
- stochastic petri net
- process model
- discrete dynamical systems
- programmable logic controller
- sequence diagrams
- state machines
- concurrent systems
- constraint satisfaction problems