• Corpus ID: 28904887

Model Checking Contest @ Petri Nets, Report on the 2013 edition

  title={Model Checking Contest @ Petri Nets, Report on the 2013 edition},
  author={Fabrice Kordon and Alban Linard and Marco Beccuti and Didier Buchs and Lukasz Fronc and Lom-Messan Hillah and Francis Hulin-Hubard and Fabrice Legond-Aubry and Niels Lohmann and Alexis Marechal and Emmanuel Paviot-Adet and Franck Pommereau and C{\'e}sar Rodr{\'i}guez and Christian Rohr and Yann Thierry-Mieg and Harro Wimmel and Karsten Wolf},
This document presents the results of the Model Checking Contest held at Petri Nets 2013 in Milano. This contest aimed at a fair and experimental evaluation of the performances of model checking techniques applied to Petri nets. This is the third edition after two successful editions in 2011 and 2012. The participating tools were compared on several examinations (state space generation and evaluation of several types of formul{\ae} -- reachability, LTL, CTL for various classes of atomic… 

Tables from this paper

PeCAn: Compositional Verification of Petri Nets Made Easy
PeCAn is introduced, a tool supporting compositional verification of Petri nets that generates Symbolic Observation Graphs (SOG), and implements an incremental strategy based on counter-examples for model-checking, thus improving significantly the cost of execution time and memory space.
Bounded Model Checking High Level Petri Nets in PIPE+Verifier
This paper presents an analysis method for HLPNs by leveraging the BMC technique with a state-of-the-art satisfiability modulo theories (SMT) solver Z3.
Reusing Symbolic Observation Graph for Efficient Model Checking
This paper proposes a novel technique to optimize the construction of SOG by reusing the previously constructed SOGs when verifying other properties, and shows that this technique is more efficient than both the explicit model checking and the original SOG technique.
Building Petri Nets Tools around Neco Compiler
The components of Neco are described, and in particular the exploration libraries it produces, with the aim that one can use Neco in one's own projects in order to speedup Petri nets executions.
Efficient learning and analysis of system behavior
Improved learning algorithm that is able to deal with huge alphabets and bandwidth reduction techniques, originally designed for sparse matrix solvers, are very capable at reducing the memory footprint of the specifications' symbolic state space.
Read, Write and Copy Dependencies for Symbolic Model Checking
This paper aims at improving symbolic model checking for explicit state modeling languages, e.g., Promela, Dve and mCRL2, by introducing notions of event locality and overwriting and copying in a language-independent manner.
Teaching formal methods: Experience at UPMC and UP13 with CosyVerif
ColyVerif is a software environment dedicated to graphical notations, that provides the mechanisms and means for an easy integration of additional existing software for teaching (or demonstration) purposes, that makes it an interesting platform to establish new courses.
BenchKit, a Tool for Massive Concurrent Benchmarking
This paper presents BenchKit, a tool to operate programs on sets of potentially parallel machines and to gather monitoring information like CPU or memory usage and to samples such data over the execution time.
TOOLympics 2019: An Overview of Competitions in Formal Methods
Competitions are a suitable way to bring together the community and to compare the state of the art, in order to identify progress of and new challenges in the research area.


Report on the Model Checking Contest at Petri Nets 2011
The results of the Model Checking Contest held within the SUMo 2011 workshop, a satellite event of Petri Nets 2011, aimed at a fair and experimental evaluation of the performances of model checking techniques applied to Petri nets.
MARCIE - Model Checking and Reachability Analysis Done EffiCIEntly
MARCIE's architecture and its most important distinguishing features are presented, and extensive computational experiments demonstrate MARCIE's strength in comparison with related tools.
High-Level Petri Net Model Checking with AlPiNA
The Algebraic Petri Nets Analyzer (AlPiNA), a symbolic model checker for High-level Petri nets, is introduced, comprised of two independent modules: a GUI plug-in for Eclipse and an underlying model checking engine.
Generating Petri Net State Spaces
It is demonstrated that the basic features of Petri nets do not only lead to additional analysis techniques, but as well to improved implementations of formalism-independent techniques.
Applying CEGAR to the Petri Net State Equation
We propose a reachability verification technique that combines the Petri net state equation (a linear algebraic overapproximation of the set of reachable states) with the concept of counterexample
AlPiNA: A Symbolic Model Checker
The features that AlPiNA provides to the user for specifying models and properties to validate, followed by the techniques that it implements for tuning validation performance are described.
Colored GSPN models and automatic symmetry detection
  • G. Chiola, G. Franceschinis
  • Computer Science
    Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89
  • 1989
A method that automatically exploits the symmetries intrinsic in the model reducing the RG size is presented and can be applied to a subclass of CPNs called regular nets (RN), to demonstrate that the automatically achieved reductions are comparable to those devised for these systems by thoroughly studying their behavior.
Hierarchical Set Decision Diagrams and Regular Models
Algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic model-checking and investigate how to capture similarities in regular and concurrent models are presented.
Towards Distributed Software Model-Checking Using Decision Diagrams
A new symbolic algorithm, EquivSplit, is proposed, allowing an efficient and fully symbolic manipulation of transition relations on Data Decision Diagrams, and allows to work with equivalence classes of states rather than individual states.
Efficient unfolding of contextual Petri nets