Hierarchical Set Decision Diagrams and Regular Models

This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic model-checking. We encode the state space and transition relation using hierarchical Set Decision Diagrams (SDD) [9]. In SDD, arcs of the structure are labeled with sets, themselves stored as SDD. To exploit the hierarchy of SDD, a structured model representation is needed. We thus introduce a formalism integrating a simple notion of type and instance. Complex composite behaviors are obtained using a synchronization mechanism borrowed from process calculi. Using this relatively general framework, we investigate how to capture similarities in regular and concurrent models. Experimental results are presented, showing that this approach can outperform in time and memory previous work in this area

Presentation of the 9th Edition of the Model Checking Contest.

International audience; 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 community and may participate in various examinations: state space generation, computation of global properties, computation of some upper bounds in the model, evaluation of reachability formulas, evaluation of CTL formulas, and evaluation of LTL formulas.For each examination and each model instance, participating tools are provided with up to 3600 s and 16 gigabyte of memory. Then, tool answers are analyzed and confronted to the results produced by other competing tools to detect diverging answers (which are quite rare at this stage of the competition, and lead to penalties).For each examination, golden, silver, and bronze medals are attributed to the three best tools. CPU usage and memory consumption are reported, which is also valuable information for tool developers

A single cell atlas of frozen shoulder capsule identifies features associated with inflammatory fibrosis resolution

Frozen shoulder is a spontaneously self-resolving chronic inflammatory fibrotic human disease, which distinguishes the condition from most fibrotic diseases that are progressive and irreversible. Using single-cell analysis, we identify pro-inflammatory MERTKlowCD48+ macrophages and MERTK + LYVE1 + MRC1+ macrophages enriched for negative regulators of inflammation which co-exist in frozen shoulder capsule tissues. Micro-cultures of patient-derived cells identify integrin-mediated cell-matrix interactions between MERTK+ macrophages and pro-resolving DKK3+ and POSTN+ fibroblasts, suggesting that matrix remodelling plays a role in frozen shoulder resolution. Cross-tissue analysis reveals a shared gene expression cassette between shoulder capsule MERTK+ macrophages and a respective population enriched in synovial tissues of rheumatoid arthritis patients in disease remission, supporting the concept that MERTK+ macrophages mediate resolution of inflammation and fibrosis. Single-cell transcriptomic profiling and spatial analysis of human foetal shoulder tissues identify MERTK + LYVE1 + MRC1+ macrophages and DKK3+ and POSTN+ fibroblast populations analogous to those in frozen shoulder, suggesting that the template to resolve fibrosis is established during shoulder development. Crosstalk between MerTK+ macrophages and pro-resolving DKK3+ and POSTN+ fibroblasts could facilitate resolution of frozen shoulder, providing a basis for potential therapeutic resolution of persistent fibrotic diseases

Self-Loop Aggregation Product - A New Hybrid Approach to On-the-Fly LTL Model Checking

International audienceWe present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. The proposed product is an explicit graph of aggregates (symbolic sets of states) that can be interpreted as a Büchi automaton. The criterion used by SLAP to aggregate states from the Kripke structure is based on the analysis of self-loops that occur in the Büchi automaton expressing the property to verify. Our hybrid approach allows on the one hand to use classical emptiness-check algorithms and build the graph on-the-fly, and on the other hand, to have a compact encoding of the state space thanks to the symbolic representation of the aggregates. Our experiments show that this technique often outperforms other existing (hybrid or fully symbolic) approaches

Goal-Oriented Reduction of Automata Networks

International audienceWe consider networks of finite-state machines having local transitions conditioned by the current state of other automata. In this paper, we depict a reduction procedure tailored for a given reachability property of the form ``from global state s there exists a sequence of transitions leading to a state where an automaton g is in a local state T'. By exploiting a causality analysis of the transitions within the individual automata, the proposed reduction removes local transitions while preserving all the minimal traces that satisfy the reachability property. The complexity of the procedure is polynomial in the total number of local states and transitions, and exponential in the number of local states within one automaton. Applied to automata networks modelling dynamics of biological systems, we observe that the reduction shrinks down significantly the reachable state space, enhancing the tractability of the model-checking of large networks