Blocking a transition in a free choice net and what it tells about its throughput.
type: Item
instance of: scholarly article
title: Blocking a transition in a free choice net and what it tells about its throughput.
zbMATH Open document ID: 1054.68093
DOI: 10.1016/S0022-0000(03)00039-4
author: Bruno Gaujal
author: Stefan Haar
author: Jean Mairesse
published in: Journal of Computer and System Sciences
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1967145
zbMATH Keywords: reachable marking
MaRDI profile type: Publication
cites work: Q4835250
cites work: Ergodic theory of stochastic Petri networks
cites work: Recursive equations and basic properties of timed Petri nets
cites work: Q4304869
cites work: Ergodicity of Jackson-type queueing networks
cites work: On the saturation rule for the stability of queues
cites work: Free-choice Petri nets-an algebraic approach
cites work: Q4894814
cites work: Q4395219
cites work: On closed ring queueing networks
cites work: Q4331878
cites work: Q3943082
cites work: Limit Theorems for Queueing Networks. I
cites work: Reachability in cyclic extended free-choice systems
cites work: Free Choice Petri Nets
cites work: Q4782042
cites work: Stochastic Petri Nets
cites work: Parallel program schemata
cites work: Regenerative closed queueing networks
cites work: On Harris Recurrence in Continuous Time
cites work: Products of Irreducible Random Matrices in the (Max, +) Algebra
cites work: Notes on the stability of closed queueing networks
cites work: Q4843010
full work available at URL: s0022-0000(03)00039-4
OpenAlex ID: W1555443399
Recommended article: Blocking probabilities in large circuit-switched networks
Recommended article: Extremal throughputs in free-choice nets
Recommended article: Applications and Theory of Petri Nets 2005
Recommended article: A Tight Bound on the Throughput of Queueing Networks with Blocking
Recommended article: Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints
Recommended article: Insensitivity of blocking probabilities in a circuit-switching network
Recommended article: Blocking in Fully Connected Networks of Arbitrary Size
Recommended article: Blocking Probability in a Switching Center With Arbitrary Routing Policy
Recommended article: Q4945036
description: scientific article; zbMATH DE number 1967145