Performance evaluation of concurrent systems using Petri nets

DOI10.1016/0020-0190(84)90067-XMaRDI QIDQ789900zbMATH OpenOpenAlexFDO

Authors 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

lower bound on minimal cycle timeP-invariant netstimed marked graphstimed Petri net

Mathematics Subject Classification ID

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

Review text

The author gives a new lower bound on minimal cycle time (which is better than the pevious one) of a P-invariant timed Petri net. For non-P- invariant Petri nets he shows the existence of equivalent (with respect to minimal cycle time) P-invariant Petri nets.

Recommendations

• New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets
• Performance evaluation of concurrent systems using conflict-free and persistent Petri nets
• Generalized M-Timed Petri Nets And Performance Evaluation Of Computer Systems
• Performance bounds for stochastic timed Petri nets
• scientific article; zbMATH DE number 836620

Cites work

• Applying Formal Methods: Testing, Performance, and M/E-Commerce
• scientific article; zbMATH DE number 3688732 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3622958 (Why is no real title available?)
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance

Cited in

(18)

• 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
• Performance analysis using Petri nets
• Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
• An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions
• scientific article; zbMATH DE number 1629917 (Why is no real title available?)
• New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets
• scientific article; zbMATH DE number 4106272 (Why is no real title available?)
• Optimal synchronization of discrete event dynamic systems via timed marked graphs
• scientific article; zbMATH DE number 980230 (Why is no real title available?)
• scientific article; zbMATH DE number 1760112 (Why is no real title available?)
• Some optimization problems for timed marked graphs
• Cycle time of a P-time event graph with affine-interdependent residence durations
• scientific article; zbMATH DE number 2104633 (Why is no real title available?)
• A resource allocation problem on timed marked graphs: a decomposition approach
• Performance evaluation of Petri nets centralized implementation. The execution time controller
• Timed event graph-based cyclic reconfigurable flow shop modelling and optimization
• Firing rate optimization of cyclic timed event graphs by token allocations

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

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