Probabilistic weak simulation is decidable in polynomial time
- 14 February 2004
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 89 (3) , 123-130
- https://doi.org/10.1016/j.ipl.2003.10.001
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Optimal state-space lumping in Markov chainsInformation Processing Letters, 2003
- Deciding Bisimilarity and Similarity for Probabilistic ProcessesJournal of Computer and System Sciences, 2000
- Branching time and abstraction in bisimulation semanticsJournal of the ACM, 1996
- Exact and ordinary lumpability in finite Markov chainsJournal of Applied Probability, 1994
- Characterizing finite Kripke structures in propositional temporal logicTheoretical Computer Science, 1988
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987