Performance evaluation of concurrent systems using Petri nets

DOI10.1016/0020-0190(84)90067-XzbMath0533.68062MaRDI QIDQ789900

Jan Magott

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90067-x

zbMATH Keywords

timed Petri net; lower bound on minimal cycle time; P-invariant nets; timed marked graphs

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Optimal synchronization of discrete event dynamic systems via timed marked graphs, Some optimization problems for timed marked graphs, A resource allocation problem on timed marked graphs: a decomposition approach, Timed event graph-based cyclic reconfigurable flow shop modelling and optimization, Firing rate optimization of cyclic timed event graphs by token allocations, Cycle time of a P-time event graph with affine-interdependent residence durations, Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets, Performance evaluation of concurrent systems using conflict-free and persistent Petri nets, An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions

Cites Work

• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance
• Applying Formal Methods: Testing, Performance, and M/E-Commerce
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item