The Edinburgh Concurrency Workbench: a tool for describing, exploring and automatically verifying systems. Edinburgh Concurrency Workbench Summary: The Edinburgh Concurrency Workbench (CWB) is an automated tool which caters for the manipulation and analysis of concurrent systems. In particular, the CWB allows for various equivalence, preorder and model checking using a variety of different process semantics. For example, with the CWB it is possible to: define behaviours given either in an extended version of CCS or in SCCS, and perform various analyses on these behaviours, such as analysing the state space of a given process, or checking various semantic equivalences and preorders; define propositions in a powerful modal logic and check whether a given process satisfies a specification formulated in this logic; play Stirling-style model-checking games to understand why a process does or does not satisfy a formula; derive automatically logical formulae which distinguish nonequivalent processes; interactively simulate the behaviour of an agent, thus guiding it through its state space in a controlled fashion.
Keywords for this software
References in zbMATH (referenced in 12 articles )
Showing results 1 to 12 of 12.
- Yang, Jiannan; Cao, Yongzhi; Wang, Hanpin: Differential privacy in probabilistic systems (2017)
- Gorrieri, Roberto; Versari, Cristian: Introduction to concurrency theory. Transition systems and CCS (2015)
- Bulychev, P. E.: Game-theoretic simulation checking tool (2011)
- Curcin, Vasa; Ghanem, Moustafa M.; Guo, Yike: Analysing scientific workflows with computational tree logic (2009) ioport
- Fraikin, Benoît; Frappier, Marc: Efficient symbolic computation of process expressions (2009)
- Garavel, Hubert: Reflections on the future of concurrency theory in general and process calculi in particular (2008)
- Baeten, J. C. M.: A brief history of process algebra (2005)
- Kapoor, Hemangee K.; Josephs, Mark B.: Modelling and verification of delay-insensitive circuits using CCS and the concurrency workbench (2004)
- Salaün, Gwen; Attiogbé, Christian: MIAOw: a method to integrate a process algebra with formal data (2004)
- Dennis, L. A.; Bundy, A.; Green, I.: Making a productive use of failure to generate witnesses for coinduction from divergent proof attempts (2000)
- Pengelly, A. D.; Ince, D. C.: Quotient machines, the interface equation and protocol conversion (2000)
- Schumann, Johann: Automated theorem proving in high-quality software design (2000)