From post

Flatness and Complexity of Immediate Observation Petri Nets.

, , и . CONCUR, том 171 из LIPIcs, стр. 45:1-45:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

 

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

Parameterized Analysis of Immediate Observation Petri Nets., , и . Petri Nets, том 11522 из Lecture Notes in Computer Science, стр. 365-385. Springer, (2019)#conference.Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent, и . (2021)https://arxiv.org/abs/2108.07510.Flatness and Complexity of Immediate Observation Petri Nets., , и . CONCUR, том 171 из LIPIcs, стр. 45:1-45:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Observation Petri Nets.. Technical University of Munich, Germany, (2023)Efficient Restrictions of Immediate Observation Petri Nets, и . (2020)http://arxiv.org/abs/2007.09189.Parameterized Analysis of Reconfigurable Broadcast Networks., , и . FoSSaCS, том 13242 из Lecture Notes in Computer Science, стр. 61-80. Springer, (2022)The Complexity of Verifying Population Protocols., , , и . (2019)The Complexity of Verifying Population Protocols., , , и . Distributed Computing, (2021)https://arxiv.org/abs/1912.06578.Verification of Immediate Observation Population Protocols., , , и . CONCUR, том 118 из LIPIcs, стр. 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Uniform Framework for Language Inclusion Problems., , и . Taming the Infinities of Concurrency, том 14660 из Lecture Notes in Computer Science, стр. 155-171. Springer, (2024)