{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:39:46Z","timestamp":1725745186455},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642399916"},{"type":"electronic","value":"9783642399923"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39992-3_22","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T10:08:18Z","timestamp":1376474898000},"page":"251-265","source":"Crossref","is-referenced-by-count":3,"title":["Ockhamist Propositional Dynamic Logic: A Natural Link between PDL and CTL*"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Balbiani","sequence":"first","affiliation":[]},{"given":"Emiliano","family":"Lorini","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM\u00a049, 672\u2013713 (2002)","journal-title":"Journal of the ACM"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-16242-8_6","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Axelsson","year":"2010","unstructured":"Axelsson, R., Hague, M., Kreutzer, S., Lange, M., Latte, M.: Extended computation tree logic. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 67\u201381. Springer, Heidelberg (2010)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Balbiani, P., Lorini, E.: Ockhamist propositional dynamic logic: a natural link between PDL and CTL*. Technical Report IRIT\/RT\u20132013-12\u2013FR, Institut de Recherche en Informatique de Toulouse (2013)","DOI":"10.1007\/978-3-642-39992-3_22"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Belnap, N., Perloff, M., Xu, M.: Facing the future: agents and choices in our indeterminist world. Oxford University Press (2001)","DOI":"10.1093\/oso\/9780195138788.001.0001"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1008398102653","volume":"8","author":"M. Brown","year":"1999","unstructured":"Brown, M., Goranko, V.: An extended branching-time ockhamist temporal logic. Journal of Logic, Language and Information\u00a08(2), 143\u2013166 (1999)","journal-title":"Journal of Logic, Language and Information"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(94)90269-0","volume":"126","author":"M. Dam","year":"1994","unstructured":"Dam, M.: CTL* and ECTL* as fragments of the modal mu-calculus. Theoretical Computer Science\u00a0126(1), 77\u201396 (1994)","journal-title":"Theoretical Computer Science"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-53479-2_17","volume-title":"Semantics of Systems of Concurrent Processes","author":"R. De Nicola","year":"1990","unstructured":"De Nicola, R., Vaandrager, F.W.: Action versus state based logics for transition systems. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol.\u00a0469, pp. 407\u2013419. Springer, Heidelberg (1990)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.: \u2018Sometimes\u2019 and \u2018not never\u2019 revisited: on branching versus linear time. Journal of the ACM\u00a033, 151\u2013178 (1986)","journal-title":"Journal of the ACM"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0019-9958(84)80047-9","volume":"61","author":"E.A. Emerson","year":"1984","unstructured":"Emerson, E.A., Sistla, A.: Deciding full branching time logic. Information and Control\u00a061, 175\u2013201 (1984)","journal-title":"Information and Control"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B. North-Holland Pub. Co.\/MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. Journal of Computer Systems Science\u00a018(2), 194\u2013211 (1979)","journal-title":"Journal of Computer Systems Science"},{"key":"22_CR13","unstructured":"Goranko, V.: Coalition games and alternating temporal logics. In: Proc. of TARK 2001, pp. 259\u2013272. Morgan Kaufmann (2001)"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-94-009-6259-0_10","volume-title":"Handbook of Philosophical Logic","author":"D. Harel","year":"1984","unstructured":"Harel, D.: Dynamic logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol.\u00a02, pp. 497\u2013604. Reidel, Dordrecht (1984)"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press (2000)","DOI":"10.7551\/mitpress\/2516.001.0001"},{"issue":"6","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1093\/logcom\/exq028","volume":"21","author":"A. Masini","year":"2011","unstructured":"Masini, A., Vigan\u00f2, L., Volpe, M.: Labelled natural deduction for a bundled branching temporal logic. Journal of Logic and Computation\u00a021(6), 1093\u20131163 (2011)","journal-title":"Journal of Logic and Computation"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"McCabe-Dansted, J.C.: A tableau for the combination of CTL and BCTL. In: Proc. of TIME 2012, pp. 29\u201336. IEEE Computer Society (2012)","DOI":"10.1109\/TIME.2012.17"},{"key":"22_CR18","unstructured":"N\u00e9meti, I.: Decidable versions of first order logic and cylindric-relativized set algebras. In: Csirmaz, L., Gabbay, D., de Rijke, M. (eds.) Logic Colloquium 1992, pp. 171\u2013241. CSLI Publications (1995)"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF00286492","volume":"14","author":"H. Nishimura","year":"1980","unstructured":"Nishimura, H.: Descriptively complete process logic. Acta Informatica\u00a014, 359\u2013369 (1980)","journal-title":"Acta Informatica"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. of the Eighteenth Symposium on Foundations of Computer Science, pp. 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"22_CR21","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198243113.001.0001","volume-title":"Past, Present, and Future","author":"A. Prior","year":"1967","unstructured":"Prior, A.: Past, Present, and Future. Clarendon Press, Oxford (1967)"},{"issue":"3","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.2307\/2695091","volume":"66","author":"M. Reynolds","year":"2001","unstructured":"Reynolds, M.: An axiomatization of full computation tree logic. Journal of Symbolic Logic\u00a066(3), 1011\u20131057 (2001)","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/logcom\/exl033","volume":"17","author":"M. Reynolds","year":"2007","unstructured":"Reynolds, M.: A tableau for bundled CTL*. Journal of Logic and Computation\u00a017(1), 117\u2013132 (2007)","journal-title":"Journal of Logic and Computation"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-05089-3_26","volume-title":"FM 2009: Formal Methods","author":"M. Reynolds","year":"2009","unstructured":"Reynolds, M.: A tableau for CTL*. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 403\u2013418. Springer, Heidelberg (2009)"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Stirling, C.: Modal and temporal logics. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol.\u00a02. Clarendon Press, Oxford (1992)","DOI":"10.1093\/oso\/9780198537618.003.0005"},{"issue":"1-2","key":"22_CR26","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","volume":"54","author":"R.S. Streett","year":"1982","unstructured":"Streett, R.S.: Propositional dynamic logic of looping and converse is elementarily decidable. Information and Control\u00a054(1-2), 121\u2013141 (1982)","journal-title":"Information and Control"},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-94-009-6259-0_3","volume-title":"Handbook of Philosophical Logic","author":"R. Thomason","year":"1984","unstructured":"Thomason, R.: Combinations of tense and modality. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol.\u00a02, pp. 135\u2013165. Reidel, Dordrecht (1984)"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y., Stockmeyer, L.J.: Improved upper and lower bounds for modal logics of programs. In: Proc. of the 17th Annual ACM Symposium on Theory of Computing, pp. 240\u2013251. ACM (1985)","DOI":"10.1145\/22145.22173"},{"key":"22_CR29","unstructured":"Wolper, P.: A translation from full branching time temporal logic to one letter propositional dynamic logic with looping. Unpublished manuscript (1982)"},{"issue":"1","key":"22_CR30","doi-asserted-by":"publisher","first-page":"143","DOI":"10.2307\/2275595","volume":"61","author":"A. Zanardo","year":"1996","unstructured":"Zanardo, A.: Branching-time logic with quantification over branches: The point of view of modal logic. Journal of Symbolic Logic\u00a061(1), 143\u2013166 (1996)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39992-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T13:58:00Z","timestamp":1715867880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39992-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642399916","9783642399923"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39992-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}