EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


12290 Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
Home Policy Brochure Browse Search User Area Contact Help

Blom, S.C.C. and Haverkort, B.R.H.M. and Kuntz, G.W.M. and van de Pol, J.C. (2008) Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking. In: Proceedings of the 7th International Workshop on Parallel and Distributed Methods in verifiCation, 29 Mar 2008, Budapest, Hungary. pp. 35-50. Electronic Notes in Theoretical Computer Science 220 (2). Elsevier. ISSN 1571-0661

Full text available as:

PDF (Official ScienceDirect version)
- Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
347 Kb
PDF (Author version)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
217 Kb

Official URL: http://dx.doi.org/10.1016/j.entcs.2008.11.012

Exported to Metis

Abstract

The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade.

An important result of that research is the logic CSL (continuous stochastic logic) and its corresponding model checking algorithms. The evaluation of properties expressed in CSL makes it necessary to solve large systems of linear (differential) equations, usually by means of numerical analysis. Both the inherent time and space complexity of the numerical algorithms make it practically infeasible to model check systems with more than 100 million states, whereas realistic system models may have billions of states.

To overcome this severe restriction, it is important to be able to replace the original state space with a probabilistically equivalent, but smaller one. The most prominent equivalence relation is bisimulation, for which also a stochastic variant exists (Markovian bisimulation). In many cases, this bisimulation allows for a substantial reduction of the state space size. But, these savings in space come at the cost of an increased time complexity. Therefore in this paper a new distributed signature-based algorithm for the computation of the bisimulation quotient of a given state space is introduced.

To demonstrate the feasibility of our approach in both a sequential, and more important, in a distributed setting, we have performed a number of case studies.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
Research Group:EWI-FMT: Formal Methods and Tools, EWI-DACS: Design and Analysis of Communication Systems
Research Program:CTIT-DSN: Dependable Systems and Networks
Research Project:veriGEM: A Verification Grid for Enhanced Model Checking, EC-MOAN: Scalable Modelling and Analysis Techniques to study Emergent Cell Behaviour – understanding the E. coli stress response
ID Code:12290
Status:Published
Deposited On:07 January 2009
Refereed:Yes
International:Yes
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item