Performance Optimization for Timed Weighted Marked Graphs Under Infinite Server Semantics

DOI10.1109/TAC.2017.2766202zbMath1423.90078OpenAlexW2767138686MaRDI QIDQ4682306

Zhiwu Li, Zhou He, Alessandro Giua

Publication date: 18 September 2018

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2017.2766202

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Production models (90B30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

An approach for enforcing a class of GMECs on time Petri nets with uncontrollable transitions ⋮ An improved approach for marking optimization of timed weighted marked graphs

This page was built for publication: Performance Optimization for Timed Weighted Marked Graphs Under Infinite Server Semantics