par Leuschel, Michaël ;Massart, Thierry
Référence Lecture notes in computer science, 2021, page (99-118)
Publication Publié, 2001
Article révisé par les pairs
Résumé : We study the possibility of doing LTL model checking on CSP specifications in the context of refinement. We present evidence that the refinement-based approach to verification does not seem to be very well suited for verifying certain temporal properties. To remedy this problem, we show how to (and how not to) perform LTL model checking of CSP processes using refinement checking in general and the FDR tool in particular. We show how one can handle (potentially) deadlocking systems, discuss the validity of our approach for infinite state systems, and shed light on the relationship between "classical" model checking and refinement checking. © Springer-Verlag Berlin Heidelberg 2001.

Documents en relation

DI-fusion