Technical Reports (CIS)
Document Type
Technical Report
Date of this Version
May 1994
Abstract
A fundamental issue in the automated analysis of concurrent systems is the efficient generation of the reachable state space. Since it is not possible to explore all the reachable states of a system if the number of states is very large or infinite, we need to develop techniques for minimizing the state space. This paper presents our approach to cluster subsets of states into equivalent classes. We assume that concurrent systems are specified as communicating state machines with arbitrary data space. We describe a procedure for constructing a minimal reachability state graph from communicating state machines. As an illustration of our approach, we analyze a producer-consumer program written in Ada.
Recommended Citation
Inhye Kang and Insup Lee, "State Minimization for Concurrent System Analysis Based on State Space Exploration ", . May 1994.
Date Posted: 30 July 2007
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-94-22.