A decomposition approach for stochastic reward net models

DOI10.1016/0166-5316(93)90026-QzbMATH Open0788.68105OpenAlexW2681991495MaRDI QIDQ4272467FDOQ4272467

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) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (10)

• Specification techniques for Markov reward models
• From generic partition refinement to weighted tree automata minimization
• 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
• Action and State Based Computation Tree Measurement Language and Algorithms
• A simplified framework for stochastic workflow networks
• Reachability analysis based on structured representations
• Distributed disk-based algorithms for model checking very large Markov chains
• Exploiting interleaving semantics in symbolic state-space generation
• Petri nets for the design and operation of manufacturing systems

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Expected impulse rewards in Markov regenerative stochastic Petri nets 👍 👎
• On the solution of GSPN reward models 👍 👎
• Specification techniques for Markov reward models 👍 👎

This page was built for publication: A decomposition approach for stochastic reward net models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4272467)