{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:48:30Z","timestamp":1762458510921,"version":"3.32.0"},"reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0084783","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"62-76","source":"Crossref","is-referenced-by-count":16,"title":["Verification of parallel systems via decomposition"],"prefix":"10.1007","author":[{"given":"Jan Friso","family":"Groote","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faron","family":"Moller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, J.-C. Fernandez and N. Halbwachs. Minimal model generation. Draft, 1991.","DOI":"10.1090\/dimacs\/003\/08"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking 1020 states and beyond. In Proceedings 5 th Annual Symposium on Logic in Computer Science, Philadelphia, USA, pages 428\u2013439, 1990.","DOI":"10.1109\/LICS.1990.113767"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"S.A. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3 rd Annual ACM Symposium on Theory of Computing, Shaker Heights, Ohio, pages 151\u2013158, 1971.","DOI":"10.1145\/800157.805047"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0304-3975(85)90028-3","volume":"36","author":"J. Engelfriet","year":"1985","unstructured":"J. Engelfriet. Determinacy \u2192 (observation equivalence = trace equivalence). Theoretical Computer Science, 36(1):21\u201325, 1985.","journal-title":"Theoretical Computer Science"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6423(90)90071-K","volume":"13","author":"J.-C. Fernandez","year":"1989\/1990","unstructured":"J.-C. Fernandez. An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming, 13:219\u2013236, 1989\/1990.","journal-title":"Science of Computer Programming"},{"key":"6_CR7","unstructured":"J.-C. Fernandez and L. Mounier. \u201cOn the fly\u201d verification of behavioural equivalences and preorders. In K.G. Larsen, editors, Proceedings CAV'91, Aalborg, pages 238\u2013250. 1991."},{"key":"6_CR8","first-page":"278","volume-title":"volume 458 of Lecture Notes in Computer Science","author":"R.J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek. The linear time \u2014 branching time spectrum. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR '90, Amsterdam, volume 458 of Lecture Notes in Computer Science, pages 278\u2013297. Springer-Verlag, 1990."},{"key":"6_CR9","series-title":"volume 372 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BFb0035774","volume-title":"Proceedings 16th ICALP","author":"J.F. Groote","year":"1989","unstructured":"J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence (extended abstract). In G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, editors, Proceedings 16 th ICALP, Stresa, volume 372 of Lecture Notes in Computer Science, pages 423\u2013438. Springer-Verlag, 1989. Full version to appear in Information and Computation."},{"key":"6_CR10","series-title":"volume 443 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/BFb0032063","volume-title":"Proceedings 17th ICALP","author":"J.F. Groote","year":"1990","unstructured":"J.F. Groote and F.W. Vaandrager. An efficient algorithm for branching bisimulation and stuttering equivalence. In M.S. Paterson, editor, Proceedings 17 th ICALP, Warwick, volume 443 of Lecture Notes in Computer Science, pages 626\u2013638. Springer-Verlag, 1990."},{"key":"6_CR11","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985."},{"key":"6_CR12","unstructured":"G.J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall International, 1991."},{"key":"6_CR13","series-title":"volume 527 of Lecture Notes in Computer Science","first-page":"471","volume-title":"Proceedings CONCUR'91","author":"H. Qin","year":"1991","unstructured":"H. Qin. Efficient verification of determinate processes. In J.C.M. Baeten and J.F. Groote, editors, Proceedings CONCUR'91, Amsterdam, volume 527 of Lecture Notes in Computer Science, pages 471\u2013494. Springer-Verlag, 1991."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P.C. Kanellakis","year":"1990","unstructured":"P.C. Kanellakis and S.A. Smolka. CCS expressions, finite-state processes, and three problems of equivalence. Information and Compulation, 86:43\u201368, 1990.","journal-title":"Information and Compulation"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"6_CR16","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, 1989."},{"key":"6_CR17","first-page":"226","volume":"41","author":"R. Milner","year":"1990","unstructured":"R. Milner and F. Moller. Unique decomposition of processes. Bulletin of the European Association for Theoretical Computer Science, 41:226\u2013232, 1990.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"6_CR18","unstructured":"F. Moller. Axioms for concurrency. PhD thesis, Report CST-59-89, Department of Computer Science, University of Edinburgh, 1989."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"A. Rabinovich. Checking equivalences between concurrent systems of finite agents. Draft, 1991.","DOI":"10.1007\/3-540-55719-9_115"}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084783.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T03:55:24Z","timestamp":1736654124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540558224"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0084783","relation":{},"subject":[]}}