A work-efficient distributed algorithm for reachability analysis

DOI10.1007/S10703-006-0011-4MaRDI QIDQ2431764zbMATH OpenOpenAlexFDO

Authors Tamir Heyman, Assaf Schuster, Orna Grumberg

Publication date 24 October 2006

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

Full work available at URL https://doi.org/10.1007/s10703-006-0011-4

zbMATH Keywords

Symbolic model checkingDistributed BDDsDistributed reachability

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A work-efficient distributed algorithm for reachability analysis.
• Distributed algorithms for time optimal reachability analysis
• Reachability analysis on distributed executions
• scientific article; zbMATH DE number 4050940
• Lazy reachability analysis in distributed systems
• Correct Hardware Design and Verification Methods
• Nearly work-efficient parallel algorithm for digraph reachability

Cites work

• scientific article; zbMATH DE number 1956571 (Why is no real title available?)
• scientific article; zbMATH DE number 1796128 (Why is no real title available?)
• scientific article; zbMATH DE number 2102731 (Why is no real title available?)
• A scalable parallel algorithm for reachability analysis of very large circuits
• A work-efficient distributed algorithm for reachability analysis.

Cited in

(14)

• Lazy reachability analysis in distributed systems
• A scalable parallel algorithm for reachability analysis of very large circuits
• Automated constraint-based addition of nonmasking and stabilizing fault-tolerance
• Correct Hardware Design and Verification Methods
• d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
• Automated Technology for Verification and Analysis
• Distributed verification of multi-threaded C++ programs
• A work-efficient distributed algorithm for reachability analysis.
• Distributed Lyapunov Functions in Analysis of Graph Models of Software
• Distributed algorithms for time optimal reachability analysis
• Dynamic analysis of the arrow distributed protocol
• A compositional approach to probabilistic knowledge compilation
• scientific article; zbMATH DE number 1670766 (Why is no real title available?)
• Reachability analysis on distributed executions

Describes a project that uses

Uses Software

• Murphi
• BDDNOW
• NuSMV

This page was built for publication: A work-efficient distributed algorithm for reachability analysis

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