Static Analysis and Stochastic Search for Reachability Problem

Abstract : This paper focuses on a major improvement on the analysis of reachability properties in large-scale dynamical biological models. To tackle such models, where classical model checkers fail due to state space explosion led by exhaustive search. Alternative static analysis approaches have been proposed, but they may also fail in certain cases due to non-exhaustive search. In this paper, we introduce a hybrid approach ASPReach, which combines static analysis and stochastic search to break the limits of both approaches. We tackle this issue on a modeling framework we recently introduced, Asynchronous Binary Automata Network (ABAN). We show that ASPReach is able to analyze efficiently some reachability properties which could not be solved by existing methods. We studied also various cases from biological literature, emphasizing the merits of our approach in terms of conclusiveness and performance. keyword: Model checking,
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01951251
Contributor : Xinwei Chai <>
Submitted on : Tuesday, December 11, 2018 - 12:22:43 PM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM
Document(s) archivé(s) le : Tuesday, March 12, 2019 - 2:21:25 PM

File

SASB2018_HAL.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01951251, version 1

Citation

Xinwei Chai, Tony Ribeiro, Morgan Magnin, Olivier Roux, Katsumi Inoue. Static Analysis and Stochastic Search for Reachability Problem. 9th Workshop on Static Analysis and Systems Biology (SASB 2018), Aug 2018, Freiburg, Germany. ⟨hal-01951251⟩

Share

Metrics

Record views

58

Files downloads

50