Title :
A reachable throughput upper bound for live and safe free choice nets via T-invariants
Author :
Basile, Francesco ; Carbone, Ciro ; Chiacchio, Pasquale
Author_Institution :
Dipartimento di Ingegneria Elettrica e dell´Informazione, Università degli Studi di Salerno, Via Ponte Don Melillo 1, 84084, Fisciano (SA), Italy
Abstract :
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.
Keywords :
Manufacturing; Performance evaluation; Petri nets; Routing; Steady-state; Throughput; Upper bound; Free choice nets; T-invariants; net decomposition technique; performance evaluation; throughput upper bound;
Conference_Titel :
European Control Conference (ECC), 2003
Conference_Location :
Cambridge, UK
Print_ISBN :
978-3-9524173-7-9
