Author of the publication

Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable.

, , and . CONCUR, volume 42 of LIPIcs, page 72-84. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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

Why Liveness for Timed Automata Is Hard, and What We Can Do About It., , , and . ACM Trans. Comput. Log., 21 (3): 17:1-17:28 (2020)Higher-Order Model Checking (NII Shonan Meeting 2016-4)., , and . NII Shonan Meet. Rep., (2016)The Horn Mu-calculus., , , , and . LICS, page 58-69. IEEE Computer Society, (1998)Efficient Emptiness Check for Timed Büchi Automata., , and . CAV, volume 6174 of Lecture Notes in Computer Science, page 148-161. Springer, (2010)Difficult Configurations - On the Complexity of LTrL.. ICALP, volume 1443 of Lecture Notes in Computer Science, page 140-151. Springer, (1998)Weak Alternating Timed Automata., and . ICALP (2), volume 5556 of Lecture Notes in Computer Science, page 273-284. Springer, (2009)Characterizing EF and EX Tree Logics., and . CONCUR, volume 3170 of Lecture Notes in Computer Science, page 131-145. Springer, (2004)On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic., and . CONCUR, volume 1119 of Lecture Notes in Computer Science, page 263-277. Springer, (1996)From Logic to Games.. FSTTCS, volume 3821 of Lecture Notes in Computer Science, page 79-91. Springer, (2005)Distributed Games., and . FSTTCS, volume 2914 of Lecture Notes in Computer Science, page 338-351. Springer, (2003)