Author of the publication

Synthesis from Probabilistic Components.

, , and . CSL, volume 12 of LIPIcs, page 412-427. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)

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

Branching vs. Linear Time: Semantical Perspective., and . ATVA, volume 4762 of Lecture Notes in Computer Science, page 19-34. Springer, (2007)On finite alphabets and infinite bases., , , and . Inf. Comput., 206 (5): 492-519 (2008)Trace Semantics is Fully Abstract., and . LICS, page 59-68. IEEE Computer Society, (2009)Solving Partial-Information Stochastic Parity Games., and . LICS, page 341-348. IEEE Computer Society, (2013)A Finite Basis for Failure Semantics., and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 755-765. Springer, (2005)Synthesizing Probabilistic Composers., and . FoSSaCS, volume 7213 of Lecture Notes in Computer Science, page 421-436. Springer, (2012)The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies., , , and . FoSSaCS, volume 8412 of Lecture Notes in Computer Science, page 242-257. Springer, (2014)On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces., , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 109-118. Springer, (2003)On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds., and . FoSSaCS, volume 2987 of Lecture Notes in Computer Science, page 182-194. Springer, (2004)Synthesis from Probabilistic Components., , and . CSL, volume 12 of LIPIcs, page 412-427. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)