Performance evaluation of marked graphs by linear programming

DOI10.1080/00207729108910729zbMath0741.90085OpenAlexW2092556540MaRDI QIDQ3982050

Takeo Yamada, Susumu Morioka

Publication date: 26 June 1992

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729108910729

zbMATH Keywords

performance evaluationPetri netsdiscrete event dynamic systemsmarket graphslinear algebraic characterization for directed cycles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05)

Related Items (4)

Optimal synchronization of discrete event dynamic systems via timed marked graphs ⋮ A resource allocation problem on timed marked graphs: a decomposition approach ⋮ Firing rate optimization of cyclic timed event graphs by token allocations ⋮ Some optimization problems for timed marked graphs

Cites Work

• A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
• Performance evaluation of job-shop systems using timed event-graphs
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Enumeration of the Elementary Circuits of a Directed Graph

This page was built for publication: Performance evaluation of marked graphs by linear programming