{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:23:24Z","timestamp":1778300604788,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540614746","type":"print"},{"value":"9783540685999","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61474-5_87","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:41:30Z","timestamp":1330274490000},"page":"394-397","source":"Crossref","is-referenced-by-count":90,"title":["The NCSU Concurrency Workbench"],"prefix":"10.1007","author":[{"given":"Rance","family":"Cleaveland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Sims","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"35_CR1","unstructured":"The NCSU Concurrency Workbench home page. URL http:\/\/www4.ncsu.edu\/eos\/users\/r\/rance\/WWW\/ncsu-cw.html."},{"key":"35_CR2","first-page":"107","volume-title":"Margaria and Steffen","author":"G. Bhat","year":"1996","unstructured":"G. Bhat and R. Cleaveland. Efficient local model checking for fragments of the modal \u03bc-calculus. In Margaria and Steffen [13], pages 107\u2013126."},{"key":"35_CR3","unstructured":"U. Celikkan. Semantic Preorders in the Automated Verification of Concurrent Systems. PhD thesis, North Carolina State University, 1995."},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/B978-0-444-89874-6.50023-4","volume-title":"Proceedings of the IFIP Symposium on Protocol Specification, Testing and Verification","author":"U. Celikkan","year":"1992","unstructured":"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\u2013278, Lake Buena Vista, Florida, June 1992. North-Holland."},{"key":"35_CR5","first-page":"364","volume-title":"Computer Aided Verification (CAV '90), volume 531 of Lecture Notes in Computer Science","author":"R. Cleaveland","year":"1990","unstructured":"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\u2013372, Piscataway, NJ, June 1990. Springer-Verlag."},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01211314","volume":"5","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland and M.C.B. Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5:1\u201320, 1993.","journal-title":"Formal Aspects of Computing"},{"key":"35_CR7","first-page":"278","volume-title":"Margaria and Steffen","author":"R. Cleaveland","year":"1996","unstructured":"R. Cleaveland, G. Luettgen, V. Natarajan, and S. Sims. Priorities for verifying distributed systems. In Margaria and Steffen [13], pages 278\u2013297."},{"key":"35_CR8","first-page":"153","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems (TACAS '95), volume 1019 of Lecture Notes in Computer Science","author":"R. Cleaveland","year":"1995","unstructured":"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\u2013173, Aarhus, Denmark, May 1995. Springer-Verlag."},{"issue":"1","key":"35_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"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\u201372, January 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01383878","volume":"2","author":"R. Cleaveland","year":"1993","unstructured":"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\u2013147, 1993.","journal-title":"Formal Methods in System Design"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF01200261","volume":"12","author":"W. Elseaidy","year":"1996","unstructured":"W. Elseaidy, J. Baugh, and R. Cleaveland. Verification of an active control system using temporal process algebra. Engineering with Computers, 12:46\u201361, 1996.","journal-title":"Engineering with Computers"},{"key":"35_CR12","unstructured":"J. Gray. A CSP interface for the concurrency workbench. Undergraduate Honors Thesis, Department of Computer Science, North Carolina State University, May 1996."},{"key":"35_CR13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems (TACAS '96), volume 1055 of Lecture Notes in Computer Science","year":"1996","unstructured":"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."},{"key":"35_CR14","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989."},{"key":"35_CR15","unstructured":"F. MoDer and P. Stevens. The Edinburgh Concurrency Workbench (Version 7.0). University of Edinburgh, November 1994."},{"issue":"6","key":"35_CR16","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973\u2013989, December 1987.","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61474-5_87.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:32:18Z","timestamp":1619559138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61474-5_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614746","9783540685999"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-61474-5_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}