Bounded Model Checking of GSMP Models of Stochastic Real-Time Systems

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
CPS Real-Time
CPS Formal Methods
Computer Sciences
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Bernadsky, Mikhail
Contributor
Abstract

Model checking is a popular algorithmic verification technique for checking temporal requirements of mathematical models of systems. In this paper, we consider the problem of verifying bounded reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMP). While GSMPs is a rich model for stochastic systems widely used in performance evaluation, existing model checking algorithms are applicable only to subclasses such as discrete-time or continuous-time Markov chains. The main contribution of the paper is an algorithm to compute the probability that a given GSMP satisfies a property of the form “can the system reach a target before time T within k discrete events, while staying within a set of safe states”. For this, we show that the probability density function for the remaining firing times of different events in a GSMP after k discrete events can be effectively partitioned into finitely many regions and represented by exponentials and polynomials. We report on illustrative examples and their analysis using our techniques.

Advisor
Date of presentation
2006-01-01
Conference name
Departmental Papers (CIS)
Conference dates
2023-05-17T07:07:18.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
From the 9th International Workshop, HSCC 2006, Santa Barbara, CA, USA, March 29-31, 2006.
Recommended citation
Collection