One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis and verification of the behaviour of systems. In their basic form, they construct a structure that consist of all states that a system can reach, and all transitions that system can make between those states. This structure is called state space. State spaces...

We discuss compact symbolic representations of large state spaces, based on binary decision diagrams (BDD). Extensions of BDDs are considered, in order to represent stochastic transition systems for performabil-ity analysis. Parallel composition of components can be performed in this context, without leading to state space explosion. Furthermore, we discuss state space reduction by Markovian bi...

Since the complexity of software systems continues to grow, most engineers face two serious problems: the state space explosion problem and the problem of how to debug systems. In this paper, we propose a game-theoretic approach to full branching time model checking on three-valued semantics. The three-valued models and logics provide successful abstraction that overcomes the state space explos...

Autonomous systems in uncertain dynamic environments must reconfigure themselves in response to unanticipated events and goals in real-time. We present an approach to reactive configuration planning based on the principle of decomposition. Reactive plans are susceptible to exponential state space explosion. We address this problem through transition-based decomposition by generating compact dec...

ON-THE-FLY DYNAMIC DEAD VARIABLE ANALYSIS Joel Self Department of Computer Science Master of Science State explosion in model checking continues to be the primary obstacle to widespread use of software model checking. The large input ranges of variables used in software is the main cause of state explosion. As software grows in size and complexity the problem only becomes worse. As such, model ...

Model checking is an automatic verification technique to verify hardware and software systems. However it suffers from state-space explosion problem. In this paper we address this problem in the context of cryptographic protocols by proposing a security property-dependent heuristic. The heuristic weights the state space by exploiting the security formulae; the weights may then be used to explor...

Stochastic Process Algebras have been introduced to enable compositional performance analysis of parallel and distributed systems. As with other high level modelling formalisms, state space explosion is a frequently observed problem, especially if the system consists of many cooperating components. However, if the components are identical replicas of each others, the state space can be reduced ...

This article presents a modular automaton-based framework to specify flexible manufacturing systems and optimize the makespan of product batches. The Batch Makespan Optimization (BMO) problem is NP-Hard optimization can therefore take prohibitively long, depending on size state-space induced by specification. To tame explosion problem, we develop an algebra based automata equivalence inclusion ...

Partial order reduction is a very succesful technique for avoid ing the state explosion problem that is inherent to explicit state model checking of asynchronous concurrent systems It exploits the commu tativity of concurrently executed transitions in interleaved system runs in order to reduce the size of the explored state space Directed model checking on the other hand addresses the state exp...

Petri nets are useful for modelling complex concurrent systems. While modelling using Petri nets focusses on local states and actions, the analysis methods are concerned with global states and their transitions. Unfortunately generation of the complete state space suffers from the well-known state space explosion problem. This paper presents a method to overcome the state-space explosion proble...