To compose, or not to compose, that is the question: an analysis of compositional state space generation

DOI10.1007/978-3-319-95582-7_29MaRDI QIDQ2024367zbMATH OpenOpenAlexFDO

Authors Sander de Putter, Anton Wijs

Publication date 4 May 2021

Full work available at URL https://doi.org/10.1007/978-3-319-95582-7_29

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Compositionality in state space verification methods
• A FORMULA-DRIVEN MODULAR ATTACK ON STATE EXPLOSION
• scientific article; zbMATH DE number 1973992
• Refined Interfaces for Compositional Verification
• Compositional Verification and 3-Valued Abstractions Join Forces

Cites work

• scientific article; zbMATH DE number 50740 (Why is no real title available?)
• scientific article; zbMATH DE number 1418456 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A formal verification technique for behavioural model-to-model transformations
• Automated Assume-Guarantee Reasoning by Abstraction Refinement
• Automated Assumption Generation for Compositional Verification
• Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement
• Branching Bisimilarity with Explicit Divergence
• Compositional verification of asynchronous concurrent systems using CADP
• Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
• Myths about the mutual exclusion problem
• Refined Interfaces for Compositional Verification
• Shared-memory mutual exclusion: major research trends since 1986

Cited in

(1)

• Compositional generation of home states in free choice nets

This page was built for publication: To compose, or not to compose, that is the question: an analysis of compositional state space generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2024367)