<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dubey, Abhishek</style></author><author><style face="normal" font="default" size="100%">Riley, Derek</style></author><author><style face="normal" font="default" size="100%">Abdelwahed, Sherif</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modeling and Analysis of Probabilistic Timed Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Engineering of Computer Based Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">04/2009</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://archive.isis.vanderbilt.edu/sites/default/files/PTAVerification_0.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">San Francisco, USA</style></pub-location><abstract><style face="normal" font="default" size="100%">Probabilistic system models are useful for analyzing systems which operate under the presence of uncertainty. In this paper, we present a proposed technique for verifying certain safety and liveness properties for probabilistic timed automata.  The proposed technique is an extension of a technique used to verify stochastic hybrid automata using an approximation with Markov Decision Processes. A case study for CSMA/CD protocol has been used to show case the methodology used in our technique.</style></abstract></record></records></xml>