From Extremal Trajectories to Token Deaths in P-time Event Graphs

DOI10.1109/TAC.2010.2091297MaRDI QIDQ5347629zbMATH OpenFDO

Authors Philippe Declerck

Publication date 25 August 2017

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

Full work available at URL https://doi.org/10.1109/TAC.2010.2091297

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(5)

• Analysis and control of max-plus linear discrete-event systems: an introduction
• Predictive control of timed event graphs with specifications defined by P-time event graphs
• Cycle time of a P-time event graph with affine-interdependent residence durations
• Two-staged approach for estimation of sequences in partially observable P-time Petri nets on a sliding horizon with schedulability analysis
• Infinite precedence graphs for consistency verification in P-time event graphs

This page was built for publication: From Extremal Trajectories to Token Deaths in P-time Event Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347629)