{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:43Z","timestamp":1725663883834},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539827"},{"type":"electronic","value":"9783540465638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53982-4_21","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:20:14Z","timestamp":1330190414000},"page":"381-396","source":"Crossref","is-referenced-by-count":10,"title":["On the complexity of equation solving in process algebra"],"prefix":"10.1007","author":[{"given":"Bengt","family":"Jonsson","sequence":"first","affiliation":[]},{"given":"Kim Guldstrand","family":"Larsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. J. ACM, 31(3):560\u2013599, 1984.","journal-title":"J. ACM"},{"key":"21_CR2","unstructured":"J Bergstra and J Klop. Verification of an alternating bit protocol by means of process algebra. Technical report, Centrum voor Wiskunde en Informatica, 1984."},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77\u2013121, 1985.","journal-title":"Theoretical Computer Science"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"G\u00e9rard Boudol and Kim G. Larsen. Graphical versus logical specifications. Lecture Notes in Computer Science, 431, 1990. In Proceedings of CAAP90.","DOI":"10.1007\/3-540-52590-4_40"},{"key":"21_CR5","unstructured":"G. Boudol. Calcul de processus et verification. Technical Report 424, INRIA, 1985."},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E. Clarke","year":"1982","unstructured":"E. Clarke and E.A. Emerson. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241\u2013266, 1982.","journal-title":"Science of Computer Programming"},{"key":"21_CR7","unstructured":"Garey and Johnson. Computers and Intractability: A guide to the Theory of NP-Completeness. Freeman, 1979."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Hans H\u00fcttel and Kim G. Larsen. The use of static constructs in a modal process logic. Lecture Notes in Computer Science, 363, 1989.","DOI":"10.1007\/3-540-51237-3_14"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8), 1978.","DOI":"10.1145\/359576.359585"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"B. Jonsson and K.G. Larsen. On the complexity of equation solving in process algebra. Technical report, Swedish Institute of Computer Science, 1991.","DOI":"10.1007\/3-540-53982-4_21"},{"issue":"1","key":"21_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(85)90002-4","volume":"5","author":"C. Koomen","year":"1985","unstructured":"C. Koomen. Algebraic specification and verification of protocols. Science of Computer Programming, 5(1):1\u201336, 1985.","journal-title":"Science of Computer Programming"},{"key":"21_CR12","unstructured":"Kannellakis and Smolka. CCS expressions, finite state processes, and three problems of equivalence. To appear in Information and Computation."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"K.G. Larsen. Modal specifications. Lecture Notes in Computer Science, 407, 1990.","DOI":"10.1007\/3-540-52148-8_19"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Kim G. Larsen and Robin Milner. Verifying a protocol using relativized bisimulation. In Proc. ICALP '87, volume 267 of Lecture Notes of Computer Science. Springer Verlag, 1987.","DOI":"10.1007\/3-540-18088-5_11"},{"key":"21_CR15","unstructured":"P. Lewis and H. Qin. Factorization of finite state machines under observational equivalence. Lecture Notes in Computer Science, 458, 1990."},{"key":"21_CR16","unstructured":"Kim G. Larsen and Bent Thomsen. A modal process logic. In Proceedings on Logic in Computer Science, 1988."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. Lecture Notes in Computer Science, 1990. To appear in Proceedings of ICALP90.","DOI":"10.1007\/BFb0032056"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"K.G. Larsen and L. Xinxin. Equation solving using modal transition systems. In Proceedings on Logic in Computer Science, 1990.","DOI":"10.1109\/LICS.1990.113738"},{"issue":"1","key":"21_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/357195.357196","volume":"5","author":"P. Merlin","year":"1983","unstructured":"Philip Merlin and Gregor von Bochmann. On the construction of submodule specifications and communication protocols. ACM Transactions on Programming Languages and Systems, 5(1):1\u201325, 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"R. Milner. Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25, 1983.","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"21_CR22","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"issue":"1","key":"21_CR23","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/357233.357237","volume":"6","author":"Z. Manna","year":"1984","unstructured":"Zohar Manna and Pierre Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68\u201393, 1984.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, 104, 1981. in Proc. of 5th GI Conf.","DOI":"10.1007\/BFb0017309"},{"key":"21_CR25","unstructured":"Joachim Parrow. Verifying a csma\/cd-protocol with ccs. Technical Report ECS-LFCS-87-18, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1987. To appear in Protocol Specification, Testing, and Verification VIII (1988)."},{"key":"21_CR26","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(89)90128-X","volume":"68","author":"J. Parrow","year":"1989","unstructured":"J. Parrow. Submodule construction as equation solving in CCS. Theoretical Computer Science, 68:175\u2013202, 1989.","journal-title":"Theoretical Computer Science"},{"key":"21_CR27","volume-title":"A structural approach to operational semantics. FN 19, DAIMI","author":"G. Plotkin","year":"1981","unstructured":"G. Plotkin. A structural approach to operational semantics. FN 19, DAIMI, Aarhus University, Denmark, 1981."},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. Lecture Notes in Computer Science, 194, 1985. in Proc. of ICALP'87.","DOI":"10.1007\/BFb0015727"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"A. Pnueli and R. Rossner. On the synthesis of a reactive module. In Proc. 16:th ACM Symp. on Principles of Programming Languages, pages 179\u2013190, 1989.","DOI":"10.1145\/75277.75293"},{"key":"21_CR30","unstructured":"S.A. Smolka, A.J. Frank, and S.K. Debray. Testing protocol robustness the CCS way. In Protocol Specification, Testing, and Verification IV (1984), pages 93\u2013108, 1985. North-Holland."},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"M.W. Shields. A note on the simple interface equation. The Computer Journal, 32(5), 1989.","DOI":"10.1093\/comjnl\/32.5.399"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53982-4_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:51:49Z","timestamp":1605628309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53982-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539827","9783540465638"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-53982-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}