{"id":"https://openalex.org/W7123337101","doi":"https://doi.org/10.1109/cdc57313.2025.11312490","title":"A New Algorithm for Time-interval Diagnosability Verification","display_name":"A New Algorithm for Time-interval Diagnosability Verification","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123337101","doi":"https://doi.org/10.1109/cdc57313.2025.11312490"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312490","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","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/A5084148471","display_name":"Christiano H. Rezende","orcid":"https://orcid.org/0000-0002-2561-9251"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Christiano H. Rezende","raw_affiliation_strings":["Federal University of Rio de Janeiro,Electrical Engineering Department,Rio de Janeiro,Brazil,21949-900"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Rio de Janeiro,Electrical Engineering Department,Rio de Janeiro,Brazil,21949-900","institution_ids":["https://openalex.org/I122140584"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039874372","display_name":"Gustavo S. Viana","orcid":"https://orcid.org/0000-0002-9444-9372"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Gustavo S. Viana","raw_affiliation_strings":["Federal University of Rio de Janeiro,Electrical Engineering Department,Rio de Janeiro,Brazil,21949-900"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Rio de Janeiro,Electrical Engineering Department,Rio de Janeiro,Brazil,21949-900","institution_ids":["https://openalex.org/I122140584"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072898619","display_name":"Jo\u00e3o Carlos Basilio","orcid":"https://orcid.org/0000-0002-3737-0617"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jo\u00e3o C. Basilio","raw_affiliation_strings":["Federal University of Rio de Janeiro,Electrical Engineering Department,Rio de Janeiro,Brazil,21949-900"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Rio de Janeiro,Electrical Engineering Department,Rio de Janeiro,Brazil,21949-900","institution_ids":["https://openalex.org/I122140584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.70060428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1253","last_page":"1258"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.820900022983551,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.820900022983551,"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/T10142","display_name":"Formal Methods in Verification","score":0.02879999950528145,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.01979999989271164,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/automaton","display_name":"Automaton","score":0.696399986743927},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6376000046730042},{"id":"https://openalex.org/keywords/event","display_name":"Event (particle physics)","score":0.5038999915122986},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4575999975204468},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.3659000098705292},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.3402000069618225}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.696399986743927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6712999939918518},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6700000166893005},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6376000046730042},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.5038999915122986},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4575999975204468},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42719998955726624},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.3659000098705292},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3402000069618225},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.33379998803138733},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.33009999990463257},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.2937999963760376},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25769999623298645}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312490","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Diagnosability":[0],"verification":[1,46],"is":[2,56],"crucial":[3],"for":[4,12,21,43,51,65],"ensuring":[5],"faults":[6],"can":[7],"be":[8,59],"reliably":[9],"detected":[10],"and":[11,79,90],"enabling":[13],"effective":[14],"diagnostic":[15],"systems.":[16],"While":[17],"polynomial-time":[18],"methods":[19],"exist":[20],"untimed":[22],"Discrete":[23],"Event":[24],"Systems":[25],"(DES),":[26],"verifying":[27],"diagnosability":[28,45],"in":[29],"timed":[30],"DES":[31],"remains":[32],"computationally":[33],"challenging.":[34],"In":[35],"this":[36],"paper":[37],"we":[38,83],"propose":[39],"a":[40,70,85],"novel":[41],"algorithm":[42,68],"time-interval":[44],"based":[47],"on":[48],"the":[49,63,75,92],"search":[50,64],"strongly":[52],"connected":[53],"components,":[54],"which":[55],"proven":[57],"to":[58,73],"more":[60],"efficient":[61],"than":[62],"cycles.":[66],"The":[67],"constructs":[69],"verifier":[71],"automaton":[72],"compute":[74],"intersection":[76],"between":[77],"non-faulty":[78],"faulty":[80],"behaviors.":[81],"Additionally,":[82],"provide":[84],"detailed":[86],"computational":[87],"complexity":[88],"analysis":[89],"demonstrate":[91],"results":[93],"through":[94],"an":[95],"illustrative":[96],"example.":[97]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-14T00:00:00"}