Emmanuel Paviot-Adet

New features in CPN-AMI 3: focusing on the analysis of complex distributed systems

Due to the state-space size explosion problem, behavioral analysis techniques are difficult to scale up to industrial size problems. Our group couples research on analysis tools with an introspection on modeling and software engineering techniques. CPN-AMI is an integrated development and analysis environment dedicated to Petri nets. The numerous services it offers are built by a homogeneous integration of tools developed internally, and third-party tools from partner universities. These tools include state of the art algorithms and data-structures. This third major release offers better support for modeling and analysis of very large systems

Report on the Model Checking Contest at Petri Nets 2011

This article presents the results of the Model Checking Contest held within the SUMo 2011 workshop, a satellite event of Petri Nets 2011. This contest aimed at a fair and experimental evaluation of the performances of model checking techniques applied to Petri nets.

Computing a hierarchical static order for decision diagram-based representation from p/t nets

State space generation suffers from the typical combinatorial explosion problem when dealing with industrial specifications. In particular, memory consumption while storing the state space must be tackled to verify safety properties. Decision Diagrams are a way to tackle this problem. However, their performance strongly rely on the way variables encode a system. Another way to fight combinatorial explosion is to hierarchically encode the state space of a system. This paper presents how we mix the two techniques via the hierarchization of a precomputed variable order. This way we obtain a hierarchical static order for the variables encoding a system. This heuristic was implemented and exhibits good performance.

Modeling and verifying behavioral aspects

Design of reliable distributed systems is stretching limits in term of complexity since existing development techniques are usually not fully accurate for this type of applications. One of the main problem is the gap between the various notations used during development process. Even if UML is an important step forward in this domain, it is not fully suitable for formal description of distributed systems. In this chapter, we present the LfP (Language for Prototyping) notation. It is dedicated to formally describe distributed (potentially embedded) systems. We show how LfP may serve as an input for formal verification using Data Decision Diagrams (DDD), an extension of Binary Decision Diagrams (BDD) enabling a compact representation of state spaces. Some aspects of the BART case study will be presented and we show what type of behavioral properties we may verify on this specification.