International audienceIn this paper, we address the modular verification problem for a Petri net obtained by composition of two subnets. At first, we show how to transform an asynchronous composition into a synchronous one where the new subnets are augmented from the original ones by means of linear invariants. Then we introduce a non-constraining rela- tion between subnets based on their behaviour. Whenever this relation is satisfied, standard properties like the liveness and the boundedness and generic properties specified by a linear time logic may be checked by examination of the augmented subnets in isolation. Finally, we give a sufficient condition for this relation which can be detected modularly using an efficient algorithm
We introduce partial S-invariants of Petri nets, which can help to determine invariants and to prove...
Within a network of asynchronously communicating systems, the complete network is often not known, o...
In this paper we model (discrete) reactive systems that may interact with each other by Petri net mo...
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...
Model-checking is a powerful and widespread technique for the verification of finite state concurren...
The systems to model are nowadays very large. Their specification is often decomposed into several s...
Modular automata are symbolic transition systems halfway between families of automata and their sync...
Structural model abstraction is a powerful technique for reducing the complexity of a state based en...
International audienceWe propose an approach to perform efficient model-checking of µ-calculus formula...
A coloured Petri nets based specification and verification concept for complex real-time systems are...
Bounded model checking has been recently introduced as an efficient verification method for reactive...
Petri nets are a modeling formalism that allows to describe concurrent systems with an intuitive and...
noteStructural model abstraction is a powerful technique for reducing the complexity of a state base...
The verification of dynamic properties of a reactive systems by model-checking leads to a potential ...
We introduce partial S-invariants of Petri nets, which can help to determine invariants and to prove...
Within a network of asynchronously communicating systems, the complete network is often not known, o...
In this paper we model (discrete) reactive systems that may interact with each other by Petri net mo...
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...
Model-checking is a powerful and widespread technique for the verification of finite state concurren...
The systems to model are nowadays very large. Their specification is often decomposed into several s...
Modular automata are symbolic transition systems halfway between families of automata and their sync...
Structural model abstraction is a powerful technique for reducing the complexity of a state based en...
International audienceWe propose an approach to perform efficient model-checking of µ-calculus formula...
A coloured Petri nets based specification and verification concept for complex real-time systems are...
Bounded model checking has been recently introduced as an efficient verification method for reactive...
Petri nets are a modeling formalism that allows to describe concurrent systems with an intuitive and...
noteStructural model abstraction is a powerful technique for reducing the complexity of a state base...
The verification of dynamic properties of a reactive systems by model-checking leads to a potential ...
We introduce partial S-invariants of Petri nets, which can help to determine invariants and to prove...
Within a network of asynchronously communicating systems, the complete network is often not known, o...
In this paper we model (discrete) reactive systems that may interact with each other by Petri net mo...