How to make FDR Spin: LTL model checking of CSP using Refinement
How to make FDR Spin: LTL model checking of CSP using Refinement
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.
99-118
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Massart, Thierry
8a6771f9-a75f-4b0a-916e-c9faa7c36cae
Currie, Andrew
251fd922-6670-4bab-bcf6-661cceabfecb
Oliviera, J.N.
df176796-06a1-4a5c-bec1-a84ee6b30b49
Zave, P.
92860e8b-b173-483f-bf35-1c491b4b4c2d
March 2001
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Massart, Thierry
8a6771f9-a75f-4b0a-916e-c9faa7c36cae
Currie, Andrew
251fd922-6670-4bab-bcf6-661cceabfecb
Oliviera, J.N.
df176796-06a1-4a5c-bec1-a84ee6b30b49
Zave, P.
92860e8b-b173-483f-bf35-1c491b4b4c2d
Leuschel, Michael, Massart, Thierry and Currie, Andrew
(2001)
How to make FDR Spin: LTL model checking of CSP using Refinement.
Oliviera, J.N. and Zave, P.
(eds.)
Proceedings of Formal Methods Europe FME'2001.
.
Record type:
Conference or Workshop Item
(Other)
Abstract
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.
This record has no associated files available for download.
More information
Published date: March 2001
Venue - Dates:
Proceedings of Formal Methods Europe FME'2001, 2001-03-01
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 254118
URI: http://eprints.soton.ac.uk/id/eprint/254118
PURE UUID: 1b6abb20-fd2f-4b87-bb07-ed303954ba53
Catalogue record
Date deposited: 29 Mar 2001
Last modified: 10 Dec 2021 20:36
Export record
Contributors
Author:
Michael Leuschel
Author:
Thierry Massart
Author:
Andrew Currie
Editor:
J.N. Oliviera
Editor:
P. Zave
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics