{"id":"https://openalex.org/W1802139950","doi":"https://doi.org/10.1007/11603009_5","title":"On Optimal Timed Strategies","display_name":"On Optimal Timed Strategies","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1802139950","doi":"https://doi.org/10.1007/11603009_5","mag":"1802139950"},"language":"en","primary_location":{"id":"doi:10.1007/11603009_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11603009_5","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/A5070197309","display_name":"Thomas Brihaye","orcid":"https://orcid.org/0000-0001-5763-3130"},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Thomas Brihaye","raw_affiliation_strings":["Facult\u00e9 des Sciences, Universit\u00e9 de Mons-Hainaut, Avenue du Champ de Mars 6, B-7000, Mons, Belgium"],"affiliations":[{"raw_affiliation_string":"Facult\u00e9 des Sciences, Universit\u00e9 de Mons-Hainaut, Avenue du Champ de Mars 6, B-7000, Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018655997","display_name":"V\u00e9ronique Bruy\u00e8re","orcid":"https://orcid.org/0000-0002-9680-9140"},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"V\u00e9ronique Bruy\u00e8re","raw_affiliation_strings":["Facult\u00e9 des Sciences, Universit\u00e9 de Mons-Hainaut, Avenue du Champ de Mars 6, B-7000, Mons, Belgium"],"affiliations":[{"raw_affiliation_string":"Facult\u00e9 des Sciences, Universit\u00e9 de Mons-Hainaut, Avenue du Champ de Mars 6, B-7000, Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050196522","display_name":"Jean-Fran\u00e7ois Raskin","orcid":"https://orcid.org/0000-0002-3673-1097"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Jean-Fran\u00e7ois Raskin","raw_affiliation_strings":["D\u00e9partement d\u2019Informatique, Universit\u00e9 Libre de Bruxelles, Boulevard du Triomphe CP 212, B-1050, Bruxelles, Belgium","D\u00e9partement d'Informatique, Universit\u00e9 Libre de Bruxelles, Boulevard du Triomphe CP 212, B-1050, Bruxelles, Belgium"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement d\u2019Informatique, Universit\u00e9 Libre de Bruxelles, Boulevard du Triomphe CP 212, B-1050, Bruxelles, Belgium","institution_ids":["https://openalex.org/I132053463"]},{"raw_affiliation_string":"D\u00e9partement d'Informatique, Universit\u00e9 Libre de Bruxelles, Boulevard du Triomphe CP 212, B-1050, Bruxelles, Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070197309"],"corresponding_institution_ids":["https://openalex.org/I130929987"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.3279,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.92752334,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"49","last_page":"64"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9940000176429749,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9905999898910522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.9173181056976318},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8591742515563965},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7428990602493286},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6158928871154785},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5940824151039124},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5695623159408569},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5522859692573547},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5191285014152527},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.515168309211731},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.49697569012641907},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.42820537090301514},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35214826464653015},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3430521786212921},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33632892370224},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.3346240520477295},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.3062690496444702},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2279399335384369},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.20775607228279114}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.9173181056976318},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8591742515563965},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7428990602493286},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6158928871154785},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5940824151039124},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5695623159408569},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5522859692573547},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5191285014152527},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.515168309211731},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.49697569012641907},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.42820537090301514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35214826464653015},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3430521786212921},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33632892370224},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3346240520477295},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.3062690496444702},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2279399335384369},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.20775607228279114},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/11603009_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11603009_5","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.110.4228","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.4228","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BBR-formats05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.391","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ulb.ac.be/di/ssd/cfv/TechReps/TechRep_CFV_2005_48.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.348","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://w3.umh.ac.be/math/logic/sources/formats05.pdf","raw_type":"text"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/67586","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/67586","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture notes in computer science, 3829 LNCS","raw_type":"info:ulb-repo/semantics/openurl/article"},{"id":"pmh:oai:orbi.umons.ac.be:20.500.12907/8117","is_oa":false,"landing_page_url":"https://orbi.umons.ac.be/handle/20.500.12907/8117","pdf_url":null,"source":{"id":"https://openalex.org/S7407055454","display_name":"ORBi UMONS","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science, 3829, 49-64 (2005-09-01)","raw_type":"peer reviewed"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W36240330","https://openalex.org/W105220891","https://openalex.org/W1482486776","https://openalex.org/W1485651722","https://openalex.org/W1495299640","https://openalex.org/W1522448884","https://openalex.org/W1573865009","https://openalex.org/W1574195826","https://openalex.org/W1589082502","https://openalex.org/W1589421353","https://openalex.org/W1607040248","https://openalex.org/W1710659396","https://openalex.org/W1750615905","https://openalex.org/W1868359205","https://openalex.org/W2012140001","https://openalex.org/W2065323166","https://openalex.org/W2089017767","https://openalex.org/W2101508170","https://openalex.org/W2144965436","https://openalex.org/W2152221608","https://openalex.org/W2486801597","https://openalex.org/W2903935047","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2020140696","https://openalex.org/W2584984136","https://openalex.org/W2591956186","https://openalex.org/W1553002193","https://openalex.org/W1805200712","https://openalex.org/W1563786920","https://openalex.org/W1993478572","https://openalex.org/W2161984463","https://openalex.org/W2489809986","https://openalex.org/W2765111002"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}