Performance evaluation of concurrent systems using Petri nets

DOI10.1016/0020-0190(84)90067-XzbMath0533.68062OpenAlexW1974229901MaRDI 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 netlower bound on minimal cycle timeP-invariant netstimed marked graphs

Mathematics Subject Classification ID

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

Related Items (9)

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

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

This page was built for publication: Performance evaluation of concurrent systems using Petri nets