EEMCS

There is a more recent version of this eprint available. Click here to view it.

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 217 Kb

Official URL: http://dx.doi.org/10.1007/978-3-540-75211-0_7

Abstract

In this paper we describe how both, memory and time requirements for stochastic model checking
of SPDL (stochastic propositional dynamic logic) formulae can significantly be reduced.
SPDL is the stochastic extension of the multi-modal program logic PDL.
SPDL provides means to specify path-based properties with or without timing restrictions.
Paths can be characterised by so-called programs, essentially regular expressions, where the executability
can be made dependent on the validity of test formulae.
For model-checking SPDL path formulae it is necessary to build a product transition system (PTS)
between the system model and the program automaton belonging to the path formula that is to
be verified.
In many cases, this PTS can be drastically reduced during the model checking procedure,
as the program restricts the number of potentially satisfying paths.
Therefore, we propose an approach that directly generates the reduced PTS from a given SPA
specification and an SPDL path formula.
The feasibility of this approach is shown through a selection of case studies,
which show enormous state space reductions, at no increase in generation time.

Available Versions of this Item

• Faster SPDL Model Checking Through Property-Driven State Space Generation (deposited 29 August 2007)
  [Currently Displayed]
  • SPDL Model Checking via Property-Driven State Space Generation (deposited 04 September 2007)

Export this item as:

• BibTeX
• XML

To correct this item please ask your editor

Repository Staff Only: edit this item