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

In a live and bounded free choice Petri net, pick a non-conflicting transition. Then there exists a unique reachable marking in which no transition is enabled except the selected one. For a routed live and bounded free choice net, this property is true for any transition of the net. Consider now a l...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer and system sciences 2003, Vol.66 (3), p.515-548
Main Authors: Gaujal, Bruno, Haar, Stefan, Mairesse, Jean
Format: Article
Language:English
Subjects:
Computer Science
Other
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a live and bounded free choice Petri net, pick a non-conflicting transition. Then there exists a unique reachable marking in which no transition is enabled except the selected one. For a routed live and bounded free choice net, this property is true for any transition of the net. Consider now a live and bounded stochastic routed free choice net, and assume that the routings and the firing times are independent and identically distributed. Using the above results, we prove the existence of asymptotic firing throughputs for all transitions in the net. Furthermore, the vector of the throughputs at the different transitions is explicitly computable up to a multiplicative constant.
ISSN:0022-0000
1090-2724
DOI:10.1016/S0022-0000(03)00039-4