Some optimization problems for timed marked graphs

DOI10.1080/00207729408949356MaRDI QIDQ4763829zbMATH OpenOpenAlexFDO

Authors

Publication date 17 August 1995

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/00207729408949356

zbMATH Keywords

discrete event dynamic systemstime Petri net

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Recommendations

• An improved approach for marking optimization of timed weighted marked graphs
• On some LP problems for performance evaluation of timed marked graphs
• A resource allocation problem on timed marked graphs: a decomposition approach
• scientific article; zbMATH DE number 714461
• scientific article; zbMATH DE number 3874960
• Near optimum paths in time-table graphs
• scientific article; zbMATH DE number 4189459
• Performance Optimization for Timed Weighted Marked Graphs Under Infinite Server Semantics
• The complexity of optimal design of temporally connected graphs
• Optimizing reachability sets in temporal graphs by delaying

Cites work

• Discrete event systems: models and applications. IIASA conference, Sopron, Hungary, August 3-7, 1987
• Optimisation of invariant criteria for event graphs
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Performance evaluation of concurrent systems using Petri nets
• Performance evaluation of job-shop systems using timed event-graphs
• Performance evaluation of marked graphs by linear programming

Cited in

(19)

• Marking optimization of weighted marked graphs
• Equivalent and efficient optimization models for an industrial discrete event system with alternative structural configurations
• Performance safety enforcement in strongly connected timed event graphs
• An improved approach for marking optimization of timed weighted marked graphs
• Marking optimization of stochastic timed event graphs using IPA
• Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
• scientific article; zbMATH DE number 3874960 (Why is no real title available?)
• Performance evaluation of job-shop systems using timed event-graphs
• Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex method
• Performance evaluation of marked graphs by linear programming
• Optimal synchronization of discrete event dynamic systems via timed marked graphs
• scientific article; zbMATH DE number 563124 (Why is no real title available?)
• Complexity results for weighted timed event graphs
• On some LP problems for performance evaluation of timed marked graphs
• scientific article; zbMATH DE number 1836370 (Why is no real title available?)
• A resource allocation problem on timed marked graphs: a decomposition approach
• Formal Modeling and Analysis of Timed Systems
• scientific article; zbMATH DE number 4189459 (Why is no real title available?)
• Firing rate optimization of cyclic timed event graphs by token allocations

This page was built for publication: Some optimization problems for timed marked graphs

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