Compositionality for Markov Reward Chains With Fast and Silent Transitions

Performance Evaluation - Netherlands
doi 10.1016/j.peva.2009.01.001
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Distributions of Reward Functions on Continuous-Time Markov Chains

2002English

Occupation Times for Markov and Semi-Markov Chains

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1962English

Entropy Sensitivity of Languages Defined by Infinite Automata, via Markov Chains With Forbidden Transitions

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2010English

Undecidability Results for Timed Automata With Silent Transitions

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Representing Markov Chains With Transition Diagrams

Journal of Mathematics and Statistics
MathematicsStatisticsProbability
2013English

Two New Algorithms to Compute Steady-State Bounds for Markov Models With Slow Forward and Fast Backward Transitions

English

Segregating Markov Chains

Journal of Theoretical Probability
MathematicsStatisticsUncertaintyProbability
2017English

Boundary Theory for Recurrent Markov Chains

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1963English

Additive Schwarz Iterations for Markov Chains

SIAM Journal on Matrix Analysis and Applications
Analysis
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy