The systems to model are nowadays very large. Their specification is often decomposed into several steps. This leads to modularly or incrementally designed models. Petri nets analysis is generally achieved via state space analysis, which is often impossible to perform due to the so-called state space explosion problem. Several methods allow to reduce the occurrence graph size, e.g. using partial orders, symmetries, ... Here, we focus on techniques which take advantage of the modular design of the system, and hence build the state space in a modular or incremental way
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...
Summary: The Petri net is a very efficient model to describe and analyse the behaviour of Discrete E...
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem ...
The main analysis techniques for critical systems use state space exploration. However, one is often...
Petri nets are a modeling formalism that allows to describe concurrent systems with an intuitive and...
The use of different High-level Petri net formalisms has made it possible to create Petri net model...
Verification of complex systems specification often encounters the so-called state space explosion p...
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factor...
Modular automata are symbolic transition systems halfway between families of automata and their sync...
International audienceWe propose an approach to perform efficient model-checking of µ-calculus formula...
Model-checking is a powerful and widespread technique for the verification of finite state concurren...
© Copyright 2004 IEEEThis paper reviews a proposal for the modular analysis of Petri nets and its ap...
Petri nets, even though very useful for modeling of discrete event systems, suffer from some weaknes...
Abstract. Modular state spaces [CP00,LP04] turned out to be an effi-cient analysis technique in many...
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...
Summary: The Petri net is a very efficient model to describe and analyse the behaviour of Discrete E...
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem ...
The main analysis techniques for critical systems use state space exploration. However, one is often...
Petri nets are a modeling formalism that allows to describe concurrent systems with an intuitive and...
The use of different High-level Petri net formalisms has made it possible to create Petri net model...
Verification of complex systems specification often encounters the so-called state space explosion p...
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factor...
Modular automata are symbolic transition systems halfway between families of automata and their sync...
International audienceWe propose an approach to perform efficient model-checking of µ-calculus formula...
Model-checking is a powerful and widespread technique for the verification of finite state concurren...
© Copyright 2004 IEEEThis paper reviews a proposal for the modular analysis of Petri nets and its ap...
Petri nets, even though very useful for modeling of discrete event systems, suffer from some weaknes...
Abstract. Modular state spaces [CP00,LP04] turned out to be an effi-cient analysis technique in many...
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...
Summary: The Petri net is a very efficient model to describe and analyse the behaviour of Discrete E...