Markings in perpetual free-choice nets are fully characterized by their enabled transitions

DOI10.1007/978-3-319-91268-4_16zbMath1427.68215arXiv1801.04315OpenAlexW2964038383MaRDI QIDQ2280193

Wil M. P. van der Aalst

Publication date: 18 December 2019

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks ⋮ Free-choice Nets with Home Clusters are Lucent ⋮ Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions ⋮ Reduction using induced subnets to systematically prove properties for free-choice nets

This page was built for publication: Markings in perpetual free-choice nets are fully characterized by their enabled transitions