Verification of large state/event systems using compositionality and dependency analysis

DOI10.1023/A:1008736219484MaRDI QIDQ5929098zbMATH OpenOpenAlexFDO

Authors Jørn Lind-Nielsen, Henrik Reif Andersen, Henrik Hulgaard, Gerd Behrmann, Kåre Kristoffersen, Kim G. Larsen

Publication date 2 July 2001

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008736219484

zbMATH Keywords

compositionalitydependency analysis

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2102715
• Context-dependent minimization of state/event systems
• Formal analysis and verification of Statemate designs
• Compositional verification of asynchronous concurrent systems using CADP
• Model-Checking Large Finite-State Systems and Beyond

Cited in

(9)

• visualSTATE
• Compositional verification of asynchronous concurrent systems using CADP
• An automatic method for the dynamic construction of abstractions of states of a formal model
• Compositional SCC analysis for language emptiness
• On the model checking of a system consisting of many similar components
• Compositionality in state space verification methods
• scientific article; zbMATH DE number 2102715 (Why is no real title available?)
• State/Event Software Verification for Branching-Time Specifications
• Efficient hybrid reachability analysis for asynchronous concurrent systems

Describes a project that uses

Uses Software

• BuDDy

This page was built for publication: Verification of large state/event systems using compositionality and dependency analysis

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