On the performance evaluation of multi-guarded marked graphs with single-server semantics

DOI10.1007/s10626-009-0079-2zbMath1200.93099OpenAlexW2124138034WikidataQ56892040 ScholiaQ56892040MaRDI QIDQ708894

Michael Kishinevsky, Jordi Cortadella, Jorge Júlvez

Publication date: 15 October 2010

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/126509

zbMATH Keywords

Petri netsmarked graphsearly evaluationthroughput bounds

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

Elasticity and Petri Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On bounds for bulk arrival queues
• A characterization of the minimum cycle mean in a digraph
• Bounds and Policies for Dynamic Routing in Loss Networks
• A Proof for the Queuing Formula: L = λW
• Performance bounds for queueing networks and scheduling policies
• Differential Petri nets: representing continuous systems in a discrete-event world

This page was built for publication: On the performance evaluation of multi-guarded marked graphs with single-server semantics