%0 Conference Paper %1 conf/concur/TangB17 %A Tang, Qiyi %A van Breugel, Franck %B CONCUR %D 2017 %E Meyer, Roland %E Nestmann, Uwe %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 27:1-27:16 %T Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains. %U http://dblp.uni-trier.de/db/conf/concur/concur2017.html#TangB17 %V 85 %@ 978-3-95977-048-4

@inproceedings{conf/concur/TangB17, added-at = {2020-02-25T00:00:00.000+0100}, author = {Tang, Qiyi and van Breugel, Franck}, biburl = {https://www.bibsonomy.org/bibtex/20764a5ab27d5849b95adf6d718e16597/dblp}, booktitle = {CONCUR}, crossref = {conf/concur/2017}, editor = {Meyer, Roland and Nestmann, Uwe}, ee = {https://doi.org/10.4230/LIPIcs.CONCUR.2017.27}, interhash = {dadcd4c278a126947bbc5568efa21701}, intrahash = {0764a5ab27d5849b95adf6d718e16597}, isbn = {978-3-95977-048-4}, keywords = {dblp}, pages = {27:1-27:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-26T11:57:41.000+0100}, title = {Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains.}, url = {http://dblp.uni-trier.de/db/conf/concur/concur2017.html#TangB17}, volume = 85, year = 2017 }