On Verification of Probabilistic Timed Automata against Probabilistic Duration Properties

Authors:
Dang Van Hung;Miaomiao Zhang
Affiliations:
United Nations University;Tongji University
Venue:
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2007

Citing 0
Cited 5

On Verification of Linear Occurrence Properties of Real-Time Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Interoperability of constrained finite state automata

ACM SIGSOFT Software Engineering Notes
Verification of linear duration properties over continuous-time markov chains

Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
A survey on temporal logics for specifying and verifying real-time systems

Frontiers of Computer Science: Selected Publications from Chinese Universities
Verification of linear duration properties over continuous-time markov chains

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.