A decomposition approach for stochastic reward net models

DOI10.1016/0166-5316(93)90026-QzbMath0788.68105OpenAlexW2681991495MaRDI QIDQ4272467

Kishor S. Trivedi, Gianfranco Ciardo

Publication date: 9 June 1994

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(93)90026-q

zbMATH Keywords

stochastic Petri netsreward processesnear-decomposability

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items

Exploiting interleaving semantics in symbolic state-space generation, A simplified framework for stochastic workflow networks, Petri nets for the design and operation of manufacturing systems, Action and State Based Computation Tree Measurement Language and Algorithms, Distributed disk-based algorithms for model checking very large Markov chains, Reachability analysis based on structured representations, From generic partition refinement to weighted tree automata minimization, Specification techniques for Markov reward models, Stochastic Petri net models of \(\text{Ca}^{2+}\) signaling complexes and their analysis, Two-layer symbolic representation for stochastic models with phase-type distributed events