{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T15:58:52Z","timestamp":1772294332999,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540291077","type":"print"},{"value":"9783540320722","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560647_35","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:04:06Z","timestamp":1129817046000},"page":"532-545","source":"Crossref","is-referenced-by-count":4,"title":["A Sub-quadratic Algorithm for Conjunctive and Disjunctive Boolean Equation Systems"],"prefix":"10.1007","author":[{"given":"Jan Friso","family":"Groote","sequence":"first","affiliation":[]},{"given":"Misa","family":"Kein\u00e4nen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_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, 3\u201330 (1994)","journal-title":"Theoretical Computer Science"},{"key":"35_CR2","series-title":"Studies in logic and the foundations of mathematics","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(01)80001-X","volume-title":"Rudiments of \u03bc-calculus","author":"A. Arnold","year":"2001","unstructured":"Arnold, A., Niwinski, D.: Rudiments of \u03bc-calculus. Studies in logic and the foundations of mathematics, vol.\u00a0146. Elsevier, Amsterdam (2001)"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-44585-4_23","volume-title":"Computer Aided Verification","author":"S. Blom","year":"2001","unstructured":"Blom, S., Fokkink, W., Groote, J., van Langevelde, I., Lisser, B., van de Pol, J.: \u03bcCRL: a toolset for analysing algebraic specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 250\u2013254. Springer, Heidelberg (2001)"},{"key":"35_CR4","volume-title":"Handbook of Process Algebra, ch.\u00a04","author":"J. Bradfield","year":"2001","unstructured":"Bradfield, J., Stirling, C.: Modal Logics and mu-Calculi: An introduction. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch.\u00a04. Elsevier, Amsterdam (2001)"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-540-24730-2_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.F. Groote","year":"2004","unstructured":"Groote, J.F., Kein\u00e4nen, M.K.: Solving Disjunctive\/Conjunctive Boolean Equation Systems with Alternating Fixed Points. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 436\u2013450. Springer, Heidelberg (2004)"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-45315-6_18","volume-title":"Foundations of Software Science and Computation Structures","author":"V. King","year":"2001","unstructured":"King, V., Kupferman, O., Vardi, M.Y.: On the complexity of parity word automata. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 276\u2013286. Springer, Heidelberg (2001)"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoretical computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical computer Science"},{"key":"35_CR8","unstructured":"Mader, A.: Verification of Modal Properties using Boolean Equation Systems. PhD thesis, Technical University of Munich (1997)"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-36577-X_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Mateescu","year":"2003","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)"},{"key":"35_CR10","volume-title":"Computer Networks","author":"A. Tanenbaum","year":"2003","unstructured":"Tanenbaum, A.: Computer Networks, 4th edn. Prentice Hall PTR, Englewood Cliffs (2003)","edition":"4"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal of Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"35_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0020-0190(82)90136-3","volume":"14","author":"R.E. Tarjan","year":"1982","unstructured":"Tarjan, R.E.: A hierarchical clustering algorithm using strong components. Information Processing Letters\u00a014(1), 26\u201329 (1982)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560647_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T02:25:50Z","timestamp":1552443950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560647_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291077","9783540320722"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11560647_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}