{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T04:57:29Z","timestamp":1780117049125,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540746201","type":"print"},{"value":"9783540746218","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74621-8_13","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T11:46:32Z","timestamp":1187783192000},"page":"193-205","source":"Crossref","is-referenced-by-count":13,"title":["A Temporal Logic of Robustness"],"prefix":"10.1007","author":[{"given":"Tim","family":"French","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John C.","family":"Mc Cabe-Dansted","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Reynolds","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Sistla, A.P.: Deciding full branching time logic. Technical report, University of Texas at Austin, Austin, TX, USA (1985)","DOI":"10.1145\/800057.808661"},{"key":"13_CR2","first-page":"52","volume-title":"Proc. IBM Workshop on Log. of Progr., Yorktown Heights","author":"E. Clarke","year":"1981","unstructured":"Clarke, E., Emerson, E.: Synthesis of synchronization skeletons for branching time temporal logic. In: Proc. IBM Workshop on Log. of Progr., Yorktown Heights, pp. 52\u201371. Springer, Heidelberg (1981)"},{"key":"13_CR3","unstructured":"French, T., M c Cabe-Dansted, J.C., Reynolds, M.: A temporal logic of robustness, RoCTL*. Technical report, UWA (2007) http:\/\/dansted.org\/RoCTL07.pdf"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.2307\/2026120","volume":"81","author":"J.W. Forrester","year":"1984","unstructured":"Forrester, J.W.: Gentle murder, or the adverbial samaritan. J. Philos.\u00a081(4), 193\u2013197 (1984)","journal-title":"J. Philos."},{"key":"13_CR5","first-page":"650","volume-title":"Proc. 14 th Nation. Conf. on AI and 9 th Innov. Applic. of AI Conf.","author":"L.W.N. Torre van der","year":"1998","unstructured":"van der Torre, L.W.N., Tan, Y.: The temporal analysis of Chisholm\u2019s paradox. In: Senator, T., Buchanan, B. (eds.) Proc. 14 th Nation. Conf. on AI and 9 th Innov. Applic. of AI Conf., Menlo Park, California, pp. 650\u2013655. AAAI Press, Stanford, California (1998)"},{"issue":"1\/2","key":"13_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/FI-1994-21128","volume":"21","author":"L.T. McCarty","year":"1994","unstructured":"McCarty, L.T.: Defeasible deontic reasoning. Fundam. Inform.\u00a021(1\/2), 125\u2013148 (1994)","journal-title":"Fundam. Inform."},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"777","DOI":"10.2307\/2108182","volume":"51","author":"N. Belnap","year":"1991","unstructured":"Belnap, N.: Backwards and forwards in the modal logic of agency. Philos. Phenomen. Res.\u00a051(4), 777\u2013807 (1991)","journal-title":"Philos. Phenomen. Res."},{"issue":"1-2","key":"13_CR8","first-page":"93","volume":"37","author":"M. Weerdt de","year":"2003","unstructured":"de Weerdt, M., Bos, A., Tonino, H., Witteveen, C.: A resource logic for multi-agent plan merging. Annals of Math. and AI\u00a037(1-2), 93\u2013130 (2003)","journal-title":"Annals of Math. and AI"},{"key":"13_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-540-25927-5_5","volume-title":"Deontic Logic in Computer Science","author":"J. Broersen","year":"2004","unstructured":"Broersen, J., Dignum, F., Dignum, V., Meyer, J.J.C.: In: Designing a Deontic Logic of Deadlines. In: Lomuscio, A.R., Nute, D. (eds.) DEON 2004. LNCS (LNAI), vol.\u00a03065, pp. 43\u201356. Springer, Heidelberg (2004)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0951-8320(99)00075-7","volume":"67","author":"W. Long","year":"2000","unstructured":"Long, W., Sato, Y., Horigome, M.: Quantification of sequential failure logic for fault tree analysis. Reliab. Eng. Syst. Safe.\u00a067, 269\u2013274 (2000)","journal-title":"Reliab. Eng. Syst. Safe."},{"issue":"5","key":"13_CR11","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Form. Asp. Comput.\u00a06(5), 512\u2013535 (1994)","journal-title":"Form. Asp. Comput."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Aldewereld, H., Grossi, D., Vazquez-Salceda, J., Dignum, F.: Designing normative behaviour by the use of landmarks. In: Agents, Norms and Institutions for Regulated Multiag. Syst., Utrecht, The Netherlands (2005)","DOI":"10.1007\/11775331_11"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/11586180","volume-title":"Perspectives in Conceptual Modeling","author":"A. Rodrigo","year":"2005","unstructured":"Rodrigo, A., Eduardo, A.: Normative pragmatics for agent communication languages. In: Akoka, J., Liddle, S.W., Song, I.-Y., Bertolotto, M., Comyn-Wattiau, I., van den Heuvel, W.-J., Kolp, M., Trujillo, J., Kop, C., Mayr, H.C. (eds.) Perspectives in Conceptual Modeling. LNCS, vol.\u00a03770, pp. 172\u2013181. Springer, Heidelberg (2005)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"J\u00e9ron, T., Marchand, H., Pinchinat, S., Cordier, M.O.: Supervision patterns in discrete event systems diagnosis. In: 8th Internat. Workshop on Discrete Event Syst., pp. 262\u2013268 (2006)","DOI":"10.1109\/WODES.2006.1678440"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0304-3975(02)00442-5","volume":"303","author":"A. Arnold","year":"2003","unstructured":"Arnold, A., Vincent, A., Walukiewicz, I.: Games for synthesis of controllers with partial observation. TCS\u00a0303(1), 7\u201334 (2003)","journal-title":"TCS"},{"issue":"3","key":"13_CR16","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. J. Symb. Log.\u00a066(3), 1011\u20131057 (2001)","journal-title":"J. Symb. Log."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(83)90082-8","volume":"26","author":"E.A. Emerson","year":"1983","unstructured":"Emerson, E.A.: Alternative semantics for temporal logics. TCS\u00a026, 121\u2013130 (1983)","journal-title":"TCS"},{"key":"13_CR18","first-page":"325","volume-title":"Comput. Aid. Verfic., Proc. 7th Int. Conf., Liege","author":"O. Kupferman","year":"1995","unstructured":"Kupferman, O.: Augmenting branching temporal logics with existential quantification over atomic propositions. In: Comput. Aid. Verfic., Proc. 7th Int. Conf., Liege, pp. 325\u2013338. Springer, Heidelberg (1995)"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/800057.808661","volume-title":"STOC 1984: Proc. 16 th annual ACM sympos. on Theory of computing","author":"E.A. Emerson","year":"1984","unstructured":"Emerson, E.A., Sistla, A.P.: Deciding branching time logic. In: STOC 1984: Proc. 16 th annual ACM sympos. on Theory of computing, New York, NY, USA, pp. 14\u201324. ACM Press, New York (1984)"},{"key":"13_CR20","first-page":"165","volume-title":"AI 2001","author":"T. French","year":"2001","unstructured":"French, T.: Decidability of quantifed propositional branching time logics. In: AI 2001. Proc. 14 th Austral. Joint Conf. on AI, London, UK, pp. 165\u2013176. Springer, Heidelberg (2001)"},{"issue":"2-3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A.P. Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for buc\u0308hi automata with applications to temporal logic. TCS\u00a049(2-3), 217\u2013237 (1987)","journal-title":"TCS"},{"key":"13_CR22","unstructured":"French, T.: Bisimulation Quantifiers for Modal Logics. PhD thesis, UWA (2006)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74621-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T21:35:07Z","timestamp":1684013707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74621-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540746201","9783540746218"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74621-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}