Efficient hybrid reachability analysis for asynchronous concurrent systems

DOI10.1007/B93958zbMATH Open1179.68103OpenAlexW219731125MaRDI QIDQ5897080FDOQ5897080

Enric Pastor, Marco A. Peña

Publication date: 5 February 2010

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

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

Recommendations

• Partial-order reduction in symbolic state-space exploration
• scientific article; zbMATH DE number 1696452
• Correct Hardware Design and Verification Methods
• Improved symbolic verification using partitioning techniques
• Verification of large state/event systems using compositionality and dependency analysis

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)

Cited In (4)

• Title not available (Why is that?)
• Optimal time-bounded reachability analysis for concurrent systems
• Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
• Title not available (Why is that?)

This page was built for publication: Efficient hybrid reachability analysis for asynchronous concurrent systems

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