pdf-format: |
|
@InProceedings{tang_et_al:LIPIcs:2016:6183, author = {Qiyi Tang and Franck van Breugel}, title = {{Computing Probabilistic Bisimilarity Distances via Policy Iteration}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {22:1--22:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Jos{\'e}e Desharnais and Radha Jagadeesan}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6183}, URN = {urn:nbn:de:0030-drops-61837}, doi = {10.4230/LIPIcs.CONCUR.2016.22}, annote = {Keywords: labelled Markov chain, simple stochastic game, probabilistic bisimilarity, pseudometric, value function, policy iteration} }
Keywords: | labelled Markov chain, simple stochastic game, probabilistic bisimilarity, pseudometric, value function, policy iteration | |
Seminar: | 27th International Conference on Concurrency Theory (CONCUR 2016) | |
Issue date: | 2016 | |
Date of publication: | 24.08.2016 |