{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:52Z","timestamp":1725544072948},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330455"},{"type":"electronic","value":"9783540330462"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11690634_10","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T14:15:28Z","timestamp":1143555328000},"page":"142-156","source":"Crossref","is-referenced-by-count":2,"title":["On the \u03bc-Calculus Augmented with Sabotage"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Rohde","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-75357-2","volume-title":"Structural Complexity II","author":"J.L. Balc\u00e1zar","year":"1990","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gabarr\u00f3, J.: Structural Complexity II. Springer, Heidelberg (1990)"},{"key":"10_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-32254-2_16","volume-title":"Mechanizing Mathematical Reasoning","author":"J. Benthem van","year":"2005","unstructured":"van Benthem, J.: An essay on sabotage and obstruction. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning. LNCS (LNAI), vol.\u00a02605, pp. 268\u2013276. Springer, Heidelberg (2005)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/3-540-58179-0_50","volume-title":"Computer Aided Verification","author":"O. Bernholtz","year":"1994","unstructured":"Bernholtz, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 142\u2013155. Springer, Heidelberg (1994)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: FOCS 1991, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification","author":"E.A. Emerson","year":"1993","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model-checking for fragments of \u03bc-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 385\u2013396. Springer, Heidelberg (1993)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"key":"10_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. TCS\u00a027, 333\u2013354 (1983)","journal-title":"TCS"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-540-45138-9_47","volume-title":"Mathematical Foundations of Computer Science 2003","author":"C.. L\u00f6ding","year":"2003","unstructured":"L\u00f6ding, C., Rohde, P.: Solving the sabotage game is PSPACE-hard. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 531\u2013540. Springer, Heidelberg (2003)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-24597-1_26","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"C.. L\u00f6ding","year":"2003","unstructured":"L\u00f6ding, C., Rohde, P.: Model checking and satisfiability for sabotage modal logic. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 302\u2013313. Springer, Heidelberg (2003)"},{"key":"10_CR10","unstructured":"Rohde, P.: On Games and Logics over Dynamically Changing Structures. Technical report submitted as dissertation thesis at RWTH Aachen, Available under (2005), www-i7.informatik.rwth-aachen.de\/~rohde\/thesis.pdf"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/0208013","volume":"8","author":"L.J. Stockmeyer","year":"1979","unstructured":"Stockmeyer, L.J., Chandra, A.K.: Provably difficult combinatorial games. SIAM Journal on Computing\u00a08, 151\u2013174 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages. In: STOC 1983, pp. 137\u2013146 (1982)","DOI":"10.1145\/800070.802186"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: On the complexity of bounded-variable queries. In: PODS 1995, pp. 266\u2013276 (1995)","DOI":"10.1145\/212433.212474"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(01)00185-2","volume":"275","author":"I. Walukiewicz","year":"2002","unstructured":"Walukiewicz, I.: Monadic second-order logic on tree-like structures. TCS\u00a0275, 311\u2013346 (2002)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11690634_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T17:19:04Z","timestamp":1555521544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11690634_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330455","9783540330462"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11690634_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}