Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains-Reference-Cited by-同舟云学术

Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains

Published:2018 Issue: Volume: Page:681-699
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Tang Qiyi,van Breugel Franck

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-96145-3_39

Reference31 articles.

1. Aceto, L., Ingolfsdottir, A., Larsen, K., Srba, J.: Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, Cambridge (2003)

2. Lecture Notes in Computer Science;G Bacci,2013

3. Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: On the metric-based approximate minimization of Markov chains. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, Warsaw, Poland, July 2017. Leibniz International Proceedings in Informatics, vol. 80, pp. 104:1–104:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)

4. Lecture Notes in Computer Science;C Baier,1996

5. Bellman, R.: A Markovian decision process. J. Math. Mech. 6(5), 679–684 (1957)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantifying Masking Fault-Tolerance via Fair Stochastic Games;Electronic Proceedings in Theoretical Computer Science;2023-09-14

2. Sound approximate and asymptotic probabilistic bisimulations for PCTL;Logical Methods in Computer Science;2023-03-31

3. A Sound Up-to-$$n,\delta $$ Bisimilarity for PCTL;Lecture Notes in Computer Science;2022

4. COMPUTING PROBABILISTIC BISIMILARITY DISTANCES FOR PROBABILISTIC AUTOMATA;LOG METH COMPUT SCI;2021

5. Deciding probabilistic bisimilarity distance one for probabilistic automata;Journal of Computer and System Sciences;2020-08