The NCSU Concurrency Workbench

  • Rance Cleaveland
  • Steve Sims
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1102)


The NCSU Concurrency Workbench is a tool for verifying finite-state systems. A key feature is its flexibility; its modular design eases the task of adding new analyses and changing the language users employ for describing systems. This note gives an overview of the system's features, including its capacity for generating diagnostic information for incorrect systems, and discusses some of its applications.


  1. 1.
    The NCSU Concurrency Workbench home page. URL Scholar
  2. 2.
    G. Bhat and R. Cleaveland. Efficient local model checking for fragments of the modal μ-calculus. In Margaria and Steffen [13], pages 107–126.Google Scholar
  3. 3.
    U. Celikkan. Semantic Preorders in the Automated Verification of Concurrent Systems. PhD thesis, North Carolina State University, 1995.Google Scholar
  4. 4.
    U. Celikkan and R. Cleaveland. Computing diagnostic tests for incorrect processes. In Proceedings of the IFIP Symposium on Protocol Specification, Testing and Verification, pages 263–278, Lake Buena Vista, Florida, June 1992. North-Holland.Google Scholar
  5. 5.
    R. Cleaveland. On automatically explaining bisimulation inequivalence. In E.M. Clarke and R.P. Kurshan, editors, Computer Aided Verification (CAV '90), volume 531 of Lecture Notes in Computer Science, pages 364–372, Piscataway, NJ, June 1990. Springer-Verlag.Google Scholar
  6. 6.
    R. Cleaveland and M.C.B. Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5:1–20, 1993.CrossRefGoogle Scholar
  7. 7.
    R. Cleaveland, G. Luettgen, V. Natarajan, and S. Sims. Priorities for verifying distributed systems. In Margaria and Steffen [13], pages 278–297.Google Scholar
  8. 8.
    R. Cleaveland, E. Madelaine, and S. Sims. A front-end generator for verification tools. In E. Brinksma, R. Cleaveland, K.G. Larsen, and B. Steffen, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS '95), volume 1019 of Lecture Notes in Computer Science, pages 153–173, Aarhus, Denmark, May 1995. Springer-Verlag.Google Scholar
  9. 9.
    R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics-based tool for the verification of finite-state systems. ACM Transactions on Programming Languages and Systems, 15(1):36–72, January 1993.CrossRefGoogle Scholar
  10. 10.
    R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. Formal Methods in System Design, 2:121–147, 1993.CrossRefGoogle Scholar
  11. 11.
    W. Elseaidy, J. Baugh, and R. Cleaveland. Verification of an active control system using temporal process algebra. Engineering with Computers, 12:46–61, 1996.CrossRefGoogle Scholar
  12. 12.
    J. Gray. A CSP interface for the concurrency workbench. Undergraduate Honors Thesis, Department of Computer Science, North Carolina State University, May 1996.Google Scholar
  13. 13.
    T. Margaria and B. Steffen, editors. Tools and Algorithms for the Construction and Analysis of Systems (TACAS '96), volume 1055 of Lecture Notes in Computer Science, Passau, Germany, March 1996. Springer-Verlag.Google Scholar
  14. 14.
    R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989.Google Scholar
  15. 15.
    F. MoDer and P. Stevens. The Edinburgh Concurrency Workbench (Version 7.0). University of Edinburgh, November 1994.Google Scholar
  16. 16.
    R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973–989, December 1987.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Rance Cleaveland
    • 1
  • Steve Sims
    • 1
  1. 1.Department of Computer ScienceNorth Carolina State UniversityRaleighUSA

Personalised recommendations