( en | de | ru )

 

Disambiguation of "Etessami, Kousha"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating the termination value of one-counter MDPs and stochastic games.

, , , and . Inf. Comput., (2013)

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.

Abdol Azim Etessami

 

Other publications of authors with the same name

From Rule-based to Automata-based Testing., and . FORTE, volume 183 of IFIP Conference Proceedings, page 53-68. Kluwer, (2000)Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems.. LATA, volume 7810 of Lecture Notes in Computer Science, page 12. Springer, (2013)Reachability and the Power of Local Ordering., and . Theor. Comput. Sci., 148 (2): 261-279 (1995)Realizability and Verification of MSC Graphs., , and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 797-808. Springer, (2001)Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes., , and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 184-196. Springer, (2015)Stochastic Context-Free Grammars, Regular Languages, and Newton's Method., , and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 199-211. Springer, (2013)Multi-objective Model Checking of Markov Decision Processes., , , and . TACAS, volume 4424 of Lecture Notes in Computer Science, page 50-65. Springer, (2007)Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs., , and . RE, page 14-22. IEEE Computer Society, (2001)Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars., , and . STOC, page 579-588. ACM, (2012)Compression of Partially Ordered Strings., , , , and . CONCUR, volume 2761 of Lecture Notes in Computer Science, page 42-56. Springer, (2003)