Performance evaluation of marked graphs by linear programming

DOI10.1080/00207729108910729MaRDI QIDQ3982050zbMATH OpenOpenAlexFDO

Authors Susumu Morioka, Takeo Yamada

Publication date 26 June 1992

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

zbMATH Keywords

discrete event dynamic systemslinear algebraic characterization for directed cyclesmarket graphsperformance evaluationPetri nets

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 714461
• On some LP problems for performance evaluation of timed marked graphs
• Marking optimization of weighted marked graphs
• An improved approach for marking optimization of timed weighted marked graphs
• Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex method
• Some optimization problems for timed marked graphs
• scientific article; zbMATH DE number 714460
• scientific article; zbMATH DE number 836621
• Approximate throughput computation of stochastic marked graphs

Cites work

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

Cited in

(7)

• An improved approach for marking optimization of timed weighted marked graphs
• Optimal synchronization of discrete event dynamic systems via timed marked graphs
• On some LP problems for performance evaluation of timed marked graphs
• Some optimization problems for 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
• On the performance evaluation of multi-guarded marked graphs with single-server semantics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982050)