( en | de | ru )

 

Disambiguation of "Kupferman, Orna"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Verifying Concurrent Transition Systems.

, , and . CONCUR, volume 1243 of Lecture Notes in Computer Science, page 258-272. Springer, (1997)

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

Alternating-time temporal logic., , and . J. ACM, 49 (5): 672-713 (2002)Vacuity Detection in Temporal Model Checking., and . CHARME, volume 1703 of Lecture Notes in Computer Science, page 82-96. Springer, (1999)Fair Equivalence Relations., , and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 151-163. Springer, (2000)Trading Probability for Fairness., , and . CSL, volume 2471 of Lecture Notes in Computer Science, page 292-305. Springer, (2002)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)Fair Simulation., , and . CONCUR, volume 1243 of Lecture Notes in Computer Science, page 273-287. Springer, (1997)Inherent Vacuity in Lattice Automata., and . Fields of Logic and Computation II, volume 9300 of Lecture Notes in Computer Science, page 174-192. Springer, (2015)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)