with subsumption, providing the first paral-lel LTL model checking algorithm for timed automata. The algorithms are implemented in LTSmin, and experimental evalua-tions show the effectiveness and scalability of both contributions: sub-sumption halves the number of states in the real-world FDDI case study

on top of an abstract model checking interface. We extend the generalized algorithm by introducing necessary disabling sets and adding a heuristics to improve state space reduction. The effect of the changes to the algorithm are measured using an implementation in the LTSmin model checking toolset. We

for tree compression, and five times better than the median compression ratio of Spin’s Collapse compression. Our algorithms are implemented in the LTSmin tool, and our experiments show that for model checking, multi-core tree compression pays its own way: it comes virtually without overhead compared

A distributed system is driven by its separate concurrent components, which are being executed in parallel. In today’s world of wireless and mobile networking, distributed algorithms and network protocols tend to constitute an important aspect of system design. Verifying the correctness

on top of an abstract model checking interface. We extend the generalised algorithm by introducing necessary disabling sets and adding a heuristics to improve state space reduction. The effect of the changes to the algorithm are measured using an implementation in the LTSmin model checking toolset. We

This report documents the program and the outcomes of Dagstuhl Seminar 13021 “Symbolic Methods in Testing”. The aim of the seminar was to bring together leading researchers of this field; the seminary ended up with 38 participants from 10 countries: France, The Netherlands,

Abstract. In this paper, we propose a new method to perform large scale grid model checking. A manager distributes the workload over many embarrassingly parallel jobs. Only little communication is needed be-tween a worker and the manager, and only once the worker is ready for more work. The novelty

Abstract. The analysis of complex distributed systems requires dedicated software tools. The mCRL2 language and toolset have been developed to support such analysis. We highlight changes and improvements made to the toolset in recent years. On the one hand, these affect the scope of application

Main goal Scalable reference platform for automated reasoning Wide range of tools Heterogeneous formalisms Chaining of processes of verification in order to allow certification of models Tool comparison and evaluation with homogeneous criteria Problems Difficulty to conciliate different formalisms and tools into one common platform Even harder to consider end-to-end verification in a toolchain combining different formalisms and tools Étienne ANDRÉ (Paris 13) Unifying Formal Notations 30th June 2012 2 / 23

Abstract—CosyVerif aims at gathering within a common framework various existing tools for specification and verification. It has been designed in order to 1) support different formalisms with the ability to easily create new ones, 2) provide a graphical user interface for every formalism, 3) include verification tools called via the graphical interface or via an API as a Web service, and 4) offer the possibility for a developer to integrate his/her own tool without much effort, also allowing it to interact with the other tools. Several tools have already been integrated for the formal verification of (extensions of) Petri nets and timed automata.