Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Symbolic Analysis for GSMP Models with One Stateful Clock
 

Summary: Symbolic Analysis for GSMP Models with One
Stateful Clock
Mikhail Bernadsky and Rajeev Alur
Department of Computer and Information Science
University of Pennsylvania
{mbernads, alur}@cis.upenn.edu
Abstract. We consider the problem of verifying reachability properties
of stochastic real-time systems modeled as generalized semi-Markov pro-
cesses (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 ap-
proximate 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 satis-
fies 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.
1 Introduction

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

 

Collections: Computer Technologies and Information Sciences