An approach to formalize structural decomposition and aggregation for stochastic reward net models

Authors:
M. Tilgner
Affiliations:
-
Venue:
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Year:
1995

Citing 5
Cited 0

A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems

ACM Transactions on Computer Systems (TOCS)
Manufacturing flow line systems: a review of models and analytical results

Queueing Systems: Theory and Applications - Special issue on queueing models of manufacturing systems
A decomposition approach for stochastic reward net models

Performance Evaluation
SPNP: Stochastic Petri Net Package

PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
The box calculus: a new causal algebra with multi-label communication

Advances in Petri Nets 1992, The DEMON Project

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents an approach to formalize decomposition and aggregation of stochastic reward nets based on their structure. The set of places and transitions are automatically partitioned. Sets of these partitions are aggregated. Partial and full aggregates are built for an iterative scheme to calculate approximately stochastic rewards. In other words, approximate performance evaluation is fully automated for any live, bounded and reversible stochastic reward net as far as at least one aggregable partition is formed. The technique is applied to the analysis of a flexible manufacturing system.