Marking optimization of stochastic timed event graphs using IPA
From MaRDI portal
Recommendations
- An improved approach for marking optimization of timed weighted marked graphs
- Some optimization problems for timed marked graphs
- On some LP problems for performance evaluation of timed marked graphs
- scientific article; zbMATH DE number 4189459
- IPA for continuous stochastic marked graphs
- Event-Based Optimization of Markov Systems
- New bounds for timed event graphs inspired by stochastic majorization results
- Superposition properties and performance bounds of stochastic timed-event graphs
- Optimal Control Synthesis of Timed Event Graphs With Interval Model Specifications
- Optimal synchronization of discrete event dynamic systems via timed marked graphs
Cites work
- scientific article; zbMATH DE number 3885030 (Why is no real title available?)
- scientific article; zbMATH DE number 51708 (Why is no real title available?)
- Algebraic structure of some stochastic discrete event systems, with applications
- Comparison properties of stochastic decision free Petri nets
- Cycle time of stochastic event graphs: evaluation and marking optimization
- Estimation of the derivative of a stationary measure with respect to a control parameter
- Marked directed graphs
- Marking optimization of stochastic timed event graphs using IPA
- On a class of stochastic recursive sequences arising in queueing theory
- Optimisation of invariant criteria for event graphs
- Performance evaluation of job-shop systems using timed event-graphs
- Sensitivity analysis and optimization of stochastic Petri nets
- Superposition properties and performance bounds of stochastic timed-event graphs
Cited in
(8)- scientific article; zbMATH DE number 714461 (Why is no real title available?)
- Firing rate optimization of cyclic timed event graphs by token allocations
- Marking optimization of weighted marked graphs
- Optimisation of invariant criteria for event graphs
- An improved approach for marking optimization of timed weighted marked graphs
- An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions
- Asymptotic properties of stochastic timed event graphs
- Marking optimization of stochastic timed event graphs using IPA
This page was built for publication: Marking optimization of stochastic timed event graphs using IPA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563778)