You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Model-Checking with Insufficient Memory Resources

Fulltext:


Authors:

Birgitta Lindström, Paul Pettersson

Publication Type:

Report

Publisher:

HS- IKI -TR-06-005, School of Humanities and Informatics, University of Skövde

Abstract

Resource limitations is a major problem in model checking. Space and time requirements of model-checking algorithms grow exponentially with respect to the number of variables and parallel automata of the analyzed model. We present a method that is the result of experiences from a case study. It has enabled us to analyze models with much bigger state-spaces than what was possible without our method. The basic idea is to build partitions of the state-space of an analyzed system by iterative invocations of a model-checker. In each iteration the partitions are extended to represent a larger part of the state space, and if needed the partitions are further partitioned. Thereby the analysis problem is divided into a set of subproblems that can be analyzed independently of each other. We present how the method, implemented as a meta algorithm on-top of the Uppaal tool, has been applied in the case study.

Bibtex

@techreport{Lindstrom1027,
author = {Birgitta Lindstr{\"o}m and Paul Pettersson},
title = {Model-Checking with Insufficient Memory Resources},
month = {February},
year = {2006},
publisher = {HS- IKI -TR-06-005, School of Humanities and Informatics, University of Sk{\"o}vde},
url = {http://www.es.mdu.se/publications/1027-}
}