{"id":"https://openalex.org/W4285254379","doi":"https://doi.org/10.1007/978-3-031-06773-0_29","title":"Robust Computation Tree Logic","display_name":"Robust Computation Tree Logic","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4285254379","doi":"https://doi.org/10.1007/978-3-031-06773-0_29"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-06773-0_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-06773-0_29","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://vbn.aau.dk/da/publications/569633bf-a56d-423d-8126-d54b0bca0cd8","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013573130","display_name":"Satya Prakash Nayak","orcid":"https://orcid.org/0000-0002-4407-8681"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Satya Prakash Nayak","raw_affiliation_strings":["Max Planck Institute for Software Systems, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4407-8681","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064701353","display_name":"Daniel Neider","orcid":"https://orcid.org/0000-0001-9276-6342"},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]},{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Neider","raw_affiliation_strings":["Max Planck Institute for Software Systems, Kaiserslautern, Germany","Safety and Explainability of Learning Systems Group, Carl von Ossietzky Universit\u00e4t Oldenburg, Oldenburg, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9276-6342","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]},{"raw_affiliation_string":"Safety and Explainability of Learning Systems Group, Carl von Ossietzky Universit\u00e4t Oldenburg, Oldenburg, Germany","institution_ids":["https://openalex.org/I129877168"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078181730","display_name":"Rajarshi Roy","orcid":"https://orcid.org/0000-0002-0202-1169"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rajarshi Roy","raw_affiliation_strings":["Max Planck Institute for Software Systems, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0002-0202-1169","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064596121","display_name":"Mart\u00edn Zimmermann","orcid":"https://orcid.org/0000-0002-8038-2453"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Martin Zimmermann","raw_affiliation_strings":["Aalborg University, Aalborg, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-8038-2453","affiliations":[{"raw_affiliation_string":"Aalborg University, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5013573130"],"corresponding_institution_ids":["https://openalex.org/I4210121786"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.3189,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.92632046,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"538","last_page":"556"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8248648643493652},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5555795431137085},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.473045289516449},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3810490667819977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3317873179912567},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1020805835723877}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8248648643493652},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5555795431137085},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.473045289516449},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3810490667819977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3317873179912567},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1020805835723877},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-031-06773-0_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-06773-0_29","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/569633bf-a56d-423d-8126-d54b0bca0cd8","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/569633bf-a56d-423d-8126-d54b0bca0cd8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nayak, S P, Neider, D, Roy, R & Zimmermann, M 2022, Robust Computation Tree Logic. in J V Deshmukh, K Havelund & I Perez (eds), NASA Formal Methods, NFM 2022 : 14th International Symposium, NFM 2022, Proceedings. Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13260 LNCS, pp. 538-556, 14th International Symposium on NASA Formal Methods, NFM 2022, Pasadena, United States, 24/05/2022. https://doi.org/10.1007/978-3-031-06773-0_29","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/569633bf-a56d-423d-8126-d54b0bca0cd8","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/569633bf-a56d-423d-8126-d54b0bca0cd8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nayak, S P, Neider, D, Roy, R & Zimmermann, M 2022, Robust Computation Tree Logic. in J V Deshmukh, K Havelund & I Perez (eds), NASA Formal Methods, NFM 2022 : 14th International Symposium, NFM 2022, Proceedings. Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13260 LNCS, pp. 538-556, 14th International Symposium on NASA Formal Methods, NFM 2022, Pasadena, United States, 24/05/2022. https://doi.org/10.1007/978-3-031-06773-0_29","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7314760525","display_name":null,"funder_award_id":"434592664","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1534292130","https://openalex.org/W1975657455","https://openalex.org/W2033242075","https://openalex.org/W2065444032","https://openalex.org/W2067441543","https://openalex.org/W2073788194","https://openalex.org/W2075756851","https://openalex.org/W2080915207","https://openalex.org/W2110182592","https://openalex.org/W2119474775","https://openalex.org/W2147273034","https://openalex.org/W2502103274","https://openalex.org/W2804589645","https://openalex.org/W2963650758","https://openalex.org/W2973665944","https://openalex.org/W3125478381","https://openalex.org/W4241616303","https://openalex.org/W6628975226"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}