Marking optimization of weighted marked graphs
From MaRDI portal
Recommendations
Cited in
(14)- A sufficient condition for the liveness of weighted event graphs
- Minimizing place capacities of weighted event graphs for enforcing liveness
- Quantitative analysis of continuous weighted marked graphs
- Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
- An improved approach for marking optimization of timed weighted marked graphs
- Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex method
- Performance evaluation of marked graphs by linear programming
- Complexity results for weighted timed event graphs
- On some LP problems for performance evaluation of timed marked graphs
- scientific article; zbMATH DE number 714461 (Why is no real title available?)
- Cyclic scheduling for the synthesis of embedded systems
- A resource allocation problem on timed marked graphs: a decomposition approach
- Performance evaluation of nonlinear weighted T-system
- A survey on performance evaluations in time-dependent Petri nets
This page was built for publication: Marking optimization of weighted marked graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404384)