A reachable throughput upper bound for live and safe free choice nets via T-invariants
Francesco Basile, Ciro Carbone, Pasquale Chiacchio · 2003
This paper focuses on the problem of computing a reachable upper bound for the throughput of transitions in live and safe free choice nets. Starting from the consideration that a live a safe free choice net can be viewed as an interconnection of live and safe marked graphs, previous results on the throughput upper bound computation for marked graphs are extended to live and safe free choice net case. We propose a decomposition in terms of marked graph components induced by minimal T-invariants in order to compute a reachable throughput upper bound for a live and safe free choice net. Such bound is expressed as linear combination of throughput upper bounds of the marked graph components induced by minimal T-invariants.