A work-efficient distributed algorithm for reachability analysis.

DOI10.1007/B11831MaRDI QIDQ5900670zbMATH OpenOpenAlexFDO

Authors Orna Grumberg, Tamir Heyman, Assaf Schuster

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11831

Mathematics Subject Classification ID

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

Recommendations

• A work-efficient distributed algorithm for reachability analysis
• scientific article; zbMATH DE number 1670766
• A distributed algorithm for GSPN reachability graph generation
• Correct Hardware Design and Verification Methods
• A scalable parallel algorithm for reachability analysis of very large circuits

Cited in

(14)

• A scalable parallel algorithm for reachability analysis of very large circuits
• GSTE is partitioned model checking
• A work-efficient distributed algorithm for reachability analysis
• scientific article; zbMATH DE number 1670551 (Why is no real title available?)
• scientific article; zbMATH DE number 1670766 (Why is no real title available?)
• Measuring and evaluating parallel state-space exploration algorithms
• Speculative image computation for distributed symbolic reachability analysis
• VERIFYING VERY LARGE INDUSTRIAL CIRCUITS USING 100 PROCESSES AND BEYOND
• d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
• Distributed algorithms for time optimal reachability analysis
• Lazy reachability analysis in distributed systems
• Reachability analysis on distributed executions
• Model checking of biological systems
• Correct Hardware Design and Verification Methods

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 Q5900670)