{"id":"https://openalex.org/W2889500638","doi":"https://doi.org/10.1007/978-3-030-00244-2_18","title":"Revisiting Bounded Reachability Analysis of Timed Automata Based on MILP","display_name":"Revisiting Bounded Reachability Analysis of Timed Automata Based on MILP","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2889500638","doi":"https://doi.org/10.1007/978-3-030-00244-2_18","mag":"2889500638"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-00244-2_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-00244-2_18","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/A5018426477","display_name":"Iulian Ober","orcid":"https://orcid.org/0000-0001-9057-1883"},"institutions":[{"id":"https://openalex.org/I3131550300","display_name":"Universit\u00e9 Toulouse-I-Capitole","ror":"https://ror.org/0443n9e75","country_code":"FR","type":"education","lineage":["https://openalex.org/I3131550300"]},{"id":"https://openalex.org/I4210152422","display_name":"Universit\u00e9 Toulouse - Jean Jaur\u00e8s","ror":"https://ror.org/04ezk3x31","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210152422","https://openalex.org/I4405258862"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210119061","display_name":"Institut de Recherche en Informatique de Toulouse","ror":"https://ror.org/01rx4qw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I205747304","https://openalex.org/I205747304","https://openalex.org/I4210119061","https://openalex.org/I4387153255","https://openalex.org/I4405258862","https://openalex.org/I4405258862"]},{"id":"https://openalex.org/I134560555","display_name":"Universit\u00e9 Toulouse III - Paul Sabatier","ror":"https://ror.org/02v6kpv12","country_code":"FR","type":"education","lineage":["https://openalex.org/I134560555","https://openalex.org/I4405258862"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Iulian Ober","raw_affiliation_strings":["University of Toulouse - IRIT, 118 Route de Narbonne, 31062, Toulouse, France"],"affiliations":[{"raw_affiliation_string":"University of Toulouse - IRIT, 118 Route de Narbonne, 31062, Toulouse, France","institution_ids":["https://openalex.org/I4210152422","https://openalex.org/I134560555","https://openalex.org/I4210119061","https://openalex.org/I3131550300","https://openalex.org/I4210160189"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018426477"],"corresponding_institution_ids":["https://openalex.org/I134560555","https://openalex.org/I3131550300","https://openalex.org/I4210119061","https://openalex.org/I4210152422","https://openalex.org/I4210160189"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4948,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67365925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"269","last_page":"283"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9975000023841858,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9955999851226807,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8545881509780884},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7794958353042603},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7497003078460693},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6953762173652649},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6029260754585266},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5836277604103088},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5705432891845703},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5484992265701294},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5417395830154419},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5131517052650452},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5000250339508057},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4886472821235657},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4794436991214752},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4358086585998535},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42882639169692993},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4222533702850342},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3741522431373596},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23608115315437317},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21549388766288757},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17601653933525085}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8545881509780884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7794958353042603},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7497003078460693},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6953762173652649},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6029260754585266},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5836277604103088},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5705432891845703},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5484992265701294},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5417395830154419},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5131517052650452},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5000250339508057},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4886472821235657},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4794436991214752},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4358086585998535},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42882639169692993},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4222533702850342},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3741522431373596},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23608115315437317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21549388766288757},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17601653933525085},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-00244-2_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-00244-2_18","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1482233117","https://openalex.org/W1485432887","https://openalex.org/W1495026145","https://openalex.org/W1522276539","https://openalex.org/W1546076553","https://openalex.org/W1558869278","https://openalex.org/W1560730347","https://openalex.org/W1571054242","https://openalex.org/W1582964729","https://openalex.org/W1597414920","https://openalex.org/W1787074469","https://openalex.org/W1939356072","https://openalex.org/W1973816382","https://openalex.org/W1989746243","https://openalex.org/W2006574672","https://openalex.org/W2023499821","https://openalex.org/W2036670017","https://openalex.org/W2039784168","https://openalex.org/W2086545711","https://openalex.org/W2101508170","https://openalex.org/W2140871903","https://openalex.org/W2156027773","https://openalex.org/W2170136168","https://openalex.org/W2505968561"],"related_works":["https://openalex.org/W93625746","https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W2099490078","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W4224983736","https://openalex.org/W4389158950"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}