The main analysis techniques for critical systems use state space exploration. However, one is often quickly limited by the so-called state space explosion problem, even if the systems models are relatively small. Several methods have been proposed to tackle this problem in order to get a manageable state space. One of these takes advantage of the modular structure of the model in order to build a modular state space, which is basically a set of local state spaces plus a synchronisation graph indicating the global behaviour. In this paper, we present a few case studies and compare the state space sizes with those of the full state space. The results are discussed, pointing out the criteria the model should satisfy for the technique to be ef...
International audienceExhaustive verification often suffers from the state-explosion problem, where ...
The original publication is available at www.springerlink.com Conference details: Applications and T...
Numerous properties of random graphs are highly predictable. Even by exploring a small part reliable...
The systems to model are nowadays very large. Their specification is often decomposed into several s...
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem ...
Verification of complex systems specification often encounters the so-called state space explosion p...
Abstract. Modular state spaces [CP00,LP04] turned out to be an effi-cient analysis technique in many...
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factor...
During the last two decades, we modelled the behaviour of a large number of systems. We noted that d...
The original publication is available at www.springerlink.comThis paper extends modular state space ...
© Copyright 2004 IEEEThis paper reviews a proposal for the modular analysis of Petri nets and its ap...
Performance evaluation of systems is a very important part of system design. Modeling tools which al...
International audienceFactored planning mitigates the state space explosion problem by avoiding the ...
Modular automata are symbolic transition systems halfway between families of automata and their sync...
Abstract. State space analysis is a popular formal reasoning technique. However, it is subject to th...
International audienceExhaustive verification often suffers from the state-explosion problem, where ...
The original publication is available at www.springerlink.com Conference details: Applications and T...
Numerous properties of random graphs are highly predictable. Even by exploring a small part reliable...
The systems to model are nowadays very large. Their specification is often decomposed into several s...
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem ...
Verification of complex systems specification often encounters the so-called state space explosion p...
Abstract. Modular state spaces [CP00,LP04] turned out to be an effi-cient analysis technique in many...
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factor...
During the last two decades, we modelled the behaviour of a large number of systems. We noted that d...
The original publication is available at www.springerlink.comThis paper extends modular state space ...
© Copyright 2004 IEEEThis paper reviews a proposal for the modular analysis of Petri nets and its ap...
Performance evaluation of systems is a very important part of system design. Modeling tools which al...
International audienceFactored planning mitigates the state space explosion problem by avoiding the ...
Modular automata are symbolic transition systems halfway between families of automata and their sync...
Abstract. State space analysis is a popular formal reasoning technique. However, it is subject to th...
International audienceExhaustive verification often suffers from the state-explosion problem, where ...
The original publication is available at www.springerlink.com Conference details: Applications and T...
Numerous properties of random graphs are highly predictable. Even by exploring a small part reliable...