pdf-format: |
|
@InProceedings{tang_et_al:LIPIcs:2017:7798, author = {Qiyi Tang and Franck van Breugel}, title = {{Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-048-4}, ISSN = {1868-8969}, year = {2017}, volume = {85}, editor = {Roland Meyer and Uwe Nestmann}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7798}, URN = {urn:nbn:de:0030-drops-77983}, doi = {10.4230/LIPIcs.CONCUR.2017.27}, annote = {Keywords: labelled Markov chain, probabilistic bisimilarity, pseudometric, policy iteration} }
Keywords: | labelled Markov chain, probabilistic bisimilarity, pseudometric, policy iteration | |
Seminar: | 28th International Conference on Concurrency Theory (CONCUR 2017) | |
Issue date: | 2017 | |
Date of publication: | 01.09.2017 |