FDR2
Encyclopedia
FDR and subsequently FDR2 are refinement checking software tools, designed to check formal models expressed in Communicating sequential processes
(CSP). The tools have been developed by Formal Systems (Europe) Ltd. Bill Roscoe
of the Oxford University Computing Laboratory
devised the algorithms used by the tool and Michael Goldsmith was instrumental in the implementation. FDR2 is downloadable from Formal Systems.
FDR2 is a commercial product of Formal Systems (Europe) Ltd. It is often described as a model checker, but is technically a refinement checker, in that it converts two CSP process expressions into Labelled Transition Systems (LTSs), and then determines whether one of the processes is a refinement of the other within some specified semantic model (traces, failures, or failures/divergence). FDR2 applies various state-space compression algorithms to the process LTSs in order to reduce the size of the state-space that must be explored during a refinement check.
Communicating sequential processes
In computer science, Communicating Sequential Processes is a formal language for describing patterns of interaction in concurrent systems. It is a member of the family of mathematical theories of concurrency known as process algebras, or process calculi...
(CSP). The tools have been developed by Formal Systems (Europe) Ltd. Bill Roscoe
Bill Roscoe
A. William "Bill" Roscoe is a Scottish computer scientist. He is Head of the Department of Computer Science, University of Oxford and a Professor of Computing Science...
of the Oxford University Computing Laboratory
Oxford University Computing Laboratory
The Department of Computer Science, until 2011 named the Computing Laboratory , is a department of Oxford University in England...
devised the algorithms used by the tool and Michael Goldsmith was instrumental in the implementation. FDR2 is downloadable from Formal Systems.
FDR2 is a commercial product of Formal Systems (Europe) Ltd. It is often described as a model checker, but is technically a refinement checker, in that it converts two CSP process expressions into Labelled Transition Systems (LTSs), and then determines whether one of the processes is a refinement of the other within some specified semantic model (traces, failures, or failures/divergence). FDR2 applies various state-space compression algorithms to the process LTSs in order to reduce the size of the state-space that must be explored during a refinement check.