( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers.

, , и . CONCUR, том 5710 из Lecture Notes in Computer Science, стр. 338-353. Springer, (2009)

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.

Philipp Giro

Christian Giro

Sonja Girod

Katharina Girod

Detlef Girod

 

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

Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers., , и . CONCUR, том 5710 из Lecture Notes in Computer Science, стр. 338-353. Springer, (2009)Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements., и . ATVA, том 7561 из Lecture Notes in Computer Science, стр. 333-348. Springer, (2012)Quantitative Model Checking Revisited: Neither Decidable Nor Approximable., и . FORMATS, том 4763 из Lecture Notes in Computer Science, стр. 179-194. Springer, (2007)An algorithmic approximation of the infimum reachability probability for Probabilistic Finite Automata. CoRR, (2010)On the Expressive Power of Schedulers in Distributed Probabilistic Systems., и . QAPL, том 253 из Electronic Notes in Theoretical Computer Science, стр. 45-71. Elsevier, (2009)Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms., , и . Theor. Comput. Sci., (2014)Efficient computation of exact solutions for quantitative model checking. QAPL, том 85 из EPTCS, стр. 17-32. (2012)Optimal schedulers vs optimal bases: An approach for efficient exact solving of Markov decision processes.. Theor. Comput. Sci., (2014)On the verification of probabilistic I/O automata with unspecified rates., и . SAC, стр. 582-586. ACM, (2009)Undecidability Results for Distributed Probabilistic Systems.. SBMF, том 5902 из Lecture Notes in Computer Science, стр. 220-235. Springer, (2009)