Departmental Papers (CIS)

Document Type

Journal Article

Date of this Version

May 2000

Comments

Copyright 2000 IEEE. Reprinted from IEEE Transactions on Software Engineering, Volume 26, Issue 5, May 2000, pages 453-477.
Publisher URL: http://ieeexplore.ieee.org/xpl/tocresult.jsp?isNumber=18365&puNumber=32

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Abstract

State explosion is a well-known problem that impedes analysis and testing based on state-space exploration. This problem is particularly serious in real-time systems because unbounded time values cause the state space to be infinite even for simple systems. In this paper, we present an algorithm that produces a compact representation of the reachable state space of a real-time system. The algorithm yields a small state space, but still retains enough information for analysis. To avoid the state explosion which can be caused by simply adding time values to states, our algorithm uses history equivalence and transition bisimulation to collapse states into equivalent classes. Through history equivalence, states are merged into an equivalence class with the same untimed executions up to the states. Using transition bisimulation, the states that have the same future behaviors are further collapsed. The resultant state space is finite and can be used to analyze real-time properties. To show the effectiveness of our algorithm, we have implemented the algorithm and have analyzed several example applications.

Keywords

Formal specification, reachability analysis, real-time analysis, state space minimization, timed automata

Share

COinS
 

Date Posted: 17 March 2005

This document has been peer reviewed.