A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis

DOI10.1007/11901914_7MaRDI QIDQ3522894zbMATH OpenOpenAlexFDO

Authors Ming-Ying Chung, Gianfranco Ciardo, Andy Jinqing Yu

Publication date 4 September 2008

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Correct Hardware Design and Verification Methods
• Applications and Theory of Petri Nets 2004
• scientific article; zbMATH DE number 1701768
• scientific article; zbMATH DE number 1956594
• Approximate Symbolic Reachability of Networks of Transition Systems

Cited in

(3)

• scientific article; zbMATH DE number 2080057 (Why is no real title available?)
• Tools and Algorithms for the Construction and Analysis of Systems
• Improving Saturation Efficiency with Implicit Relations

This page was built for publication: A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis

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