Blocking a transition in a free choice net and what it tells about its throughput.

DOI10.1016/S0022-0000(03)00039-4zbMath1054.68093OpenAlexW1555443399MaRDI QIDQ1401959

Jean Mairesse, Stefan Haar, Bruno Gaujal

Publication date: 19 August 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00039-4

zbMATH Keywords

reachable marking

Mathematics Subject Classification ID

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

Related Items

Optimal stationary behavior for a class of timed continuous Petri nets, Free-choice Nets with Home Clusters are Lucent, Backward coupling in bounded free-choice nets under Markovian and non-Markovian assumptions, Extremal throughputs in free-choice nets, Simplified proof of the blocking theorem for free-choice Petri nets, Reduction using induced subnets to systematically prove properties for free-choice nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability in cyclic extended free-choice systems
• Ergodic theory of stochastic Petri networks
• Recursive equations and basic properties of timed Petri nets
• Ergodicity of Jackson-type queueing networks
• Parallel program schemata
• Free-choice Petri nets-an algebraic approach
• Notes on the stability of closed queueing networks
• Regenerative closed queueing networks
• On closed ring queueing networks
• On Harris Recurrence in Continuous Time
• Products of Irreducible Random Matrices in the (Max, +) Algebra
• Stochastic Petri Nets
• Limit Theorems for Queueing Networks. I
• On the saturation rule for the stability of queues
• Free Choice Petri Nets