{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:25:22Z","timestamp":1758709522655},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253334"},{"type":"electronic","value":"9783540319801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31980-1_42","type":"book-chapter","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T22:44:59Z","timestamp":1278888299000},"page":"581-585","source":"Crossref","is-referenced-by-count":26,"title":["BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking"],"prefix":"10.1007","author":[{"given":"Damien","family":"Bergamini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Descoubes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Joubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Mateescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"42_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)90266-6","volume":"126","author":"H.R. Andersen","year":"1994","unstructured":"Andersen, H.R.: Model Checking and Boolean Graphs. Theoretical Computer Science\u00a0126(1), 3\u201330 (1994)","journal-title":"Theoretical Computer Science"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Sokolsky, O.: Equivalence and Preorder Checking for Finite-State Systems. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch.\u00a06, pp. 391\u2013424. North-Holland, Amsterdam (2001)","DOI":"10.1016\/B978-044482830-9\/50024-2"},{"key":"42_CR3","volume-title":"Proc. of FORTE 1990","author":"J.-C. Fernandez","year":"1990","unstructured":"Fernandez, J.-C., Mounier, L.: Verifying Bisimulations \u201cOn the Fly\u201d. In: Quemada, J., Manas, J., V\u00e1zquez, E. (eds.) Proc. of FORTE 1990. North-Holland, Amsterdam (1990)"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201991","author":"J.-C. Fernandez","year":"1991","unstructured":"Fernandez, J.-C., Mounier, L.: A Tool Set for Deciding Behavioral Equivalences. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527. Springer, Heidelberg (1991)"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0054165","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Garavel","year":"1998","unstructured":"Garavel, H.: OPEN\/C\u00c6SAR: An Open Software Architecture for Verification, Simulation, and Testing. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 68\u201384. Springer, Heidelberg (1998)"},{"key":"42_CR6","first-page":"13","volume":"4","author":"H. Garavel","year":"2002","unstructured":"Garavel, H., Lang, F., Mateescu, R.: An Overview of CADP 2001. EASST Newsletter\u00a04, 13\u201324 (2002): Also available as INRIA Report\u00a0RT-0254","journal-title":"EASST Newsletter"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48778-6_15","volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"H. Hermanns","year":"1999","unstructured":"Hermanns, H., Siegle, M.: Bisimulation Algorithms for Stochastic Process Algebras and their BDD-based Implementation. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol.\u00a01601, pp. 244\u2013265. Springer, Heidelberg (1999)"},{"key":"42_CR8","unstructured":"Joubert, C., Mateescu, R.: Distributed On-the-Fly Equivalence Checking. In: Brim, L., Leucker, M. (eds.) Proc. of PDMC 2004 (London, United Kingdom). ENTCS (September 2004) (to appear)"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Mateescu, R.: A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 81\u201396. Springer, Heidelberg (2003), Full version available as INRIA Research Report\u00a0RR-4711","DOI":"10.1007\/3-540-36577-X_7"},{"key":"42_CR10","unstructured":"http:\/\/www.inrialpes.fr\/vasy\/cadp\/resources\/benchmark_bcg.html"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31980-1_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:44:39Z","timestamp":1620013479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31980-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253334","9783540319801"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31980-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}