{"id":"https://openalex.org/W2147334556","doi":"https://doi.org/10.1109/coase.2013.6654006","title":"Reduction of automated test generation for Simulink/Stateflow to reachability and its novel resolution","display_name":"Reduction of automated test generation for Simulink/Stateflow to reachability and its novel resolution","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2147334556","doi":"https://doi.org/10.1109/coase.2013.6654006","mag":"2147334556"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2013.6654006","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2013.6654006","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","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/A5064287377","display_name":"Meng Li","orcid":"https://orcid.org/0000-0001-7680-1451"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Meng Li","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA#TAB#","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044031773","display_name":"Ratnesh Kumar","orcid":"https://orcid.org/0000-0003-3974-5790"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ratnesh Kumar","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA#TAB#","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064287377"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":1.0876,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79904844,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1089","last_page":"1094"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998000264167786,"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/T13295","display_name":"Safety Systems Engineering in Autonomy","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/stateflow","display_name":"Stateflow","score":0.9903335571289062},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9451531171798706},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7807178497314453},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6129453778266907},{"id":"https://openalex.org/keywords/hybrid-automaton","display_name":"Hybrid automaton","score":0.5873080492019653},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.5388175845146179},{"id":"https://openalex.org/keywords/code-coverage","display_name":"Code coverage","score":0.5361713171005249},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5280531048774719},{"id":"https://openalex.org/keywords/test-case","display_name":"Test case","score":0.5061241984367371},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.49691298604011536},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4888579249382019},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.440146803855896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3348292112350464},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31861746311187744},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31756308674812317},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.1908598244190216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12187832593917847},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.0968640148639679},{"id":"https://openalex.org/keywords/matlab","display_name":"MATLAB","score":0.08833140134811401}],"concepts":[{"id":"https://openalex.org/C2779752788","wikidata":"https://www.wikidata.org/wiki/Q1266659","display_name":"Stateflow","level":3,"score":0.9903335571289062},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9451531171798706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7807178497314453},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6129453778266907},{"id":"https://openalex.org/C2776028153","wikidata":"https://www.wikidata.org/wiki/Q5953179","display_name":"Hybrid automaton","level":3,"score":0.5873080492019653},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.5388175845146179},{"id":"https://openalex.org/C53942775","wikidata":"https://www.wikidata.org/wiki/Q1211721","display_name":"Code coverage","level":3,"score":0.5361713171005249},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5280531048774719},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.5061241984367371},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.49691298604011536},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4888579249382019},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.440146803855896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3348292112350464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31861746311187744},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31756308674812317},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.1908598244190216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12187832593917847},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0968640148639679},{"id":"https://openalex.org/C2780365114","wikidata":"https://www.wikidata.org/wiki/Q169478","display_name":"MATLAB","level":2,"score":0.08833140134811401},{"id":"https://openalex.org/C152877465","wikidata":"https://www.wikidata.org/wiki/Q208042","display_name":"Regression analysis","level":2,"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.1109/coase.2013.6654006","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2013.6654006","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1995512989","https://openalex.org/W2039706992","https://openalex.org/W2104943646","https://openalex.org/W2154654775","https://openalex.org/W2158475682","https://openalex.org/W2170064878"],"related_works":["https://openalex.org/W1927866400","https://openalex.org/W2279235413","https://openalex.org/W3111326146","https://openalex.org/W2109003011","https://openalex.org/W2120347230","https://openalex.org/W2147334556","https://openalex.org/W2591599512","https://openalex.org/W186519456","https://openalex.org/W2066057891","https://openalex.org/W1986706177"],"abstract_inverted_index":{"Simulink/Stateflow":[0,25,41,58],"is":[1,70,84,107],"a":[2,36,47,104],"popular":[3],"commercial":[4],"model-based":[5],"development":[6],"tool":[7],"for":[8,40],"many":[9],"industrial":[10],"domains.":[11],"For":[12],"safety":[13],"and":[14,18,27,60,115],"security":[15],"concerns,":[16],"verification":[17],"testing":[19],"must":[20],"be":[21],"performed":[22],"on":[23,73],"the":[24,28,54,57,63,74,77,82,87,90,94,97],"designs":[26],"generated":[29],"code.":[30],"In":[31],"this":[32],"paper,":[33],"we":[34],"present":[35],"test":[37,113,120],"generation":[38,121],"approach":[39,102],"by":[42],"reduction":[43],"to":[44,86],"reachability":[45,67,83,88],"in":[46,89,109,117],"Hybrid":[48],"Automaton,":[49],"with":[50],"its":[51],"locations":[52],"representing":[53,62],"computations":[55],"of":[56,76,111,119],"model,":[59],"edges":[61],"computation-succession.":[64],"A":[65],"novel":[66],"resolution":[68],"method":[69],"presented":[71],"based":[72],"refinement":[75,98],"hybrid":[78],"automaton":[79],"such":[80],"that":[81,106],"reduced":[85],"underlying":[91],"graph":[92],"(without":[93],"dynamics),":[95],"whenever":[96],"step":[99],"terminates.":[100],"The":[101],"yields":[103],"technique":[105],"effective":[108],"terms":[110,118],"achieving":[112],"coverage":[114],"efficient":[116],"time.":[122]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}