{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:50:52Z","timestamp":1664038252639},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540539117","type":"print"},{"value":"9783642765629","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/978-3-642-76562-9_13","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T09:47:41Z","timestamp":1326707261000},"page":"208-226","source":"Crossref","is-referenced-by-count":2,"title":["Computer Aided Verification of Parallel Processes"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Estenfeld","sequence":"first","affiliation":[]},{"given":"Hans-Albert","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Dirk","family":"Taubner","sequence":"additional","affiliation":[]},{"given":"Erik","family":"Tid\u00e9n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"JA 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":"13_CR2","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S Brookes","year":"1984","unstructured":"S. Brookes, C. Hoare, and A. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31:560\u2013599, 1984.","journal-title":"Journal of the ACM"},{"key":"13_CR3","series-title":"LFCS Report Series ECS-LFCS-89\u201383","volume-title":"The concurrency workbench: A semantics based tool for the verification of concurrent systems","author":"R Cleaveland","year":"1989","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics based tool for the verification of concurrent systems. LFCS Report Series ECS-LFCS-89\u201383, LFCS University of Edinburgh, August 1989."},{"key":"13_CR4","first-page":"267","volume-title":"Efficient model checking in fragments of the propositional mu-calculus","author":"EA Emerson","year":"1986","unstructured":"E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proc. of the First Annual Symp. on Logic in Computer Science, pages 267\u2013278. Computer Society Press, 1986."},{"key":"13_CR5","series-title":"Technical Report RTC","volume-title":"Aldebaran a tool for verification of communicating processes","author":"J-C Fernandez","year":"1989","unstructured":"J.-C. Fernandez. Aldebaran a tool for verification of communicating processes. Technical Report RTC 14, IMAG, Grenoble, October 1989."},{"key":"13_CR6","series-title":"Technical Report R-89\u201319","volume-title":"TAV(Tools for Automatic Verification) users manual","author":"JC Godskesen","year":"1989","unstructured":"J. C. Godskesen, K. G. Larsen, and M. Zeeberg. TAV (Tools for Automatic Verification) users manual. Technical Report R-89\u201319, University of Aalborg, August 1989."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"An efficient algorithm for branching bisimulation and stuttering equivalence","author":"JF Groote","year":"1990","unstructured":"J. F. Groote and F. Vaandrager. An efficient algorithm for branching bisimulation and stuttering equivalence. In ICALP \u201990, Lecture Notes in Computer Science, Berlin, 1990. Springer."},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137\u2013161, 1985.","journal-title":"Journal of the ACM"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"D. Kozen. Results on the propositional \u00b5-calculus. Theoretical Computer Science, 27:333\u2013354, 1983.","journal-title":"Theoretical Computer Science"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BFb0026106","volume-title":"Proof systems for Hennessy - Milner logic with recursion","author":"KG Larsen","year":"1988","unstructured":"K. G. Larsen. Proof systems for Hennessy - Milner logic with recursion. In M. Dauchet and M. Nivat, editors, CAAP \u201988, volume 299 of Lecture Notes in Computer Science, pages 215\u2013230, Berlin, 1988. Springer. Nancy, 1988."},{"key":"13_CR11","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69897-2","volume-title":"Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness","author":"K Mehlhorn","year":"1984","unstructured":"K. Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, volume 2 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1984."},{"key":"13_CR12","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, New York, 1989."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","volume":"81","author":"R Milner","year":"1989","unstructured":"R. Milner. A complete axiomatisation for observational congruence of finite-state behaviours. Information and Computation, 81:227\u2013247, 1989.","journal-title":"Information and Computation"},{"issue":"6","key":"13_CR14","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 J. Comput., 16(6):973\u2013989, 1987.","journal-title":"SIAM J. Comput."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D Park","year":"1981","unstructured":"D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science, pages 167\u2013183, Springer, Berlin, 1981."},{"key":"13_CR16","first-page":"369","volume-title":"Local model checking in the modal mu-calculus","author":"C Stirling","year":"1989","unstructured":"C. Stirling and D. Walker. Local model checking in the modal mu-calculus. In J. Diaz and F. Orejas, editors, TAPSOFT \u201989. Volume 1., Proceedings, Barcelona 1989, volume 351 of Lecture Notes in Computer Science, pages 369\u2013383, Berlin, 1989. Springer."},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"R. Tarjan. Depth first search and linear graph algorithms. SIAM J. Computing, 1(2):146\u2013160, 1972.","journal-title":"SIAM J. Computing"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-51525-9","volume-title":"Finite Representations of CCS and TCSP Programs by Automata and Petri Nets","author":"D Taubner","year":"1989","unstructured":"D. Taubner. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets, volume 369 of Lecture Notes in Computer Science. Springer, Berlin, 1989."},{"key":"13_CR19","series-title":"Rapports de Recherche","volume-title":"Verification by means of observational equivalence on automata","author":"D Vergamini","year":"1986","unstructured":"D. Vergamini. Verification by means of observational equivalence on automata. Rapports de Recherche 501, INRIA, March 1986."},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/BFb0035797","volume-title":"Automata, Languages and Programming","author":"G Winskel","year":"1989","unstructured":"G. Winskel. A note on model checking the modal \u03bd-calculus. In G. Ausiello, M. Dezani- Ciancaglini, and S. Ronchi Della Rocca, editors, Automata, Languages and Programming. Proceedings Stresa, Italy, volume 372 of Lecture Notes in Computer Science, pages 761\u2013772, Berlin, 1989. Springer."}],"container-title":["VIS \u201991 Verl\u00e4\u00dfliche Informationssysteme","Informatik-Fachberichte"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-76562-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T03:10:16Z","timestamp":1606273816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-76562-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540539117","9783642765629"],"references-count":20,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-76562-9_13","relation":{},"ISSN":["0343-3005"],"issn-type":[{"value":"0343-3005","type":"print"}],"published":{"date-parts":[[1987]]}}}