{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300913},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614746"},{"type":"electronic","value":"9783540685999"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61474-5_88","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:41:29Z","timestamp":1330274489000},"page":"398-401","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["The Concurrency Factory: A development environment for concurrent systems"],"prefix":"10.1007","author":[{"given":"Rance","family":"Cleaveland","sequence":"first","affiliation":[]},{"given":"Philip M.","family":"Lewis","sequence":"additional","affiliation":[]},{"given":"Scott A.","family":"Smolka","sequence":"additional","affiliation":[]},{"given":"Oleg","family":"Sokolsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"36_CR1","first-page":"109","volume":"60","author":"J. A. Bergstra","year":"1984","unstructured":"J. A. Bergstra and J. W. Klop. Process algebra for synchronous communication. Information and Computation, 60:109\u2013137, 1984.","journal-title":"Information and Computation"},{"key":"36_CR2","first-page":"75","volume-title":"Proceedings of DIMACS Workshop on Specification of Parallel Algorithms, volume 18 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"R. Cleaveland","year":"1994","unstructured":"R. Cleaveland, J. N. Gada, P. M. Lewis, S. A. Smolka, O. Sokolsky, and S. Zhang. The concurrency factory \u2014 practical tools for specification, simulation, verification, and implementation of concurrent systems. In G.E. Blelloch, K.M. Chandy, and S. Jagannathan, editors, Proceedings of DIMACS Workshop on Specification of Parallel Algorithms, volume 18 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 75\u201390, Princeton, NJ, May 1994. American Mathematical Society."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and B. U. Steffen. A linear-time model checking algorithm for the alternation-free modal mu-calculus. Formal Methods in System Design, 2, 1993.","DOI":"10.1007\/BF01383878"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmertric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2), 1989.","DOI":"10.1007\/BF01491213"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231\u2013274, 1987.","journal-title":"Science of Computer Programming"},{"key":"36_CR6","volume-title":"Communicating Sequential Processes","author":"C. A. R. Hoare","year":"1985","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, London, 1985."},{"key":"36_CR7","unstructured":"S. Jain. VTSIM: A graphical simulator for finite-state networks. Master's thesis, Department of Computer Science, North Carolina State University, 1993."},{"key":"36_CR8","unstructured":"Ninth Annual Symposium on Logic in Computer Science (LICS '94), Versailles, France, July 1994. Computer Society Press."},{"key":"36_CR9","first-page":"38","volume-title":"Proc. CAV '89, volume 407 of Lecture Notes in Computer Science","author":"F. Maraninchi","year":"1989","unstructured":"F. Maraninchi. Argonaute, graphical description, semantics and verification of reactive systems by using a process algebra. In Proc. CAV '89, volume 407 of Lecture Notes in Computer Science, pages 38\u201353, Grenoble, June 1989. Springer-Verlag."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"R. Milner. A proposal for standard ML. Technical Report CSR-157-83, Department of Computer Science, University of Edinburgh, 1984.","DOI":"10.1145\/800055.802035"},{"key":"36_CR11","unstructured":"R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989."},{"key":"36_CR12","unstructured":"G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981."},{"key":"36_CR13","volume-title":"PhD thesis","author":"O. Sokolsky","year":"1996","unstructured":"O. Sokolsky. Efficient Graph-Based Algorithms for Model Checking in the Modal Mu-Calculus. PhD thesis, Department of Computer Science, SUNY at Stony Brook, April 1996."},{"key":"36_CR14","unstructured":"O. Sokolsky and S. A. Smolka. Incremental model checking. In Proceedings of the 6th International Conference on Computer-Aided Verification. American Mathematical Society, 1994."},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"O. Sokolsky and S. A. Smolka. Local model checking for real-time systems. In Proceedings of the 7th International Conference on Computer-Aided Verification. American Mathematical Society, 1995.","DOI":"10.1007\/3-540-60045-0_52"},{"key":"36_CR16","unstructured":"V. Trehan. VTVIEW: A graphical editor for hierarchical networks of finitestate processes. Master's thesis, Department of Computer Science, North Carolina State University, December 1992."},{"key":"36_CR17","unstructured":"S. Zhang and S. A. Smolka. Efficient parallelization of equivalence checking algorithms. In M. Dias and R. Groz, editors, Proceedings of FORTE '92-Fifth International Conference on Formal Description Techniques, pages 133\u2013146, October 1992."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61474-5_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:40:53Z","timestamp":1558255253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61474-5_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614746","9783540685999"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61474-5_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}