Comparative branching-time semantics for Markov chains
- 1 August 2005
- journal article
- Published by Elsevier in Information and Computation
- Vol. 200 (2) , 149-214
- https://doi.org/10.1016/j.ic.2005.03.001
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Probabilistic weak simulation is decidable in polynomial timeInformation Processing Letters, 2004
- Model-checking algorithms for continuous-time markov chainsIEEE Transactions on Software Engineering, 2003
- The existence of refinement mappingsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Comparative Branching-Time Semantics for Markov ChainsPublished by Springer Nature ,2003
- Abstraction in Probabilistic Process AlgebraPublished by Springer Nature ,2001
- Model-checking continuous-time Markov chainsACM Transactions on Computational Logic, 2000
- Deciding Bisimilarity and Similarity for Probabilistic ProcessesJournal of Computer and System Sciences, 2000
- Weak bisimulation for fully probabilistic processesPublished by Springer Nature ,1997
- Temporal logics for the specification of performance and reliabilityPublished by Springer Nature ,1997
- It usually works: The temporal logic of stochastic systemsPublished by Springer Nature ,1995