Free-choice Nets with Home Clusters are Lucent
From MaRDI portal
Publication:5158668
Recommendations
- Extremal throughputs in free-choice nets
- Applications and Theory of Petri Nets 2005
- A fresh look at free choice nets
- DECENTRALIZED PACKET CLUSTERING IN ROUTER-BASED NETWORKS
- scientific article; zbMATH DE number 3974311
- On Uniformly Optimal Networks: A Reversal of Fortune?
- Analysis of finite-source cluster networks
- On optimal random nets
- An optimal family of directed, bounded-degree broadcast networks
- Homogeneity and \(\pi\)-networks
Cites work
- A fresh look at free choice nets
- Advances in Petri nets 1987. (7th European Workshop on Applications and Theory of Petri Nets, Oxford, Great Britain, June 1986)
- Blocking a transition in a free choice net and what it tells about its throughput.
- Free Choice Petri Nets
- Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
- Lucent process models and translucent event logs
- Markings in perpetual free-choice nets are fully characterized by their enabled transitions
- Modeling business processes. A Petri net-oriented approach
- Reachability in live and safe free-choice Petri nets is NP-complete
- Reduction using induced subnets to systematically prove properties for free-choice nets
- Simplified proof of the blocking theorem for free-choice Petri nets
- Soundness of workflow nets: classification, decidability, and analysis
- Structure theory of Petri nets
- Traps characterize home states in free choice systems
- Understanding Petri Nets
Cited in
(2)
This page was built for publication: Free-choice Nets with Home Clusters are Lucent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158668)
