( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains.

, и . CAV (1), том 10981 из Lecture Notes in Computer Science, стр. 681-699. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Mark Breugel

Huynh Van Van

Burchard Franck

Thea Franck

Julia Franck

 

Другие публикации лиц с тем же именем

Towards model checking of computer games with Java PathFinder., и . GAS@ICSE, стр. 15-21. IEEE Computer Society, (2013)Modelling and verifying web service orchestration by means of the concurrency workbench., и . ACM SIGSOFT Softw. Eng. Notes, 29 (5): 1-10 (2004)Addendum to "Recursively defined metric spaces without contraction" TCS 380 (1/2) (2007) 143-163., , , и . Theor. Comput. Sci., (2013)Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains., и . CAV (1), том 10981 из Lecture Notes in Computer Science, стр. 681-699. Springer, (2018)Failures, finiteness and full abstraction.. MFPS, том 6 из Electronic Notes in Theoretical Computer Science, стр. 391-408. Elsevier, (1997)Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata., и . CONCUR, том 118 из LIPIcs, стр. 9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Deciding probabilistic bisimilarity distance one for probabilistic automata., и . J. Comput. Syst. Sci., (2020)Measuring Progress of Probabilistic LTL Model Checking, и . QAPL, том 85 из EPTCS, стр. 33-47. (2012)An Algorithm for Quantitative Verification of Probabilistic Transition Systems., и . CONCUR, том 2154 из Lecture Notes in Computer Science, стр. 336-350. Springer, (2001)An Accessible Approach to Behavioural Pseudometrics., , , и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 1018-1030. Springer, (2005)