Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Communicating sequential processes
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== FDR === The most well-known CSP tool is probably ''[[FDR (software)|Failures-Divergences Refinement]]'', which is a commercial product originally developed by Formal Systems (Europe) Ltd. FDR is often described as a [[model checker]], but is technically a ''refinement'' checker, in that it converts two CSP process expressions into [[Labelled transition system|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).<ref>{{Cite book |first=A. W. |last=Roscoe |chapter=Model-checking CSP |title=A Classical Mind: Essays in Honour of C. A. R. Hoare |publisher=Prentice Hall |date=1994 |author-link=Bill Roscoe}}</ref> FDR 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. FDR was succeeded by FDR2, FDR3 and FDR4.<ref>{{cite web |url= https://www.cs.ox.ac.uk/projects/fdr/manual/introduction.html |title=Introduction β FDR 4.2.4 documentation |website=www.cs.ox.ac.uk}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)