An improved approach for marking optimization of timed weighted marked graphs

DOI10.1007/s10626-019-00278-wzbMath1439.90072OpenAlexW2915640291WikidataQ128362437 ScholiaQ128362437MaRDI QIDQ2286328

Alessandro Giua, Miao Liu, Zhiwu Li, Ziyue Ma, Zhou He

Publication date: 22 January 2020

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

Full work available at URL: https://doi.org/10.1007/s10626-019-00278-w

zbMATH Keywords

linear programmingtimed Petri netsweighted marked graphsmarking optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Uses Software

• HYPENS
• Gurobi

Cites Work

• Unnamed Item
• Complexity results for weighted timed event graphs
• Control of discrete-event systems. Automata and Petri net perspectives
• Deadlock and liveness characterization for a class of generalized Petri nets
• Marking optimization of weighted marked graphs
• Periodic scheduling of marked graphs using balanced binary words
• Current-state opacity enforcement in discrete event systems under incomparable observations
• On the Equivalence of Observation Structures for Petri Net Generators
• Design of Optimal Petri Net Controllers for Disjunctive Generalized Mutual Exclusion Constraints
• Modeling and Control of Weight-Balanced Timed Event Graphs in Dioids
• HYPENS: A Matlab Tool for Timed Discrete, Continuous and Hybrid Petri Nets
• Performance Optimization for Timed Weighted Marked Graphs Under Infinite Server Semantics
• Characterization of Admissible Marking Sets in Petri Nets With Conflicts and Synchronizations
• Firing rate optimization of cyclic timed event graphs by token allocations

This page was built for publication: An improved approach for marking optimization of timed weighted marked graphs