In [18], Peled describes a partial-order reduction method to alleviate the state-explosion problem for LTL model-checking, i.e. for verifying that concurrent programs satisfy their linear temporal logic specifications. We present an approach that improves the method in [18] by enabling a further reduction of the space and time required for LTL model-checking.

| In this paper, we present an practical synthesis method using unfoldings which are based on partial order semantics and hence free of state space explosion inherently. In addition, we suggest several conditions for basic gate implementation in order to enhance practicality of the suggested method.

For synthesising efficient asynchronous circuits from STGs one has to deal with the state space explosion problem. For this purpose STG decomposition was introduced by Chu and improved by Vogler and Wollowski. Here, we present the tool DesiJ which is the implementation of STG decomposition and proposed by Vogler and several other optimisations.

Partial-order reduction is a well-known technique to cope with the state-space-explosion problem in the verification of concurrent systems. Using the hierarchical structure of concurrent systems, we present an enhancement of the partial-order-reduction scheme of [12, 19]. A prototype of the new algorithm has been implemented on top of the verification tool SPIN. The first experimental results a...

ii ACKNOWLEDGMENTS I am deeply indebted to Michal Young, my advisor. He gave me guidance when I needed it, and supplied me a salary, travel expenses, and equipment for my research. He has always been there for me, as an advisor and a friend. I am also grateful to my committee, Richard A. DeMillo and Eugene Spaaord, as well as Greg Frederickson, for reading the dissertation and ooering valuable ...

Probabilistic model checking is an increasingly widely used formal verification technique. However, its dependence on computationally expensive numerical operations makes it particularly susceptible to the state-space explosion problem. Among other abstraction techniques, bisimulation minimisation has proven to shorten computation times significantly, but, usually, the full state space needs to...

A new semantics in terms of Mean Field Equations is presented for WSCCS (Weighted Synchronous Calculus of Communicating Systems). The semantics captures the average behaviour of the system over time, but without computing the entire state space, therefore avoiding the state space explosion problem. This allows easy investigation of models with large numbers of components. The new semantics is s...

Model checking for real-time systems suuers, in practice, from the state-explosion problem: the size of the state space grows exponentially with many parameters of the system, such as the number of clocks, the size of constants, or the number of components making up the system. In order to cope with state explosion, we propose to use abstractions allowing for a reduction of the state-space whil...

In recent years, the modeling and verifying of Cyber-Physical System (CPS) is now an important aspect of CPS researches. Because of the CPS’ complex architecture, it may suffer from the state-space explosion problem when we verify CPS models by model checking methods. Therefore, we offer a method which models CPS with Component Services. The method treats the CPS components as a service provide...

Modular automata are symbolic transition systems halfway between families of automata and their synchronized products. They allow for analysis of liveness properties without incurring the state space explosion problem. A modular automaton is composed of modules and a synchronization graph. We consider the problem whether such specifications may be implemented by a distributed Petri net up to la...