From post

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.

 

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

Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States., , и . Fundam. Informaticae, 169 (1-2): 123-150 (2019)Structural Liveness of Immediate Observation Petri Nets., и . Fundam. Informaticae, 188 (3): 179-215 (2022)An Approach to Verification of MPI Applications Defined in a High-Level Model., , , и . ACSD, стр. 55-64. IEEE Computer Society, (2016)On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs., , и . ACSD, стр. 47-56. IEEE Computer Society, (2006)Techniques for Decidability and Undecidability of Bisimilarity., и . CONCUR, том 1664 из Lecture Notes in Computer Science, стр. 30-45. Springer, (1999)A Taxonomy of Forgetting Automata., , и . MFCS, том 711 из Lecture Notes in Computer Science, стр. 527-536. Springer, (1993)Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States., , и . Petri Nets, том 10877 из Lecture Notes in Computer Science, стр. 184-203. Springer, (2018)Semilinear Home-space is Decidable for Petri Nets., и . CoRR, (2022)Petri Nets and Regular Processes., , и . J. Comput. Syst. Sci., 59 (3): 476-503 (1999)Finiteness up to bisimilarity is decidable for pushdown processes. CoRR, (2013)