{"id":"https://openalex.org/W64121912","doi":"https://doi.org/10.1007/978-3-642-31585-5_15","title":"Robust Reachability in Timed Automata: A\u00a0Game-Based\u00a0Approach","display_name":"Robust Reachability in Timed Automata: A\u00a0Game-Based\u00a0Approach","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W64121912","doi":"https://doi.org/10.1007/978-3-642-31585-5_15","mag":"64121912"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-31585-5_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-31585-5_15","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041884792","display_name":"Patricia Bouyer","orcid":"https://orcid.org/0000-0002-2823-0911"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Patricia Bouyer","raw_affiliation_strings":["LSV, CNRS & ENS Cachan, France","[LSV, CNRS & ENS Cachan, France]"],"affiliations":[{"raw_affiliation_string":"LSV, CNRS & ENS Cachan, France","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"[LSV, CNRS & ENS Cachan, France]","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084605938","display_name":"Nicolas Markey","orcid":"https://orcid.org/0000-0003-1977-7525"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Markey","raw_affiliation_strings":["LSV, CNRS & ENS Cachan, France","[LSV, CNRS & ENS Cachan, France]"],"affiliations":[{"raw_affiliation_string":"LSV, CNRS & ENS Cachan, France","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"[LSV, CNRS & ENS Cachan, France]","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059019724","display_name":"Ocan Sankur","orcid":"https://orcid.org/0000-0001-8146-4429"},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ocan Sankur","raw_affiliation_strings":["LSV, CNRS & ENS Cachan, France","[LSV, CNRS & ENS Cachan, France]"],"affiliations":[{"raw_affiliation_string":"LSV, CNRS & ENS Cachan, France","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"[LSV, CNRS & ENS Cachan, France]","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041884792"],"corresponding_institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1294671590"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.6758,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.98230429,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"128","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9890999794006348,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9816877245903015},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8010369539260864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7222418189048767},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.7111586928367615},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6655333042144775},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.525192379951477},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4717455804347992},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.45945626497268677},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4339796006679535},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.4269885718822479},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24672314524650574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2358420193195343},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2155860960483551},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.0658755898475647}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9816877245903015},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8010369539260864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7222418189048767},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.7111586928367615},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6655333042144775},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.525192379951477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4717455804347992},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.45945626497268677},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4339796006679535},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.4269885718822479},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24672314524650574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2358420193195343},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2155860960483551},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.0658755898475647},{"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-642-31585-5_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-31585-5_15","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:CiteSeerX.psu:10.1.1.396.8849","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.8849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W64121912","https://openalex.org/W1484364085","https://openalex.org/W1488202922","https://openalex.org/W1532739430","https://openalex.org/W1584428153","https://openalex.org/W1606824214","https://openalex.org/W1878074184","https://openalex.org/W1987234253","https://openalex.org/W1992626344","https://openalex.org/W2000947342","https://openalex.org/W2023499821","https://openalex.org/W2101508170","https://openalex.org/W2104680817","https://openalex.org/W2107783208","https://openalex.org/W2120338947","https://openalex.org/W2120853715","https://openalex.org/W2150220388","https://openalex.org/W2172175633","https://openalex.org/W2951900174","https://openalex.org/W3125449943","https://openalex.org/W4255795625"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W2047831585","https://openalex.org/W1750615905","https://openalex.org/W1525435179","https://openalex.org/W2951439219","https://openalex.org/W64121912","https://openalex.org/W2162889538","https://openalex.org/W1606006280","https://openalex.org/W1979488813","https://openalex.org/W2416935330"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}