{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T12:26:17Z","timestamp":1749644777754},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:32:25Z","timestamp":1330295545000},"page":"88-99","source":"Crossref","is-referenced-by-count":13,"title":["Weak bisimulation and model checking for Basic Parallel Processes"],"prefix":"10.1007","author":[{"given":"Richard","family":"Mayr","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"unstructured":"S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, Edinburgh University, 1993.","key":"8_CR1"},{"doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. In E. Best, editor, Proceedings of CONCUR 93, number 715 in LNCS. Springer Verlag, 1993.","key":"8_CR2","DOI":"10.1007\/3-540-57208-2_11"},{"unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation equivelence is decidable for all context-free processes. In W.R. Cleaveland, editor, Proceedings of CONCUR 92, number 630 in LNCS. Springer Verlag, 1992.","key":"8_CR3"},{"unstructured":"Javier Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 1995.","key":"8_CR4"},{"doi-asserted-by":"crossref","unstructured":"Javier Esparza. Petri nets, commutative context-free grammars and basic parallel processes. In Horst Reichel, editor, Fundamentals of Computation Theory, number 965 in LNCS. Springer Verlag, 1995.","key":"8_CR5","DOI":"10.1007\/3-540-60249-6"},{"doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld. Petri nets and the equivalence problem. In Proceedings of CSL'93, number 832 in LNCS, pages 165\u2013174. Springer Verlag, 1993.","key":"8_CR6","DOI":"10.1007\/BFb0049331"},{"doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar. Undecidability of bisimilarity for petri nets and some related problems. Theoretical Computer Science, 1995.","key":"8_CR7","DOI":"10.1016\/0304-3975(95)00037-W"},{"doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar and F. Moller. Checking regular properties of petri nets. In Insup Lee and Scott A. Smolka, editors, Proceedings of CONCUR'95, number 962 in LNCS. Springer Verlag, 1995.","key":"8_CR8","DOI":"10.1007\/3-540-60218-6_26"},{"unstructured":"Richard Mayr. Some results on basic parallel processes. Technical Report TUM-I9616, TU-M\u00fcnchen, March 1996.","key":"8_CR9"},{"unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989.","key":"8_CR10"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:34Z","timestamp":1605647494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}