Model checking based on simultaneous reachability analysis

DOI10.1007/10722468_3MaRDI QIDQ2753750zbMATH OpenFDO

Authors Bengi Karaçalı, K. C. Tai

Publication date 6 January 2002

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

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

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)

Recommendations

• Reachability for finite-state process algebras using static analysis
• Context-dependent minimization of state/event systems
• Reachability analysis based on structured representations
• Reachability analysis of synchronized PA systems
• A work-efficient distributed algorithm for reachability analysis.

Cited in

(11)

• Reachability analysis and simulation for hybridised Event-B models
• Using heuristic search for finding deadlocks in concurrent systems
• Moving Arrows and Four Model Checking Results
• STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS
• scientific article; zbMATH DE number 6719346 (Why is no real title available?)
• scientific article; zbMATH DE number 6720711 (Why is no real title available?)
• scientific article; zbMATH DE number 3872694 (Why is no real title available?)
• Using optimal simulations to reduce reachability graphs
• Feasibility analysis for robustness quantification by symbolic model checking
• Reachability Analysis with State-Compatible Automata
• Extending Model Checking with Dynamic Analysis

This page was built for publication: Model checking based on simultaneous reachability analysis

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