Model checking is a formal method that veri es whether a nite state model of a system satis es a speci cation gi v enas a temporal logic formula. The most severe problem model checking suffer from is the so called state explosion problem. Distribution is one of the techniques that combat the state explosion. The aim is to distribute the state space among a number of computers so as to be able t...

This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm. key words: Petri nets, unfoldings, reacha...

A major obstacle in applying finite-state model checking t o the verification of large systems is the combinatorial explosion of the state space arising when m a n y loosely coupled parallel processes are considered. T h e problem also known as the state-explosion problem has been attacked from various sides. This paper presents a new approach based o n partial model checking: Parts of the conc...

Dependability [1] is a very important aspect of a computing or communication system. Modelling and analysis is a prominent means for system dependability evaluation [2]. The existing dependability modelling and analysis work for large systems like communication networks focus on the static issues (such as connectivity), mainly due to the increasing complexity and thus the limitations of insuffi...

In this work, we alleviate the well-known State-Space Explosion (SSE) problem in Component Based Systems (CBS). We consider CBS that can be specified as a system of n Communicating Finite State Machines (CFSMs) interacting by rendezvous/handshake method. In order to avoid the SSE incurred by the traditional product machine composition of the given input CFSMs based on interleaving semantics, we...

In this paper we analyze the efficiency of binary decision diagrams (BDDs) and clock difference diagrams (CDDs) in the verification of timed automata. Therefore we present analytical and empirical complexity results for three communication protocols. The contributions of the analyses are: Firstly, they show that BDDs and CDDs of polynomial size exist for the reachability sets of the three proto...

Object-based systems present particular challenges for state space exploration. Objects can be dynamically created and discarded, and can be referenced via object identifiers. Consistent relabelling of object identifiers in a state leads to a state that is superficially different but behaviourally equivalent to the original. Similarly, object-based systems can include garbage which has no effec...

In order to combat the state space explosion resulting from explicit-state model checking of software, we investigate the use of a parameterised boolean equation system (Pbes) to solve on-the-fly (i.e., with incremental construction of the program state space) influence analysis of program variables w.r.t. Application Programming Interface (Api) calls executed in the program. The static analysi...

One of the serious problems of model checking is the state explosion problem. It hinders the use of model checking methods as everyday debugging tool. Using behavior protocol as a component specification mechanism also yields this problem. As the component compatibility verification using behavior protocols is based on exhaustive state space traversing, the enormous size of the state space in s...

We introduce a new formalism of higher-dimensional timed automata, based on van Glabbeek’s higher-dimensional automata and Alur’s timed automata. We prove that their reachability is PSPACE-complete and can be decided using zone-based algorithms. We also show how to use tensor products to combat state-space explosion and how to extend the setting to higher-dimensional hybrid automata.