Zobrazeno 1 - 10
of 48
pro vyhledávání: '"van Breugel, Franck"'
Autor:
Bacci, Giorgio, Bacci, Giovanni, Larsen, Kim G., Mardare, Radu, Tang, Qiyi, van Breugel, Franck
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 1 (February 2, 2021) lmcs:5994
The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic automata. In this paper, we present a characterization of the bisimila
Externí odkaz:
http://arxiv.org/abs/1907.01768
Publikováno v:
EPTCS 85, 2012, pp. 33-47
Recently, Zhang and Van Breugel introduced the notion of a progress measure for a probabilistic model checker. Given a linear-time property P and a description of the part of the system that has already been checked, the progress measure returns a re
Externí odkaz:
http://arxiv.org/abs/1207.0870
Publikováno v:
Logical Methods in Computer Science, Volume 4, Issue 2 (April 9, 2008) lmcs:822
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue of probabilistic bisimilarity. Distance zero captures probabilistic bi
Externí odkaz:
http://arxiv.org/abs/0803.3796
Autor:
Bacci, Giorgio, Bacci, Giovanni, Larsen, Kim G., Mardare, Radu, Tang, Qiyi, Van Breugel, Franck
Publikováno v:
Bacci, G, Bacci, G, Larsen, K G, Mardare, R, Tang, Q & van Breugel, F 2021, ' Computing Probabilistic Bisimilarity Distances for Probabilistic Automata ', Logical Methods in Computer Science, vol. 17, no. 1, 9, pp. 1-36 . https://doi.org/10.23638/LMCS-17(1:9)2021
Bacci, G, Bacci, G, Larsen, K G, Mardare, R, Tang, Q & van Breugel, F 2019, Computing Probabilistic Bisimilarity Distances for Probabilistic Automata . in W Fokkink & R van Glabbeek (eds), 30th International Conference on Concurrency Theory (CONCUR 2019) ., 9, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik GmbH, Leibniz International Proceedings in Informatics, vol. 140, pp. 9:1-9:17, 30th International Conference on Concurrency Theory, Amsterdam, Netherlands, 26/08/2019 . https://doi.org/10.4230/LIPIcs.CONCUR.2019.9
30th International Conference on Concurrency Theory (CONCUR 2019)
Logic in Computer Science
Bacci, G, Bacci, G, Larsen, K G, Mardare, R, Tang, Q & van Breugel, F 2019, Computing Probabilistic Bisimilarity Distances for Probabilistic Automata . in W Fokkink & R van Glabbeek (eds), 30th International Conference on Concurrency Theory (CONCUR 2019) ., 9, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik GmbH, Leibniz International Proceedings in Informatics, vol. 140, pp. 9:1-9:17, 30th International Conference on Concurrency Theory, Amsterdam, Netherlands, 26/08/2019 . https://doi.org/10.4230/LIPIcs.CONCUR.2019.9
30th International Conference on Concurrency Theory (CONCUR 2019)
Logic in Computer Science
Logical Methods in Computer Science ; Volume 17, Issue 1 ; 1860-5974
The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilis
The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b716ca1306bd3bd855afd4275013220c
Publikováno v:
In Theoretical Computer Science 2007 380(1):143-163
Autor:
van Breugel, Franck, Worrell, James
Publikováno v:
In Theoretical Computer Science 2006 360(1):373-385
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Theoretical Computer Science 2005 333(1):171-197
Autor:
van Breugel, Franck, Worrell, James *
Publikováno v:
In Theoretical Computer Science 2005 331(1):115-142
Autor:
van Breugel, Franck
Publikováno v:
In Information and Computation 2004 188(1):68-76