Decidable Model Checking of Probabilistic Hybrid Automata
[Spr00] J. Sproston. Decidable Model Checking of Probabilistic Hybrid Automata. In Proc. Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'00), volume 1926 of LNCS, pages 31-45, Springer. 2000. ps.gz bib
- Downloads
PostScript 109 KB
BibTeX
- Notes
- The original publication is available at link.springer.com.
- Search for this paper
- Google · Google Scholar