Upper and lower bounds for stochastic marked graphs
type: Item
instance of: scholarly article
title: Upper and lower bounds for stochastic marked graphs
zbMATH Open document ID: 0835.68085
DOI: 10.1016/0020-0190(94)90102-3
author: Sergio Rajsbaum
published in: Information Processing Letters
publication date: 1996-04-16T00:00:00Z
review text: A form of recurrence relations is used to derive efficiently computable bounds on the rate of strongly connected SMGS (stochastic marked graphs).
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 561599
zbMATH Keywords: stochastic marked graphs
zbMATH Keywords: Petri nets
zbMATH Keywords: distributed computing
zbMATH Keywords: performance evaluation
zbMATH Keywords: recurrence relations
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90102-3
OpenAlex ID: W2080077417
cites work: Complexity of network synchronization
cites work: Q4001523
cites work: A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
cites work: Marked directed graphs
cites work: Unison, canon, and sluggish clocks in networks controlled by a synchronizer
cites work: A characterization of the minimum cycle mean in a digraph
cites work: Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
cites work: Scheduling Parallel Computations
description: scientific article; zbMATH DE number 561599