Abstract
The Concurrency Workbench is an automated tool that caters for the analysis of networks of finite-state processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its scope: a variety of different verification methods, including equivalence checking, preorder checking, and model checking, are supported for several different process semantics. One experience from our work is that a large number of interesting verification methods can be formulated as combinations of a small number of primitive algorithms. The Workbench has been applied to examples involving the verification of communications protocols and mutual exclusion algorithms and has proven a valuable aid in teaching and research.
Keywords
- Model Check
- Graph Transformation
- Equivalence Check
- Transition Graph
- Verification Method
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Research supported by Science and Engineering Research Council grant GC/D69464
Download conference paper PDF
References
Bloom, B., S. Istrail and A. Meyer. “Bisimulation Can't Be Traced.” Proceedings of the ACM Symposium on Principles of Programming Languages, 1988.
Bochmann, G., “Usage of Protocol Development Tools: The Results of a Survey.” In Proceeding of the Seventh IFIP Symposium on Protocol Specification, Testing, and Verification, 1987, North-Holland.
Boudol, G., de Simone, R. and Vergamini, D. “Experiment with Auto and Autograph an a Simple Case Sliding Window Protocol.” Inria Report 870, July 1988
Clarke, E.M. “Compositional Model Checking.” This volume.
Clarke, E.M., Emerson, E. and Sistla, A.P. “Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications.” ACM Transactions on Programming Languages and Systems, v. 8, n. 2, 1986, pp. 244–263.
Cleaveland, R. “Tableau-Based Model Checking in the Propositional Mu-Calculus.” University of Sussex Technical Report 2/89, March 1989.
Cleaveland, R. and Hennessy, M.C.B. “Testing Equivalence as a Bisimulation Equivalence.” This volume.
Cleaveland, R., Parrow, J and Steffen, B. The Concurrency Workbench: Operating Instructions, University of Edinburgh, Laboratory for Foundations of Computer Science, Technical Note 10, September 1988.
Cleaveland, R., Parrow, J and Steffen, B. The Concurrency Workbench: A Semantics-Based Verification Tool for Finite-State Systems, University of Edinburgh, Laboratory for Foundations of Computer Science, Technical Report ECS-LFCS-89-83, June 1989.
DeNicola, R. and Hennessy, M.C.B. “Testing Equivalences for Processes.” Theoretical Computer Science, v. 34, 1983, pp. 83–133.
Emerson, E.A. and Lei, C.-L. “Efficient Model Checking in Fragments of the Propositional Mu-Calculus.” In Proceedings of the First Annual Symposium on Logic in Computer Science, 1986, pp. 267–278.
Fernandez, J.-C. Aldébaran: Une Système de Vérification par Réduction de Processus Communicants. Ph.D. Thesis, Université de Grenoble, 1988.
Hennessy, M.C.B. Algebraic Theory of Processes. MIT Press, Boston, 1988.
Hillerström, M. Verification of CCS-processes. M.Sc. Thesis, Computer Science Department, Aalborg University, 1987.
Hoare, C.A.R. Communicating Sequential Processes. Prentice-Hall, London, 1985.
Hopcroft, J. and Ullman, J. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, 1979.
Jonsson, B., Kahn, A., and Parrow, J. “Implementing a Model Checking Algorithm by Adapting Existing Automated Tools.” This volume.
Jonsson, B. and Parrow, J. “Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs.” In Proceedings of the Sixth Annual Symposium on Theoretical Aspects of Computer Science, 1989. Lecture Notes in Computer Science 349, pp. 421–433. Springer-Verlag, Berlin, 1989.
Kanellakis, P. and Smolka, S.A. “CCS Expressions, Finite State Processes, and Three Problems of Equivalence.” In Proceedings of the Second ACM Symposium on the Principles of Distributed Computing, 1983.
Larsen, K.G. “Proof Systems for Hennessy-Milner Logic with Recursion.” In Proceedings of CAAP, 1988.
Larsen, K. and A. Skou. “Bisimulation through Probabilistic Testing.” Proceedings of the ACM Symposium on Principles of Programming Languages, 1989.
Lee, C.-H. “Implementering av CCS med värdeöverföring.” SICS Technical Report 1989 (in Swedish).
Malhotra, J., Smolka, S.A., Giacalone, A. and Shapiro, R. “Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems.” In Proceedings of the Workshop on Specification and Verification of Concurrent Systems, University of Stirling, Scotland, 1988.
Milner, R. Communication and Concurrency. Prentice Hall 1989.
Paige, R. and Tarjan, R.E. “Three Partition Refinement Algorithms.” SIAM Journal of Computing, v. 16, n. 6, December 1987, pp. 973–989.
Parrow, J. “Submodule Construction as Equation Solving in CCS.” In Proceedings of the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 287, pp. 103–123. Springer-Verlag, Berlin, 1987.
Parrow, J. “Verifying a CSMA/CD-Protocol with CCS.” In Proceeding of the Seventh IFIP Symposium on Protocol Specification, Testing, and Verification, 1987, North-Holland.
Richier, J., Rodriguez, C., Sifakis, J. and Voiron, J., “Verification in XESAR of the Sliding Window Protocol.” In Proceedings of the Seventh IFIP Symposium on Protocol Specification, Testing, and Verification, 1987, North-Holland.
Steffen, B. “Characteristic Formulae.” In Proceedings ICALP, 1989.
Stirling, C. “Modal Logics for Communicating Systems.” Theoretical Computer Science, v. 49, 1987, pp. 311–347.
Stirling, C. and Walker, D.J. “Local Model Checking in the Model Mu-Calculus”, In Proceedings TAPSOFT, 1989.
Walker, D.J. “Bisimulation Equivalence and Divergence in CCS.” In Proceedings of the Third Annual Symposium on Logic in Computer Science, 1988, pp. 186–192.
Walker, D.J. “Analysing Mutual Exclusion Algorithms Using CCS.” University of Edinburgh Technical Report ECS-LFCS-88-45, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cleaveland, R., Parrow, J., Steffen, B. (1990). The concurrency workbench. In: Sifakis, J. (eds) Automatic Verification Methods for Finite State Systems. CAV 1989. Lecture Notes in Computer Science, vol 407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52148-8_3
Download citation
DOI: https://doi.org/10.1007/3-540-52148-8_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52148-8
Online ISBN: 978-3-540-46905-6
eBook Packages: Springer Book Archive