{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:05Z","timestamp":1725664025451},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582014"},{"type":"electronic","value":"9783540485667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_77","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:32:50Z","timestamp":1330270370000},"page":"304-315","source":"Crossref","is-referenced-by-count":12,"title":["Efficient local correctness checking for single and alternating boolean equation systems"],"prefix":"10.1007","author":[{"given":"B.","family":"Vergauwen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Lewi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, H. R.: Model Checking and Boolean Graphs, ESOP'92, LNCS 582, 1992.","DOI":"10.1007\/3-540-55253-7_1"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, H. R.: Verification of Temporal Properties of Concurrent Systems, PhD thesis, Aarhus University, DAAMI PB-445, 1993.","DOI":"10.7146\/dpb.v22i445.6762"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(88)90029-4","volume":"29","author":"A. Arnold","year":"1988","unstructured":"Arnold, A., Crubille, P.: A linear algorithm to solve fixed-points equations on transition systems, Information Processing Letters, vol.29, 57\u201366, 1988.","journal-title":"Information Processing Letters"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Cleaveland, R.: Tableau-Based Model Checking in the Propositional Mu-Calculus, Acta Informatica, 1990.","DOI":"10.1007\/BF00264284"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Steffen, B.: A Linear-Time Model Checking Algorithm for the Alternation-Free Modal Mu-Calculus, CAV'91, LNCS 575, 1991.","DOI":"10.1007\/3-540-55179-4_6"},{"key":"25_CR6","unstructured":"Cleaveland, R., Klein, M., Steffen, B.: Faster Model Checking for the Modal Mu-Calculus, CAV'92, Forthcoming."},{"key":"25_CR7","unstructured":"Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional \u03bc-calculus, LICS, 267\u2013278, 1986."},{"key":"25_CR8","unstructured":"Larsen, K.G.: Efficient local correctness checking, CAV'92, Forthcoming."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Stirling, C., Walker, D.: Local model checking in the modal mu-calculus, TCS, October 1991, see also LNCS 351, 369\u2013383, CAAP 1989.","DOI":"10.1007\/3-540-50939-9_144"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A Lattice-Theoretical Fixpoint Theorem and its Applications, Pacific Journal of Mathematics, Vol. 5, 1955.","DOI":"10.2140\/pjm.1955.5.285"},{"key":"25_CR11","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics (extended abstract), in Information Processing 89, North-Holland, 1989."},{"key":"25_CR12","unstructured":"Vergauwen, B., Lewi, J.: A linear algorithm for solving fixed points equations on transition systems, CAAP'92, LNCS 581."},{"key":"25_CR13","unstructured":"Vergauwen, B., Lewi, J.: A Linear Local Model Checking Algorithm for CTL, CONCUR'93, LNCS 715."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Winskel, G.: A note on model checking the modal \u03bd-calculus, ICALP, LNCS 372, 1989, see also TCS 83, 1991.","DOI":"10.1016\/0304-3975(91)90043-2"},{"key":"25_CR15","unstructured":"Xinxin, L.: Specification and Decomposition in Concurrency, PhD thesis, Aalborg University, 1992. R 92-2005."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:29Z","timestamp":1605647909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}