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

DOI10.1016/S0022-0000(03)00039-4MaRDI QIDQ1401959zbMATH OpenOpenAlexFDO

Authors Bruno Gaujal, Stefan Haar, Jean Mairesse

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)

Recommendations

• Blocking probabilities in large circuit-switched networks
• Extremal throughputs in free-choice nets
• Applications and Theory of Petri Nets 2005
• A tight bound on the throughput of queueing networks with blocking
• Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints
• Insensitivity of blocking probabilities in a circuit-switching network
• Blocking in Fully Connected Networks of Arbitrary Size
• Blocking Probability in a Switching Center With Arbitrary Routing Policy
• scientific article; zbMATH DE number 1420964

Cites work

• Ergodic theory of stochastic Petri networks
• Ergodicity of Jackson-type queueing networks
• Free Choice Petri Nets
• Free-choice Petri nets-an algebraic approach
• scientific article; zbMATH DE number 3760340 (Why is no real title available?)
• scientific article; zbMATH DE number 627763 (Why is no real title available?)
• scientific article; zbMATH DE number 977553 (Why is no real title available?)
• scientific article; zbMATH DE number 1163643 (Why is no real title available?)
• scientific article; zbMATH DE number 1836371 (Why is no real title available?)
• scientific article; zbMATH DE number 763717 (Why is no real title available?)
• scientific article; zbMATH DE number 786529 (Why is no real title available?)
• scientific article; zbMATH DE number 932436 (Why is no real title available?)
• Limit Theorems for Queueing Networks. I
• Notes on the stability of closed queueing networks
• On closed ring queueing networks
• On Harris Recurrence in Continuous Time
• On the saturation rule for the stability of queues
• Parallel program schemata
• Products of Irreducible Random Matrices in the (Max, +) Algebra
• Reachability in cyclic extended free-choice systems
• Recursive equations and basic properties of timed Petri nets
• Regenerative closed queueing networks
• Stochastic Petri Nets

Cited in

(9)

• Optimal stationary behavior for a class of timed continuous Petri nets
• Reduction using induced subnets to systematically prove properties for free-choice nets
• Extremal throughputs in free-choice nets
• scientific article; zbMATH DE number 714459 (Why is no real title available?)
• scientific article; zbMATH DE number 744091 (Why is no real title available?)
• Free-choice Nets with Home Clusters are Lucent
• Applications and Theory of Petri Nets 2005
• Backward coupling in bounded free-choice nets under Markovian and non-Markovian assumptions
• Simplified proof of the blocking theorem for free-choice Petri nets

This page was built for publication: Blocking a transition in a free choice net and what it tells about its throughput.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401959)