loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007)
On Verification of Probabilistic Timed Automata against Probabilistic Duration Properties
Daegu, Korea
August 21-August 24
ISBN: 0-7695-2975-5
Dang Van Hung, United Nations University
Miaomiao Zhang, Tongji University
In this paper, we introduce an extension of Duration Calculus called Simple Probabilistic Duration Calculus (SPDC) to express dependability requirements for real-time systems, and address the problem to decide if a probabilistic timed automaton satisfies a SPDC formula. We prove that the problem is decidable for a class of SPDC called probabilistic linear duration invariants, and provide a model checking algorithm for solving this problem.
Citation:
Dang Van Hung, Miaomiao Zhang, "On Verification of Probabilistic Timed Automata against Probabilistic Duration Properties," rtcsa, pp.165-172, 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.