Model checking Timed CSP

Abstract

Though Timed CSP was developed 25 years ago and the CSP-based refinement checker FDR [25] was first released 20 years ago, there has never been a version of this tool for Timed CSP. In this paper we report on the creation of such a version, based on the digitisation results of Ouaknine [16,17] and the associated development of discrete-time versions of Timed CSP with associated models

Recent Developments in FDR

“…In both of these it demonstrated great efficiency: Table 1 shows results for the first of these in comparison to Uppaal [2] and PAT [1]. Further results can be found in [4].…”

“…It is therefore possible to model check Timed CSP programs, drawing conclusions about their continuous semantics by a relatively modest modification to FDR along the lines suggested in [17,22]. This modification -described in more detail in [4] -takes the form of a mode within FDR that instructs it to interpret the syntax inside it as a Timed CSP process and translate it into semantically equivalent tock -CSP. It is possible, and frequently very useful, to mix Timed CSP, tock -CSP and ordinary CSP in the same script and indeed in the same process or refinement check.…”

Concurrent Depth-First Search Algorithms

“…We have extracted the graphs of τ -transitions for all implementation processes in the FDR3 test suite (including most of the CSP models from [15,16,1]) and the CSP models from [10]. The top of Figure 4 gives statistics about a selection of the graphs with between 200,000 and 5,000,000 states (we omit eleven such, in the interests of space), plus a slightly smaller file tring2.1 which we discuss below 4 .…”

FDR3 — A Modern Refinement Checker for CSP

“…Like recent versions of FDR2, FDR3 supports the Timed CSP language [14,15]. It uses the strategy outlined in [16,3] of translating the continuous Timed CSP language to a variant of untimed CSP with prioritisation and relying on…”