Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra

DOI10.1007/s10626-015-0220-3zbMath1357.93061OpenAlexW2235968939MaRDI QIDQ513811

Yong-Cai Geng, Sumit K. Garg

Publication date: 8 March 2017

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

Full work available at URL: https://doi.org/10.1007/s10626-015-0220-3

zbMATH Keywords

cycle timetimed event graph(Max,+) algebraconflicting timed event graphsresources sharing

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Max-plus and related algebras (15A80)

Related Items (2)

Algebraic approaches for designing control laws of time-constrained networked conflicting timed event graphs ⋮ Modelling and feedback control for a class of Petri Nets with shared resources subject to strict time constraints using Max-plus algebra

Cites Work

• Unnamed Item
• Networked conflicting timed event graphs representation in (Max,+) algebra
• Linear periodic systems over dioids
• Just in time control of constrained \((max,+)\)-linear systems
• Performance evaluation of job-shop systems using timed event-graphs
• Modeling and analysis of timed Petri nets using heaps of pieces
• Synthesis of greatest linear feedback for timed-event graphs in dioid
• Max-Plus Control Design for Temporal Constraints Meeting in Timed Event Graphs

This page was built for publication: Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra