Extremal throughputs in free-choice nets

DOI10.1007/s10626-006-9326-yzbMath1306.93053OpenAlexW1982286625MaRDI QIDQ2256881

Jean Mairesse, Anne Bouillard, Bruno Gaujal

Publication date: 23 February 2015

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

Full work available at URL: https://doi.org/10.1007/s10626-006-9326-y

zbMATH Keywords

throughputfree-choice Petri netstimed and routed nets

Mathematics Subject Classification ID

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

Related Items (1)

Backward coupling in bounded free-choice nets under Markovian and non-Markovian assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Blocking a transition in a free choice net and what it tells about its throughput.
• Optimal stationary behavior for a class of timed continuous Petri nets
• A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
• Modeling and analysis of timed Petri nets using heaps of pieces
• Free Choice Petri Nets
• Applications and Theory of Petri Nets 2005
• Asymptotic behavior in a heap model with two pieces

This page was built for publication: Extremal throughputs in free-choice nets