A fresh look at free choice nets

DOI10.1016/S0019-9958(84)80052-2zbMath0589.68044MaRDI QIDQ3718162

No author found.

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

distributed systemsPetri netsconcurrencylive and safe free choice netsLSFC nets

Mathematics Subject Classification ID

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

Related Items (10)

PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets ⋮ Partial order behaviour and structure of Petri nets ⋮ Some behavioural aspects of net theory ⋮ {SC}*ECS: A class of modular and hierarchical cooperating systems ⋮ Structure theory of equal conflict systems ⋮ \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems ⋮ Free-choice Nets with Home Clusters are Lucent ⋮ Kleene Theorems for Product Systems ⋮ 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: A fresh look at free choice nets