{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T06:25:07Z","timestamp":1745994307938},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401831"},{"type":"electronic","value":"9783642401848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_33","type":"book-chapter","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T01:50:56Z","timestamp":1374544256000},"page":"470-484","source":"Crossref","is-referenced-by-count":15,"title":["Proof Graphs for Parameterised Boolean Equation Systems"],"prefix":"10.1007","author":[{"given":"Sjoerd","family":"Cranen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim A. C.","family":"Willemse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-74407-8_9","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"T. Chen","year":"2007","unstructured":"Chen, T., Ploeger, B., van de Pol, J., Willemse, T.A.C.: Equivalence checking for infinite systems using parameterized boolean equation systems. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 120\u2013135. Springer, Heidelberg (2007)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Clarke, E., Grumberg, O., McMillan, K., Zhao, X.: Efficient generation of counterexamples and witnesses in symbolic model checking. In: DAC 1995, pp. 427\u2013432. ACM (1995)","DOI":"10.21236\/ADA288583"},{"key":"33_CR3","unstructured":"Clarke, E., Jha, S., Lu, Y., Veith, H.: Tree-like counterexamples in model checking. In: LICS, pp. 19\u201329. IEEE (2002)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"3129","DOI":"10.1016\/j.tcs.2011.02.034","volume":"412","author":"S. Cranen","year":"2011","unstructured":"Cranen, S., Groote, J., Reniers, M.: A linear translation from CTL* to the first-order modal \u03bc-calculus. TCS\u00a0412, 3129\u20133139 (2011)","journal-title":"TCS"},{"key":"33_CR5","unstructured":"Emerson, E., Jutla, C.: Tree automata, mu-calculus and determinacy. In: FOCS, pp. 368\u2013377. IEEE Computer Society (1991)"},{"issue":"6","key":"33_CR6","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.ic.2008.03.002","volume":"206","author":"J. Goldsmith","year":"2008","unstructured":"Goldsmith, J., Hagen, M., Mundhenk, M.: Complexity of DNF minimization and isomorphism testing for monotone formulas. Information and Computation\u00a0206(6), 760\u2013775 (2008)","journal-title":"Information and Computation"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/11560647_35","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"J.F. Groote","year":"2005","unstructured":"Groote, J.F., Kein\u00e4nen, M.: A sub-quadratic algorithm for conjunctive and disjunctive Boolean equation systems. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol.\u00a03722, pp. 532\u2013545. Springer, Heidelberg (2005)"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Groote, J., Reniers, M.: Algebraic process verification. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50035-7"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-540-28644-8_20","volume-title":"CONCUR 2004 - Concurrency Theory","author":"J.F. Groote","year":"2004","unstructured":"Groote, J.F., Willemse, T.A.C.: Parameterised boolean equation systems (extended abstract). In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 308\u2013324. Springer, Heidelberg (2004)"},{"key":"33_CR10","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":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-46419-0_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Mateescu","year":"2000","unstructured":"Mateescu, R.: Efficient diagnostic generation for Boolean equation systems. In: Graf, S. (ed.) TACAS 2000. LNCS, vol.\u00a01785, pp. 251\u2013265. Springer, Heidelberg (2000)"},{"issue":"4","key":"33_CR12","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S. Sahni","year":"1974","unstructured":"Sahni, S.: Computationally related problems. SICOMP\u00a03(4), 262\u2013279 (1974)","journal-title":"SICOMP"},{"key":"33_CR13","unstructured":"Tan, L.: Evidence-Based Verification. PhD thesis, Department of Computer Science, State University of New York (2002)"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/3-540-45657-0_37","volume-title":"Computer Aided Verification","author":"L. Tan","year":"2002","unstructured":"Tan, L., Cleaveland, W.R.: Evidence-based model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 455\u2013470. Springer, Heidelberg (2002)"},{"issue":"1-2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W. Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. TCS\u00a0200(1-2), 135\u2013183 (1998)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T02:55:57Z","timestamp":1557975357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}