Networked conflicting timed event graphs representation in (Max,+) algebra
From MaRDI portal
Publication:351734
DOI10.1007/S10626-012-0136-0zbMATH Open1267.93106OpenAlexW2086850367MaRDI QIDQ351734FDOQ351734
Authors: 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
Recommendations
- 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
- Algebraic approaches for designing control laws of time-constrained networked conflicting timed event graphs
- Modelling and control of periodic time-variant event graphs in dioids
- scientific article; zbMATH DE number 1975659
Cites Work
- Title not available (Why is that?)
- Resource optimization and (min,+) spectral theory
- Modeling and analysis of timed Petri nets using heaps of pieces
- Performance evaluation of job-shop systems using timed event-graphs
- Idempotent interval analysis and optimization problems
- Time-invariant representation of discrete periodic systems
- Free-choice Petri nets-an algebraic approach
- Zeros of discrete-time linear periodic systems
- Optimisation of invariant criteria for event graphs
- Linear periodic systems over dioids
- Throughput-optimal sequences for cyclically operated plants
Cited In (12)
- Title not available (Why is that?)
- Modeling and control of drug assignment for pharmaceutical cabinets using discrete event systems approaches
- Modelling and feedback control for a class of Petri nets with shared resources subject to strict time constraints using max-plus algebra
- Max-plus algebraic description of evolutions of weighted timed event graphs
- An algebraic model for performance evaluation of timed event multigraphs
- Failure detection and localization for timed event graphs in \((\max,+)\)-algebra
- Analysis and control of max-plus linear discrete-event systems: an introduction
- Design of control laws for timed event graphs networks subject to mutual exclusion constraints in min-plus algebra
- Algebraic approaches for designing control laws of time-constrained networked conflicting timed event graphs
- Performance evaluation of nonlinear weighted T-system
- Analysis of P-time event graphs in (max,+) and (min,+) semirings
- Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra
This page was built for publication: Networked conflicting timed event graphs representation in (Max,+) algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q351734)