Abstract
“ARA” is a verification tool which applies some recent improved speed verification techniques. ARA accepts as input systems described in Basic Lotos. With ARA, a system can be verified by showing that it is behaviourally equivalent with its specification. For comparing behaviours, ARA uses a novel CSP-like but catastrophe-free behavioural equivalence notion called “CFFD-equivalence”. ARA can also reduce the behaviour of the system into a small “normal” form, and show the result graphically. ARA applies two techniques to cope with the state explosion problem: compositional LTS construction and the stubborn set method. The paper contains a detailed example of the validation of a communication protocol using ARA. The paper concentrates on the intuition behind the various novel ideas of ARA; formal details are mostly omitted.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
