( en | de | ru )

 

Disambiguation of "Kupferman, Orna"

Author of the publication

copydeleteadd this publication to your clipboard
Profile trees for Büchi word automata, with application to determinization.

, , , and . Inf. Comput., (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.

Orna Ehling

Orna Rosen

Magdalena Ornatowska

Frederik Ornau

Adam S Ornatek

 

Other publications of authors with the same name

Erratum for "What causes a system to satisfy a specification?"., , and . ACM Trans. Comput. Log., 11 (4): 29:1-29:2 (2010)A Game-Theoretic Approach to Simulation of Data-Parameterized Systems., , and . ATVA, volume 8837 of Lecture Notes in Computer Science, page 348-363. Springer, (2014)On the Universal and Existential Fragments of the µ-Calculus., , and . TACAS, volume 2619 of Lecture Notes in Computer Science, page 49-64. Springer, (2003)Coverage Metrics for Temporal Logic Model Checking., , and . TACAS, volume 2031 of Lecture Notes in Computer Science, page 528-542. Springer, (2001)Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions.. CAV, volume 939 of Lecture Notes in Computer Science, page 325-338. Springer, (1995)Module Checking., and . CAV, volume 1102 of Lecture Notes in Computer Science, page 75-86. Springer, (1996)From Complementation to Certification., and . TACAS, volume 2988 of Lecture Notes in Computer Science, page 591-606. Springer, (2004)A Practical Approach to Coverage in Model Checking., , , and . CAV, volume 2102 of Lecture Notes in Computer Science, page 66-78. Springer, (2001)Co-Büching Them All., and . FoSSaCS, volume 6604 of Lecture Notes in Computer Science, page 184-198. Springer, (2011)Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata., and . FoSSaCS, volume 5504 of Lecture Notes in Computer Science, page 182-196. Springer, (2009)