( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation.

, , , , , , , , , , и . Petri Nets, том 10258 из Lecture Notes in Computer Science, стр. 139-158. Springer, (2017)

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.

Jirí Mencák

Jirí Panyr

Jirí Friml

Jirí Simácek

Günther Jirikowski

 

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

Recursion Versus Replication in Simple Cryptographic Protocols., и . SOFSEM, том 3381 из Lecture Notes in Computer Science, стр. 178-187. Springer, (2005)Undecidability of Weak Bisimilarity for Pushdown Processes.. CONCUR, том 2421 из Lecture Notes in Computer Science, стр. 579-593. Springer, (2002)Discovery of Flow Splitting Ratios in ISP Networks with Measurement Noise., , и . PRDC, стр. 64-70. IEEE, (2023)Differential Testing of Pushdown Reachability with a Formally Verified Oracle., , , и . FMCAD, стр. 369-379. IEEE, (2022)A Formal Analysis of the Web Services Atomic Transaction Protocol with UPPAAL., , и . ISoLA (1), том 6415 из Lecture Notes in Computer Science, стр. 579-593. Springer, (2010)On Counting the Number of Consistent Genotype Assignments for Pedigrees.. FSTTCS, том 3821 из Lecture Notes in Computer Science, стр. 470-482. Springer, (2005)Timed-Arc Petri Nets vs. Networks of Timed Automata.. ICATPN, том 3536 из Lecture Notes in Computer Science, стр. 385-402. Springer, (2005)Verification of Timed-Arc Petri Nets., , , и . SOFSEM, том 6543 из Lecture Notes in Computer Science, стр. 46-72. Springer, (2011)TAPAAL and Reachability Analysis of P/T Nets., , , и . Trans. Petri Nets Other Model. Concurr., (2016)Distributed Computation of Fixed Points on Dependency Graphs., , , и . SETTA, том 9984 из Lecture Notes in Computer Science, стр. 197-212. (2016)