An algebraic model for performance evaluation of timed event multigraphs

DOI10.1109/TAC.2003.814266zbMATH Open1364.93458OpenAlexW2076708935MaRDI QIDQ5266800FDOQ5266800

Authors: Huaping Dai, Youxian Sun 

Publication date: 20 June 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2003.814266

Recommendations

• scientific article; zbMATH DE number 4189459
• Networked conflicting timed event graphs representation in (Max,+) algebra
• Timed-event graphs with multipliers and homogeneous min-plus systems
• Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra
• Performance evaluation of job-shop systems using timed event-graphs
• Complexity results for weighted timed event graphs
• Superposition properties and performance bounds of stochastic timed-event graphs
• Performance safety enforcement in strongly connected timed event graphs
• A Graph-Theoretic Approach for Timing Analysis and its Implementation

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Algebraic methods (93B25)

Cited In (2)

• Title not available (Why is that?)
• Analysis of P-time event graphs in (max,+) and (min,+) semirings

This page was built for publication: An algebraic model for performance evaluation of timed event multigraphs

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