Departmental Papers (CIS)

Date of this Version

4-3-2007

Document Type

Conference Paper

Comments

From the 10th International Workshop, HSCC 2007, Pisa, Italy, April 3-5, 2007.

Abstract

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.

Subject Area

CPS Real-Time, CPS Formal Methods

Publication Source

Lecture Notes in Computer Science: Hybrid Systems: Computation and Control

Volume

4416

Start Page

90

Last Page

103

DOI

10.1007/978-3-540-71493-4_10

Copyright/Permission Statement

The original publication is available at www.springerlink.com

Share

COinS
 

Date Posted: 27 June 2012