We present verification toolset ITS-tools, featuring a symbolic model-checking back-end
engine based on hierarchical set decision diagrams (SDD) that supports reachability, CTL …

Abstract The Model Checking Contest (MCC) is an annual competition of software tools for
model checking. Tools must process an increasing benchmark gathered from the whole …

Abstract Created in 2011, the Model Checking Contest (MCC) is an annual competition
dedicated to provide a fair evaluation of software tools that verify concurrent systems using …

Abstract Model-checking of temporal logic formulae is a widely used technique for the
verification of systems. CTL∗ is a temporal logic that allows to consider an intermix of both …

If an ω-automaton accepts a word, it necessarily contains an accepting cycle (ie, a cycle
visiting all acceptance marks in the case of generalized Büchi) that is reachable from the …

Since their invention, Petri nets have provided modelling and analysis methods to support
the design of correct, reliable and robust systems. This motivated our work to develop …

Abstract Model checking is a powerful and widespread technique for the verification of finite
distributed systems. It takes as input a formal model of a system and a formal specification …

An efficient way to cope with the combinatorial explosion problem induced by the model
checking process is to compute the Symbolic Observation Graph (SOG). Given an stuttering …

The automata-theoretic approach for model checking of linear-time temporal properties
involves the emptiness check of a large Büchi automaton. Specialized emptiness-check …

This talk will present our experience in building data structures, algorithms, languages and
tools to enable symbolic model-checking of specifications expressed in a variety of …