The NCSU concurrency workbench

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1102, Issue , 1996, Pages 394-397

  Cleaveland, Rance ^a   Sims, Steve ^a  

^a North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FINITE STATE SYSTEMS; ITS APPLICATIONS; KEY FEATURE; MODULAR DESIGNS;

COMPUTER AIDED ANALYSIS;

EID: 84957366381     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61474-5_87     Document Type: Conference Paper

References (16)

1. The NCSU Concurrency Workbench home page. URL http://www4.ncsu.edu/eos/users/r/rance/WWW/ncsu-cw.html.
2. G. Bhat and R. Cleaveland. Efficient local model checking for fragments of the modal p-calculus. In Margaria and Steifen [13], pages 107-126.
3. U. Celikkan. Semantic Preorders in the Automated Verification of Concurrent Systems. PhD thesis, North Carolina State University, 1995.
4. U. Celikkan and R. Cleaveland. Computing diagnostic tests for incorrect processes. In proceedings ot the IFIP Symposium on Protocol Specification, Testing and Verification, pages 263-278, Lake Buena Vista, Florida, June 1992. North-Holland.
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, N J, June 1990. Springer-Verlag.
6. R. Cleaveland and M.C.B. Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5:1-20, 1993.
7. R. Cleaveland, G. Luettgen, V. Natarajan, and S. Sims. Priorities for verifying distributed systems. In Margaria and Steffen [13], pages 278-297.
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 lot 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.
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.
10. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calcahs. Formal Methods in System Design, 2:121-147, 1993.
11. W. Elseaidy, J. Bangh, and R. Cleaveland. Verification of an active control system using temporal process algebra. Engineering with Computers, 12:46-61, 1996.
12. J. Gray. A CSP interface for the concurrency workbench. Undergraduate Honors Thesis, Department of Computer Science, North Carolina State University, May 1996.
13. T. Margaria and B. Steffen, editors. Tools and Algorithms for the Construction and Analysis o] Systems (TA CAS '96), volume 1055 of Lecture Notes in Computer Science, Passan, Germany, March 1996. Springer-Verlag.
14. R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989.
15. F. Moiler and P. Stevens. The Edinburgh Concurrency Workbench (Version 7.0). University of Edinburgh, November 1994.
16. R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973-989, December 1987.