Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams

DOI10.1007/978-3-540-71209-1_50MaRDI QIDQ5758137zbMATH OpenOpenAlexFDO

Authors Andy Jinqing Yu, Gianfranco Ciardo, Gerald Lüttgen

Publication date 3 September 2007

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71209-1_50

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

• scientific article; zbMATH DE number 1863166
• Checking bounded reachability in asynchronous systems by symbolic event tracing
• Verification of asynchronous circuits by BDD-based model checking of Petri nets
• Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
• Formal Techniques for Networked and Distributed Systems - FORTE 2005

Cited in

(5)

• Checking bounded reachability in asynchronous systems by symbolic event tracing
• Exploiting step semantics for efficient bounded model checking of asynchronous systems
• scientific article; zbMATH DE number 1863166 (Why is no real title available?)
• A decision diagram operation for reachability
• Improving Saturation Efficiency with Implicit Relations

This page was built for publication: Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams

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