{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:42:05Z","timestamp":1725565325116},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223429"},{"type":"electronic","value":"9783540278139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27813-9_43","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T04:57:57Z","timestamp":1284440277000},"page":"488-491","source":"Crossref","is-referenced-by-count":9,"title":["The Mec\u00a05 Model-Checker"],"prefix":"10.1007","author":[{"given":"Alain","family":"Griffault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aymeric","family":"Vincent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"43_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1006\/inco.2001.2948","volume":"179","author":"H. Andersen","year":"2002","unstructured":"Andersen, H., Hulgaard, H.: Boolean expression diagrams. Information and Computation\u00a0179(2), 194\u2013212 (2002)","journal-title":"Information and Computation"},{"issue":"2-3","key":"43_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.3233\/FI-1999-402302","volume":"40","author":"A. Arnold","year":"1999","unstructured":"Arnold, A., Griffault, A., Point, G., Rauzy, A.: The altarica formalism for describing concurrent systems. Fundamenta Informaticae\u00a040(2-3), 109\u2013124 (1999)","journal-title":"Fundamenta Informaticae"},{"issue":"8","key":"43_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-45657-0_29","volume-title":"Computer Aided Verification","author":"A. Cimatti","year":"2002","unstructured":"Cimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV version 2: An opensource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 359\u2013364. Springer, Heidelberg (2002)"},{"key":"43_CR5","unstructured":"Corsini, M.-M., Rauzy, A.: Toupie user\u2019s manual. Research Report 586-93, LaBRI (1993)"},{"key":"43_CR6","unstructured":"Mader, A.: Verification of modal properties using boolean equation systems. PhD thesis, Fakult\u00e4t Informatik, Technische Universit\u00e4t M\u00fcnchen (1997)"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Symbolic Model Checking: an approach to the state explosion problem. PhD thesis, Carnegie Mellon University (May 1992)","DOI":"10.1007\/978-1-4615-3190-6_3"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(76)90022-0","volume":"3","author":"D. Park","year":"1976","unstructured":"Park, D.: Finiteness is \u03bc-ineffable. Theoretical Computer Science\u00a03, 173\u2013181 (1976)","journal-title":"Theoretical Computer Science"},{"key":"43_CR9","unstructured":"G\u00e9rald Point. Altarica: Contribution \u00e0 l\u2019unification des m\u00e9thodes formelles et de la s\u00fbret\u00e9 de fonctionnement. PhD thesis, LaBRI, Universit\u00e9 Bordeaux 1 (January 2000)"},{"key":"43_CR10","unstructured":"Vincent, A.: Conception et r\u00e9alisation d\u2019un v\u00e9rificateur de mod\u00e8les AltaRica. PhD thesis, LaBRI, Universit\u00e9 Bordeaux 1 (December 2003)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27813-9_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:31Z","timestamp":1620012451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27813-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223429","9783540278139"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27813-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}