Author of the publication

CUT : Combining stochastic ordering and censoring to bound steady-state rewards and first passage time.

, , and . QEST, page 211-212. IEEE Computer Society, (2007)

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

Whittle networks with resets., , and . VALUETOOLS, page 28-35. ACM, (2017)Level crossing ordering of Markov chains: computing end to end delays in an all optical network., , , and . VALUETOOLS, page 46. ICST/ACM, (2007)Discrete time stochastic automata networks: using structural properties and stochastic bounds to simplify the SAN.. VALUETOOLS, page 84. ICST/ACM, (2007)Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering., , and . EPEW, volume 4054 of Lecture Notes in Computer Science, page 196-210. Springer, (2006)Stochastic Bounds and Histograms for Network Performance Analysis., , , and . EPEW, volume 8168 of Lecture Notes in Computer Science, page 13-27. Springer, (2013)Stochastic Bounds for Markov Chains with the Use of GPU., , , , and . CN, volume 522 of Communications in Computer and Information Science, page 357-370. Springer, (2015)Managing energy in a network of reconfigurable optical add/drop multiplexers., , and . Int. J. Crit. Comput. Based Syst., 5 (1/2): 127-147 (2014)Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks., , and . Perform. Evaluation, 53 (1): 43-69 (2003)Multiple class G-networks with iterated deletions., , and . Perform. Evaluation, 42 (1): 1-20 (2000)A Methodology for Solving Markov Models of Parallel Systems., and . J. Parallel Distributed Comput., 12 (4): 370-387 (1991)