Abstract
Stochastic Automata Networks (SANs) are an efficient means to describe and analyze parallel systems under Markovian assumptions. The main advantage of SANs is the possibility to describe and analyze a complex parallel system in a compositional way such that the transition matrix of the Markov chain underlying the complete SAN can be described in a compositional way using only small matrices specifying single automata and combine these matrices by means of tensor operations. This approach allows, up to a certain extent, the handling of the state space explosion resulting from complex Markov models. In this paper equivalence relations for stochastic automata are introduced such that an automaton in a network can be substituted by an equivalent and usually smaller automaton without affecting the results of an analysis. We consider equivalence according to stationary and transient analysis of SANs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Buchholz; The Aggregation of Markovian Submodels in Isolation; Univ. Dortmund, Fachbereich Informatik, Forschungsbericht Nr. 369, 1990.
P. Buchholz; Hierarchical Markovian Models, Symmetries and Aggregation; In: J. Hillston, R. Pooley (eds.), Comp. Perf. Eval. 92, Edinburgh University Press (1993) 305–320.
P. Buchholz; Exact and Ordinary Lumpability in Finite Markov Chains; Journ. of Appl. Prob. 31 (1994) 59–75.
P. Buchholz; A Notion of Equivalence for Stochastic Petri Nets; submitted for publication.
M. Davio; Kronecker Products and Shuffle Algebra; IEEE Trans. on Comp. 30 (1981) 116–125.
D. Gross, D.R. Miller; The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes; Oper. Res. 32 (1984) 343–361.
B. R. Haverkort, K.S. Trivedi; Specification Techniques for Markov Reward Models; Discrete Event Systems: Theory and Application 3 (1993) 219–247.
J.G. Kemeny, J.L. Snell; Finite Markov Chains; Springer New York, Heidelberg, Berlin 1976.
R. Milner; Communication and Concurrency; Prentice Hall 1989.
V. Nicola; Lum** in Markov Reward Processes; Research Report RC14719, IBM Yorktown Heights (1989).
B. Plateau, K. Atif; Stochastic Automata Networks for Modeling Parallel Systems; IEEE Trans. on Softw. Eng. 17 (1991) 1093–1108.
B. Plateau, J.M. Fourneau; A Methodology for Solving Markov Models of Parallel Systems; Journ. of Paral. and Distr. Comp. 12 (1991).
M. Siegle; Structured Markovian Performance Modelling with Automatic Symmetry Exploitation; In: G. Haring, K. Kotsis (eds.) Comp. Perf. Eval. 94, Mod. Techn. and Tools, Springer LNCS 794 (1994).
U. Sumita, M. Riders; Lumpability and time reversibility in the aggregation-disaggregation method for large Markov chains; Commun. Statist. - Stoch. Models 5 (1989) 63–81.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this paper
Cite this paper
Buchholz, P. (1995). Equivalence Relations for Stochastic Automata Networks. In: Stewart, W.J. (eds) Computations with Markov Chains. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2241-6_13
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2241-6_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5943-2
Online ISBN: 978-1-4615-2241-6
eBook Packages: Springer Book Archive