Upper and lower bounds for stochastic marked graphs

DOI10.1016/0020-0190(94)90102-3zbMath0835.68085OpenAlexW2080077417MaRDI QIDQ1321817

Sergio Rajsbaum

Publication date: 16 April 1996

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90102-3

zbMATH Keywords

performance evaluationPetri netsrecurrence relationsdistributed computingstochastic marked graphs

Mathematics Subject Classification ID

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

Related Items (2)

On the performance of a retransmission-based synchronizer ⋮ Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss

Cites Work

• Unnamed Item
• A characterization of the minimum cycle mean in a digraph
• Marked directed graphs
• A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
• Complexity of network synchronization
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Unison, canon, and sluggish clocks in networks controlled by a synchronizer
• Scheduling Parallel Computations

This page was built for publication: Upper and lower bounds for stochastic marked graphs