{"id":"https://openalex.org/W2168796683","doi":"https://doi.org/10.1109/acc.2007.4282139","title":"Reachability Analysis Of Linear Hybrid Automata By Using Counterexample Fragment Based Abstraction Refinement","display_name":"Reachability Analysis Of Linear Hybrid Automata By Using Counterexample Fragment Based Abstraction Refinement","publication_year":2007,"publication_date":"2007-07-01","ids":{"openalex":"https://openalex.org/W2168796683","doi":"https://doi.org/10.1109/acc.2007.4282139","mag":"2168796683"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2007.4282139","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2007.4282139","pdf_url":null,"source":{"id":"https://openalex.org/S4210168941","display_name":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","issn_l":"0743-1619","issn":["0743-1619","2378-5861"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 American Control Conference","raw_type":"proceedings-article"},"type":"article","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/A5110985847","display_name":"Shengbing Jiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shengbing Jiang","raw_affiliation_strings":["GM Research and Development and Planning, Warren, MI, USA"],"affiliations":[{"raw_affiliation_string":"GM Research and Development and Planning, Warren, MI, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110985847"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2055,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78419453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"4172","last_page":"4177"},"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.9980999827384949,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9980000257492065,"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.926108717918396},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.8500093221664429},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.7005338072776794},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6551149487495422},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.6388905048370361},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5916501879692078},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5316451191902161},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5198826789855957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5163154006004333},{"id":"https://openalex.org/keywords/hybrid-system","display_name":"Hybrid system","score":0.46886545419692993},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44300615787506104},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43560561537742615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.414359986782074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.374423623085022},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3507894277572632},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.0732681155204773}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.926108717918396},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.8500093221664429},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.7005338072776794},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6551149487495422},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.6388905048370361},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5916501879692078},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5316451191902161},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5198826789855957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5163154006004333},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.46886545419692993},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44300615787506104},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43560561537742615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.414359986782074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.374423623085022},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3507894277572632},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0732681155204773},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acc.2007.4282139","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2007.4282139","pdf_url":null,"source":{"id":"https://openalex.org/S4210168941","display_name":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","issn_l":"0743-1619","issn":["0743-1619","2378-5861"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 American Control Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1487657751","https://openalex.org/W1522694098","https://openalex.org/W1793594870","https://openalex.org/W1854239758","https://openalex.org/W1994348879","https://openalex.org/W2060095702","https://openalex.org/W2073536284","https://openalex.org/W2089417871","https://openalex.org/W2094530979","https://openalex.org/W2147340401","https://openalex.org/W2167919796","https://openalex.org/W2913459036","https://openalex.org/W4237055776","https://openalex.org/W6629121833","https://openalex.org/W6631522544","https://openalex.org/W6639075238"],"related_works":["https://openalex.org/W2357387646","https://openalex.org/W4253760428","https://openalex.org/W856973001","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W2952920810","https://openalex.org/W4293477811","https://openalex.org/W2017676950","https://openalex.org/W78063724","https://openalex.org/W197679583"],"abstract_inverted_index":{"We":[0,9,34,54],"study":[1],"the":[2,11,37,47,59,80,103,111,118,136,141],"reachability":[3,38,48,60],"problem":[4,39,49,76,84],"of":[5,13,62,97,131,150],"linear":[6,14,41,51,63,81,93],"hybrid":[7,42],"automata.":[8],"introduce":[10],"notion":[12],"transition":[15,21,52,64],"systems":[16,22,65,146],"that":[17,36],"are":[18],"purely":[19],"discrete":[20],"and":[23,85,122],"do":[24],"not":[25,125],"involve":[26],"any":[27,127],"continuous":[28],"time":[29],"dynamics":[30],"by":[31,66,89],"differential":[32],"equations.":[33],"prove":[35],"for":[40,50,58,102,110,145],"automata":[43],"is":[44,77,100,114],"equivalent":[45],"to":[46,79],"systems.":[53],"provide":[55],"an":[56],"approach":[57,109,142],"analysis":[61],"using":[67,90],"counterexample":[68,74,104,120],"fragment":[69,105,121],"based":[70,116],"abstraction":[71,112],"refinement.":[72],"The":[73],"validation":[75],"reduced":[78],"constraint":[82],"satisfaction":[83],"can":[86],"be":[87],"solved":[88],"methods":[91],"like":[92],"programming.":[94],"An":[95],"algorithm":[96],"good":[98],"complexity":[99],"provided":[101,115],"identification.":[106],"A":[107],"new":[108],"refinement":[113],"on":[117],"identified":[119],"it":[123],"does":[124],"require":[126],"computation":[128],"or":[129],"representation":[130],"reachable":[132],"state":[133],"sets":[134],"in":[135],"abstract":[137],"model,":[138],"which":[139],"makes":[140],"very":[143],"promising":[144],"with":[147],"large":[148],"number":[149],"variables.":[151]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}