Properties and performance bounds for timed marked graphs

DOI10.1109/81.139289zbMath0825.68234OpenAlexW2153102532MaRDI QIDQ4017665

Javier Campos, José-Manuel Colom, Giovanni Chiola, Manuel Silva

Publication date: 16 January 1993

Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions ⋮ Petri nets for the design and operation of manufacturing systems ⋮ Performance safety enforcement in stochastic event graphs against boost and slow attacks ⋮ Design and verification of pipelined circuits with timed Petri nets ⋮ Cyclic scheduling for F.M.S.: Modelling and evolutionary solving approach ⋮ Cycle time of a P-time event graph with affine-interdependent residence durations ⋮ Steady-state performance evaluation of continuous mono-T-semiflow Petri nets ⋮ Performance safety enforcement in strongly connected timed event graphs ⋮ Firing rate optimization of cyclic timed event graphs by token allocations ⋮ Timed event graph-based cyclic reconfigurable flow shop modelling and optimization ⋮ Timed Petri nets with reset for pipelined synchronous circuit design

This page was built for publication: Properties and performance bounds for timed marked graphs