Author of the publication

A Classification of Weak Asynchronous Models of Distributed Computing.

, and . CONCUR, volume 171 of LIPIcs, page 10:1-10:16. 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs., , and . Fundam. Informaticae, 86 (3): 227-253 (2008)Top-down synthesis of live and bounded free choice nets., and . Applications and Theory of Petri Nets, volume 524 of Lecture Notes in Computer Science, page 118-139. Springer, (1990)Verification of Safety Properties Using Integer Programming: Beyond the State Equation., and . Formal Methods Syst. Des., 16 (2): 159-189 (2000)Derivation tree analysis for accelerated fixed-point computation., , and . Theor. Comput. Sci., 412 (28): 3226-3241 (2011)Reachability in Cyclic Extended Free-Choice Systems., and . Theor. Comput. Sci., 114 (1): 93-118 (1993)Parameterized Analysis of Immediate Observation Petri Nets., , and . Petri Nets, volume 11522 of Lecture Notes in Computer Science, page 365-385. Springer, (2019)#conference.Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version).. CoRR, (2014)TheoretiCS., and . Bull. EATCS, (2021)Lower Bounds on the State Complexity of Population Protocols., and . PODC, page 45-54. ACM, (2021)Compositional Synthesis of Live and Bounded Free Choice Petri Nets., and . CONCUR, volume 527 of Lecture Notes in Computer Science, page 172-187. Springer, (1991)