A Passage-Time Preserving Equivalence for Semi-Markov Processes

Authors:
J. T. Bradley
Affiliations:
-
Venue:
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Year:
2002

Citing 3
Cited 1

The Fourier-series method for inverting transforms of probability distributions

Queueing Systems: Theory and Applications - Numerical computations in queues
A compositional approach to performance modelling

A compositional approach to performance modelling
Extended Markovian Process Algebra

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory

Passage-time computation and aggregation strategies for large semi-Markov processes

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An equivalence for semi-Markov processes is presented which preserves passage-time distributions between pairs of states in a given set. The equivalence is based upon a state-based aggregation procedure which is O(n2) per state in the worst case.