Computing Minimum and Maximum Reachability Times in Probabilistic Systems
[dA99] L. de Alfaro. Computing Minimum and Maximum Reachability Times in Probabilistic Systems. In J. Baeten and S. Mauw (editors), Proc. 10th International Conference on Concurrency Theory (CONCUR'99), volume 1664 of LNCS, pages 66--81, Springer. 1999. bib
- Downloads
BibTeX
- Notes
- The original publication is available at link.springer.com.
- Search for this paper
- Google · Google Scholar