An efficient algorithm tocompute the minimal and maximal probabilities for timed reachability incontinuous-time Markov decision processes

Baier, C. and Haverkort, B.R.H.M. and Hermanns, H. and Katoen, J.P. (2003) An efficient algorithm tocompute the minimal and maximal probabilities for timed reachability incontinuous-time Markov decision processes. [Report]

PDF
Restricted to UT campus only
256Kb

Item Type:	Report
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Design and Analysis of Communication Systems (DACS) Formal Methods and Tools (FMT)
Link to this item:	http://purl.utwente.nl/publications/63055
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page