Date of this Version
Mikhail Bernadsky and Rajeev Alur, "Symbolic Analysis of GSMP Models With One Stateful Clock", Lecture Notes in Computer Science: Hybrid Systems: Computation and Control 4416, 90-103. April 2007. http://dx.doi.org/10.1007/978-3-540-71493-4_10
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based techniques for GSMPs are not adequate for solving verification problems, and existing symbolic techniques either require memoryless distributions for firing times, or approximate the problem using discrete time or bounded horizon. In this paper, we present a symbolic solution for the case where firing times are random variables over a rich class of distributions, but only one event is allowed to retain its firing time when a discrete change occurs. The solution allows us to compute the probability that such a GSMP satisfies a property of the form “can the system reach a target, while staying within a set of safe states”. We report on illustrative examples and their analysis using our procedure.
CPS Real-Time, CPS Formal Methods
Lecture Notes in Computer Science: Hybrid Systems: Computation and Control
The original publication is available at www.springerlink.com
Date Posted: 27 June 2012