{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T07:28:40Z","timestamp":1750318120211,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031067723"},{"type":"electronic","value":"9783031067730"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06773-0_29","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"538-556","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Robust Computation Tree Logic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4407-8681","authenticated-orcid":false,"given":"Satya Prakash","family":"Nayak","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9276-6342","authenticated-orcid":false,"given":"Daniel","family":"Neider","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0202-1169","authenticated-orcid":false,"given":"Rajarshi","family":"Roy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8038-2453","authenticated-orcid":false,"given":"Martin","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"29_CR1","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press (2008)"},{"key":"29_CR2","doi-asserted-by":"publisher","unstructured":"Bloem, R., Greimel, K., Henzinger, T.A., Jobstmann, B.: Synthesizing robust systems. In: Proceedings of 9th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2009, 15\u201318 November 2009, Austin, Texas, USA, pp. 85\u201392. IEEE (2009). https:\/\/doi.org\/10.1109\/FMCAD.2009.5351139","DOI":"10.1109\/FMCAD.2009.5351139"},{"key":"29_CR3","doi-asserted-by":"publisher","unstructured":"Bradfield, J., Walukiewicz, I.: The mu-calculus and model checking. In: Clarke, E., Henzinger, T., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 871\u2013919. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_26","DOI":"10.1007\/978-3-319-10575-8_26"},{"key":"29_CR4","doi-asserted-by":"publisher","unstructured":"Doyen, L., Henzinger, T.A., Legay, A., Nickovic, D.: Robustness of sequential circuits. In: Gomes, L., Khomenko, V., Fernandes, J.M. (eds.) 10th International Conference on Application of Concurrency to System Design, ACSD 2010, Braga, Portugal, 21\u201325 June 2010, pp. 77\u201384. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/ACSD.2010.26","DOI":"10.1109\/ACSD.2010.26"},{"key":"29_CR5","doi-asserted-by":"publisher","unstructured":"Ehlers, R., Topcu, U.: Resilience to intermittent assumption violations in reactive synthesis. In: Fr\u00e4nzle, M., Lygeros, J. (eds.) 17th International Conference on Hybrid Systems: Computation and Control (Part of CPS Week), HSCC 2014, Berlin, Germany, 15\u201317 April 2014, pp. 203\u2013212. ACM (2014). https:\/\/doi.org\/10.1145\/2562059.2562128","DOI":"10.1145\/2562059.2562128"},{"issue":"1","key":"29_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-0000(85)90001-7","volume":"30","author":"EA Emerson","year":"1985","unstructured":"Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. J. Comput. Syst. Sci. 30(1), 1\u201324 (1985). https:\/\/doi.org\/10.1016\/0022-0000(85)90001-7","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","volume":"8","author":"EA Emerson","year":"1987","unstructured":"Emerson, E.A., Lei, C.: Modalities for model checking: branching time logic strikes back. Sci. Comput. Program. 8(3), 275\u2013306 (1987). https:\/\/doi.org\/10.1016\/0167-6423(87)90036-0","journal-title":"Sci. Comput. Program."},{"issue":"5\u20136","key":"29_CR8","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10009-012-0228-z","volume":"15","author":"B Finkbeiner","year":"2013","unstructured":"Finkbeiner, B., Schewe, S.: Bounded synthesis. Int. J. Softw. Tools Technol. Transf. 15(5\u20136), 519\u2013539 (2013). https:\/\/doi.org\/10.1007\/s10009-012-0228-z","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"29_CR9","doi-asserted-by":"publisher","unstructured":"French, T., McCabe-Dansted, J.C., Reynolds, M.: A temporal logic of robustness. In: Konev, B., Wolter, F. (eds.) Frontiers of Combining Systems, 6th International Symposium, FroCoS 2007, Liverpool, UK, 10\u201312 September 2007, Proceedings. Lecture Notes in Computer Science, vol. 4720, pp. 193\u2013205. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-74621-8_13","DOI":"10.1007\/978-3-540-74621-8_13"},{"key":"29_CR10","doi-asserted-by":"publisher","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001], Lecture Notes in Computer Science, vol. 2500. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4","DOI":"10.1007\/3-540-36387-4"},{"key":"29_CR11","doi-asserted-by":"publisher","unstructured":"H\u00e1jek, P.: Metamathematics of Fuzzy Logic, Trends in Logic, vol. 4. Kluwer (1998). https:\/\/doi.org\/10.1007\/978-94-011-5300-3","DOI":"10.1007\/978-94-011-5300-3"},{"key":"29_CR12","unstructured":"Nayak, S.P., Neider, D., Roy, R., Zimmermann, M.: Robust computation tree logic. arXiv 2201.07116 (2022), https:\/\/arxiv.org\/abs\/2201.07116"},{"key":"29_CR13","doi-asserted-by":"publisher","unstructured":"Neider, D., Weinert, A., Zimmermann, M.: Robust, expressive, and quantitative linear temporal logics: pick any two for free. In: Leroux, J., Raskin, J. (eds.) Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019, Bordeaux, France, 2\u20133rd September 2019. EPTCS, vol. 305, pp. 1\u201316 (2019). https:\/\/doi.org\/10.4204\/EPTCS.305.1","DOI":"10.4204\/EPTCS.305.1"},{"key":"29_CR14","doi-asserted-by":"publisher","unstructured":"Priest, G.: Dualising intuitionictic negation. Principia: Int. J. Epistemol. 13(2), 165\u2013184 (2009). https:\/\/doi.org\/10.5007\/1808-1711.2009v13n2p165","DOI":"10.5007\/1808-1711.2009v13n2p165"},{"key":"29_CR15","doi-asserted-by":"publisher","unstructured":"Tabuada, P., Balkan, A., Caliskan, S.Y., Shoukry, Y., Majumdar, R.: Input-output robustness for discrete systems. In: Jerraya, A., Carloni, L.P., Maraninchi, F., Regehr, J. (eds.) Proceedings of the 12th International Conference on Embedded Software, EMSOFT 2012, part of the Eighth Embedded Systems Week, ESWeek 2012, Tampere, Finland, 7\u201312 October 2012, pp. 217\u2013226. ACM (2012). https:\/\/doi.org\/10.1145\/2380356.2380396","DOI":"10.1145\/2380356.2380396"},{"issue":"12","key":"29_CR16","doi-asserted-by":"publisher","first-page":"3151","DOI":"10.1109\/TAC.2014.2351632","volume":"59","author":"P Tabuada","year":"2014","unstructured":"Tabuada, P., Caliskan, S.Y., Rungger, M., Majumdar, R.: Towards robustness for cyber-physical systems. IEEE Trans. Autom. Control 59(12), 3151\u20133163 (2014). https:\/\/doi.org\/10.1109\/TAC.2014.2351632","journal-title":"IEEE Trans. Autom. Control"},{"key":"29_CR17","doi-asserted-by":"publisher","unstructured":"Tabuada, P., Neider, D.: Robust linear temporal logic. In: Talbot, J., Regnier, L. (eds.) 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France. LIPIcs, vol. 62, pp. 10:1\u201310:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2016.10","DOI":"10.4230\/LIPIcs.CSL.2016.10"},{"issue":"5","key":"29_CR18","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1109\/TAC.2008.923658","volume":"53","author":"DC Tarraf","year":"2008","unstructured":"Tarraf, D.C., Megretski, A., Dahleh, M.A.: A framework for robust stability of systems over finite alphabets. IEEE Trans. Autom. Control 53(5), 1133\u20131146 (2008). https:\/\/doi.org\/10.1109\/TAC.2008.923658","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06773-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T11:12:18Z","timestamp":1659352338000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pasadena, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"118","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}