CAAL: Concurrency Workbench, Aalborg Edition
We present the first official release of Caal, a web-based tool for modelling and verification of concurrent processes. The tool is primarily designed for educational purposes and it supports the classical process algebra CCS together with its timed extension TCCS. It allows to compare processes with respect to a range of strong/weak and timed/untimed equivalences and preorders (bisimulation, simulation and traces) and supports model checking of CCS/TCCS processes against recursively defined formulae of Hennessy-Milner logic. The tool offers a graphical visualizer for displaying labelled transition systems, including their minimization up to strong/weak bisimulation, and process behaviour can be examined by playing (bi)simulation and model checking games or via the generation of distinguishing formulae for non-equivalent processes. We describe the modelling and analysis features of Caal, discuss the underlying verification algorithms and show a typical example of a use in the classroom environment.
KeywordsModel Check Dependency Graph Label Transition System Process Algebra Game Module
- 3.Birgisson, A.: CCS model checker in Haskell (2009). https://github.com/arnar/ccs-searching. Accessed on 03 August 2015
- 7.Freiberger, F., Biewer, S., Held, P.: PseuCo (2014). http://pseuco.com. Accessed on 03 August 2015
- 15.Mosegaard, M., Brabrand, C.: The bisimulation game (2006). http://www.brics.dk/bisim/. Accessed on 03 August 2015
- 16.Verdejo, A., Marti-Oliet, N.: Executing and verifying CCS in Maude. Technical report, Dpto. Sistemas Informaticos y Programacion, Universidad Complutense de (2002). http://maude.cs.uiuc.edu/maude1/casestudies/ccs/