International audienceWe propose an approach to perform efficient model-checking of µ-calculus formulae on modular Petri nets. Given a formula ϕ, each module can be analysed separately, possibly yielding a conclusion about the truth value of ϕ on the global system. When no conclusion can be drawn locally, a minimal state space preserving ϕ is computed for the module and can be incrementally composed with others, thus enabling for hierarchical analysis of a modular Petri net in a bottom-up fashion
Abstract: Model-Checking is a formal verified technique to check on whether a computing model, by se...
© Copyright 2004 IEEEThis paper reviews a proposal for the modular analysis of Petri nets and its ap...
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factor...
International audienceThis paper defines a formal framework for the modular and hierarchical model-c...
The systems to model are nowadays very large. Their specification is often decomposed into several s...
Model-checking is a powerful and widespread technique for the verification of finite state concurren...
Verification of complex systems specification often encounters the so-called state space explosion p...
Concurrent systems are frequently scrutinised using automated model checking, routinely using Petri ...
The use of different High-level Petri net formalisms has made it possible to create Petri net models...
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem ...
International audienceIn this paper, we address the modular verification problem for a Petri net obt...
In this paper, we address the modular verification problem for a Petri net obtained by composition o...
We propose a modular verification technique for bounded Petri nets which efficiency relies on both be...
Although model checking is heavily used in the hardware domain, its use is not mainstream in softwar...
This paper gives a survey of a composition model checking methodology and its succesfull instantiati...
Abstract: Model-Checking is a formal verified technique to check on whether a computing model, by se...
© Copyright 2004 IEEEThis paper reviews a proposal for the modular analysis of Petri nets and its ap...
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factor...
International audienceThis paper defines a formal framework for the modular and hierarchical model-c...
The systems to model are nowadays very large. Their specification is often decomposed into several s...
Model-checking is a powerful and widespread technique for the verification of finite state concurren...
Verification of complex systems specification often encounters the so-called state space explosion p...
Concurrent systems are frequently scrutinised using automated model checking, routinely using Petri ...
The use of different High-level Petri net formalisms has made it possible to create Petri net models...
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem ...
International audienceIn this paper, we address the modular verification problem for a Petri net obt...
In this paper, we address the modular verification problem for a Petri net obtained by composition o...
We propose a modular verification technique for bounded Petri nets which efficiency relies on both be...
Although model checking is heavily used in the hardware domain, its use is not mainstream in softwar...
This paper gives a survey of a composition model checking methodology and its succesfull instantiati...
Abstract: Model-Checking is a formal verified technique to check on whether a computing model, by se...
© Copyright 2004 IEEEThis paper reviews a proposal for the modular analysis of Petri nets and its ap...
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factor...