{"id":"https://openalex.org/W2491068252","doi":"https://doi.org/10.1109/tdsc.2016.2596719","title":"Symbolic Synthesis of Timed Models with Strict 2-Phase Fault Recovery","display_name":"Symbolic Synthesis of Timed Models with Strict 2-Phase Fault Recovery","publication_year":2016,"publication_date":"2016-07-29","ids":{"openalex":"https://openalex.org/W2491068252","doi":"https://doi.org/10.1109/tdsc.2016.2596719","mag":"2491068252"},"language":"en","primary_location":{"id":"doi:10.1109/tdsc.2016.2596719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tdsc.2016.2596719","pdf_url":null,"source":{"id":"https://openalex.org/S133795288","display_name":"IEEE Transactions on Dependable and Secure Computing","issn_l":"1545-5971","issn":["1545-5971","1941-0018","2160-9209"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Dependable and Secure Computing","raw_type":"journal-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/A5011331492","display_name":"Fathiyeh Faghih","orcid":"https://orcid.org/0000-0002-8877-6895"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Fathiyeh Faghih","raw_affiliation_strings":["Department of Computing and Software, McMaster University, Hamilton, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing and Software, McMaster University, Hamilton, ON, Canada","institution_ids":["https://openalex.org/I98251732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008486466","display_name":"Borzoo Bonakdarpour","orcid":"https://orcid.org/0000-0003-1800-5419"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Borzoo Bonakdarpour","raw_affiliation_strings":["Department of Computing and Software, McMaster University, Hamilton, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing and Software, McMaster University, Hamilton, ON, Canada","institution_ids":["https://openalex.org/I98251732"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011331492"],"corresponding_institution_ids":["https://openalex.org/I98251732"],"apc_list":null,"apc_paid":null,"fwci":0.3485,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66664613,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":"3","first_page":"526","last_page":"541"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9994999766349792,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9983999729156494,"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/computer-science","display_name":"Computer science","score":0.8091970682144165},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.739958643913269},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.672360897064209},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.5774932503700256},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5656239986419678},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4874451458454132},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48658859729766846},{"id":"https://openalex.org/keywords/fault-model","display_name":"Fault model","score":0.47771692276000977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4660924971103668}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8091970682144165},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.739958643913269},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.672360897064209},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.5774932503700256},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5656239986419678},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4874451458454132},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48658859729766846},{"id":"https://openalex.org/C167391956","wikidata":"https://www.wikidata.org/wiki/Q1401211","display_name":"Fault model","level":3,"score":0.47771692276000977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4660924971103668},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tdsc.2016.2596719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tdsc.2016.2596719","pdf_url":null,"source":{"id":"https://openalex.org/S133795288","display_name":"IEEE Transactions on Dependable and Secure Computing","issn_l":"1545-5971","issn":["1545-5971","1941-0018","2160-9209"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Dependable and Secure Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1482233117","https://openalex.org/W1495189504","https://openalex.org/W1508451833","https://openalex.org/W1526031273","https://openalex.org/W1544017304","https://openalex.org/W1574125125","https://openalex.org/W1588748596","https://openalex.org/W1599995366","https://openalex.org/W1606824214","https://openalex.org/W1786377004","https://openalex.org/W1839854015","https://openalex.org/W1983791345","https://openalex.org/W2026533872","https://openalex.org/W2048355938","https://openalex.org/W2048713255","https://openalex.org/W2059057465","https://openalex.org/W2089237214","https://openalex.org/W2091093450","https://openalex.org/W2101508170","https://openalex.org/W2139101939","https://openalex.org/W2144965436","https://openalex.org/W2150220388","https://openalex.org/W2180677596","https://openalex.org/W2914206182","https://openalex.org/W2997049506","https://openalex.org/W3038004135","https://openalex.org/W4234047104","https://openalex.org/W6680662700"],"related_works":["https://openalex.org/W1495872178","https://openalex.org/W1522712643","https://openalex.org/W2136070637","https://openalex.org/W2102135785","https://openalex.org/W2604841551","https://openalex.org/W1561479309","https://openalex.org/W1968437296","https://openalex.org/W4313193894","https://openalex.org/W2746280673","https://openalex.org/W2560415449"],"abstract_inverted_index":{"In":[0],"this":[1],"article,":[2],"we":[3],"focus":[4],"on":[5],"efficient":[6],"synthesis":[7,21,47,63],"of":[8,19,32,36,42,79,95,101,113,152,158],"fault-tolerant":[9,123],"timed":[10,80,91,115,124],"models":[11],"from":[12],"their":[13],"fault-intolerant":[14],"version.":[15],"Although":[16],"the":[17,20,30,33,37,40,43,60,77,114,140,146,150,156],"complexity":[18,72],"problem":[22,69],"is":[23,55,64,73,137,162],"known":[24],"to":[25,59,120,145],"be":[26,51],"polynomial":[27],"time":[28],"in":[29,56,65,76,149,155,164],"size":[31],"time-abstract":[34],"bisimulation":[35],"input":[38,89,147],"model,":[39],"state":[41],"art":[44],"currently":[45],"lacks":[46],"algorithms":[48],"that":[49,62,86,139],"can":[50],"efficiently":[52],"implemented.":[53],"This":[54],"part":[57],"due":[58],"fact":[61],"general":[66],"a":[67,90,93,99,109,122],"challenging":[68],"and":[70,98,103,107,154,171],"its":[71],"significantly":[74],"magnified":[75],"context":[78],"systems.":[81],"We":[82],"propose":[83],"an":[84],"algorithm":[85],"takes":[87],"as":[88,126],"automaton,":[92],"set":[94,100],"fault":[96,160],"actions,":[97],"safety":[102,170],"bounded-time":[104],"response":[105],"properties,":[106],"utilizes":[108],"space-efficient":[110],"symbolic":[111],"representation":[112],"automaton":[116,125,130],"(called":[117],"zone":[118],"graph)":[119],"synthesize":[121],"output.":[127],"The":[128],"output":[129,141],"satisfies":[131],"strict":[132],"phased":[133],"recovery,":[134],"where":[135],"it":[136],"guaranteed":[138],"model":[142,148],"behaves":[143],"similarly":[144],"absence":[151],"faults":[153],"presence":[157],"faults,":[159],"recovery":[161],"achieved":[163],"two":[165],"phases,":[166],"each":[167],"satisfying":[168],"certain":[169],"timing":[172],"constraints.":[173]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}