{"id":"https://openalex.org/W2030871020","doi":"https://doi.org/10.1109/iri.2014.7051927","title":"Reachability in hierarchical machines","display_name":"Reachability in hierarchical machines","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2030871020","doi":"https://doi.org/10.1109/iri.2014.7051927","mag":"2030871020"},"language":"en","primary_location":{"id":"doi:10.1109/iri.2014.7051927","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iri.2014.7051927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 IEEE 15th International Conference on Information Reuse and Integration (IEEE IRI 2014)","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/A5050633462","display_name":"Omer Nguena Timo","orcid":"https://orcid.org/0000-0002-8336-6600"},"institutions":[{"id":"https://openalex.org/I4210111842","display_name":"Computer Research Institute of Montr\u00e9al","ror":"https://ror.org/0279d5115","country_code":"CA","type":"nonprofit","lineage":["https://openalex.org/I4210111842"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Omer Nguena Timo","raw_affiliation_strings":["CRIM, Computer Research Institute of Montreal, Montreal, Canada","Computer Research Institute of Montreal, CRIM Montreal, Canada"],"affiliations":[{"raw_affiliation_string":"CRIM, Computer Research Institute of Montreal, Montreal, Canada","institution_ids":["https://openalex.org/I4210111842"]},{"raw_affiliation_string":"Computer Research Institute of Montreal, CRIM Montreal, Canada","institution_ids":["https://openalex.org/I4210111842"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079848365","display_name":"Alexandre Petrenko","orcid":"https://orcid.org/0000-0002-2938-1666"},"institutions":[{"id":"https://openalex.org/I4210111842","display_name":"Computer Research Institute of Montr\u00e9al","ror":"https://ror.org/0279d5115","country_code":"CA","type":"nonprofit","lineage":["https://openalex.org/I4210111842"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alexandre Petrenko","raw_affiliation_strings":["CRIM, Computer Research Institute of Montreal, Montreal, Canada","Computer Research Institute of Montreal, CRIM Montreal, Canada"],"affiliations":[{"raw_affiliation_string":"CRIM, Computer Research Institute of Montreal, Montreal, Canada","institution_ids":["https://openalex.org/I4210111842"]},{"raw_affiliation_string":"Computer Research Institute of Montreal, CRIM Montreal, Canada","institution_ids":["https://openalex.org/I4210111842"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024103899","display_name":"Arnaud Dury","orcid":null},"institutions":[{"id":"https://openalex.org/I4210111842","display_name":"Computer Research Institute of Montr\u00e9al","ror":"https://ror.org/0279d5115","country_code":"CA","type":"nonprofit","lineage":["https://openalex.org/I4210111842"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Arnaud Dury","raw_affiliation_strings":["CRIM, Computer Research Institute of Montreal, Montreal, Canada","Computer Research Institute of Montreal, CRIM Montreal, Canada"],"affiliations":[{"raw_affiliation_string":"CRIM, Computer Research Institute of Montreal, Montreal, Canada","institution_ids":["https://openalex.org/I4210111842"]},{"raw_affiliation_string":"Computer Research Institute of Montreal, CRIM Montreal, Canada","institution_ids":["https://openalex.org/I4210111842"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081333705","display_name":"S. Ramesh","orcid":"https://orcid.org/0000-0003-1361-8224"},"institutions":[{"id":"https://openalex.org/I4210113932","display_name":"Materials Systems (United States)","ror":"https://ror.org/027smmx64","country_code":"US","type":"company","lineage":["https://openalex.org/I4210113932"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Ramesh","raw_affiliation_strings":["GM Global R&D, MI, USA","GM Global R&D Warren, MI, USA"],"affiliations":[{"raw_affiliation_string":"GM Global R&D, MI, USA","institution_ids":[]},{"raw_affiliation_string":"GM Global R&D Warren, MI, USA","institution_ids":["https://openalex.org/I4210113932"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5050633462"],"corresponding_institution_ids":["https://openalex.org/I4210111842"],"apc_list":null,"apc_paid":null,"fwci":0.33390117,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63632771,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"7641","issue":null,"first_page":"475","last_page":"482"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9993000030517578,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9976999759674072,"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.9359436631202698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7953575849533081},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6742562055587769},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5248030424118042},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5124766826629639},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4817495346069336},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4681936204433441},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.44831469655036926},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4341107904911041},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3709149956703186},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09489274024963379}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9359436631202698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7953575849533081},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6742562055587769},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5248030424118042},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5124766826629639},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4817495346069336},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4681936204433441},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.44831469655036926},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4341107904911041},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3709149956703186},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09489274024963379},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iri.2014.7051927","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iri.2014.7051927","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 IEEE 15th International Conference on Information Reuse and Integration (IEEE IRI 2014)","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":35,"referenced_works":["https://openalex.org/W92641534","https://openalex.org/W191885481","https://openalex.org/W197240239","https://openalex.org/W1488872683","https://openalex.org/W1498631091","https://openalex.org/W1522465028","https://openalex.org/W1545078856","https://openalex.org/W1766479663","https://openalex.org/W1934855418","https://openalex.org/W1977116278","https://openalex.org/W2025480213","https://openalex.org/W2035610952","https://openalex.org/W2060993374","https://openalex.org/W2070633450","https://openalex.org/W2075773711","https://openalex.org/W2082036629","https://openalex.org/W2084555692","https://openalex.org/W2099529102","https://openalex.org/W2099940665","https://openalex.org/W2110052743","https://openalex.org/W2122676216","https://openalex.org/W2125415493","https://openalex.org/W2125967324","https://openalex.org/W2129538349","https://openalex.org/W2132622501","https://openalex.org/W2132661148","https://openalex.org/W2139059344","https://openalex.org/W2147880466","https://openalex.org/W2159433799","https://openalex.org/W6607686876","https://openalex.org/W6608007799","https://openalex.org/W6629753033","https://openalex.org/W6632364754","https://openalex.org/W6640180613","https://openalex.org/W6679528512"],"related_works":["https://openalex.org/W2884574904","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":{"In":[0],"this":[1,55],"paper":[2],"we":[3,18,43,77],"study":[4],"the":[5,49,59,113,117,131,134],"reachability":[6,80,135],"analysis":[7,81,136],"problem":[8],"for":[9,83],"timed":[10],"systems":[11],"specified":[12],"in":[13,70,126],"a":[14,20,45,79,90],"hierarchical":[15,24,93,114],"manner.":[16],"First":[17],"provide":[19],"formal":[21],"model,":[22],"called":[23],"extended":[25],"Mealy":[26],"machine":[27],"with":[28,36],"timer,":[29],"input":[30],"and":[31,39],"output":[32,38],"events,":[33],"as":[34],"well":[35],"input,":[37],"context":[40],"variables.":[41],"Then":[42],"present":[44],"synchronous":[46],"semantics":[47],"of":[48,54,61,89,99,106,116,121,133,137],"model.":[50],"A":[51],"main":[52],"feature":[53],"model":[56],"is":[57,64,124,130],"that":[58],"crossing":[60],"superstates'":[62],"boundaries":[63],"forbidden,":[65],"i.e.,":[66],"transitions":[67],"between":[68,87],"states":[69],"different":[71],"superstates":[72],"are":[73],"not":[74],"allowed.":[75],"Finally":[76],"propose":[78],"method":[82],"finding":[84],"(minimal)":[85],"executions":[86],"configurations":[88],"given":[91],"deterministic":[92],"machine.":[94,118],"Executions":[95],"may":[96],"require":[97],"resetting":[98],"some":[100,105],"constituent":[101,138],"machines":[102],"by":[103],"entering":[104],"their":[107],"ancestor":[108],"states.":[109],"The":[110,119],"algorithm":[111,123],"exploits":[112],"structure":[115],"complexity":[120,132],"our":[122],"linear":[125],"R":[127,129],"where":[128],"machines.":[139]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}