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

DOI10.1007/978-3-319-95582-7_29zbMath1460.68057OpenAlexW2808945735MaRDI QIDQ2024367

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A formal verification technique for behavioural model-to-model transformations
• Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
• Myths about the mutual exclusion problem
• Compositional verification of asynchronous concurrent systems using CADP
• Branching Bisimilarity with Explicit Divergence
• Automated Assume-Guarantee Reasoning by Abstraction Refinement
• Refined Interfaces for Compositional Verification
• Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement
• Shared-memory mutual exclusion: major research trends since 1986
• Automated Assumption Generation for Compositional Verification

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