Networked conflicting timed event graphs representation in (Max,+) algebra

DOI10.1007/s10626-012-0136-0zbMath1267.93106OpenAlexW2086850367MaRDI QIDQ351734

Boussad Addad, Saïd Amari, Jean-Jacques Lesage

Publication date: 9 July 2013

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

Full work available at URL: https://doi.org/10.1007/s10626-012-0136-0

zbMATH Keywords

conflict(Max, +) algebralinear-time varying systemsrepetitive systemstimed event graph

Mathematics Subject Classification ID

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

Related Items (4)

Analysis and control of max-plus linear discrete-event systems: an introduction ⋮ Algebraic approaches for designing control laws of time-constrained networked conflicting timed event graphs ⋮ Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra ⋮ 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
• Linear periodic systems over dioids
• Throughput-optimal sequences for cyclically operated plants
• Time-invariant representation of discrete periodic systems
• Free-choice Petri nets-an algebraic approach
• Zeros of discrete-time linear periodic systems
• Performance evaluation of job-shop systems using timed event-graphs
• Optimisation of invariant criteria for event graphs
• Modeling and analysis of timed Petri nets using heaps of pieces
• Resource optimization and (min,+) spectral theory
• Idempotent interval analysis and optimization problems

This page was built for publication: Networked conflicting timed event graphs representation in (Max,+) algebra