{"id":"https://openalex.org/W2935928249","doi":"https://doi.org/10.1109/tac.2019.2897511","title":"Corrections to \u201cOn the Decidability and Complexity of Diagnosability for Labeled Petri Nets\u201d [Nov 17 5931-5938]","display_name":"Corrections to \u201cOn the Decidability and Complexity of Diagnosability for Labeled Petri Nets\u201d [Nov 17 5931-5938]","publication_year":2019,"publication_date":"2019-02-13","ids":{"openalex":"https://openalex.org/W2935928249","doi":"https://doi.org/10.1109/tac.2019.2897511","mag":"2935928249"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2019.2897511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2019.2897511","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/A5034304769","display_name":"Xiang Yin","orcid":"https://orcid.org/0000-0003-1944-1570"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xiang Yin","raw_affiliation_strings":["University of Michigan Gerald R Ford School of Public Policy, Ann Arbor, MI, US"],"affiliations":[{"raw_affiliation_string":"University of Michigan Gerald R Ford School of Public Policy, Ann Arbor, MI, US","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027585653","display_name":"St\u00e9phane Lafortune","orcid":"https://orcid.org/0000-0002-7526-6642"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephane Lafortune","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034304769"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.388,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61674043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"64","issue":"4","first_page":"1768","last_page":"1768"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","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/T11125","display_name":"Petri Nets in System Modeling","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/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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/T10703","display_name":"Business Process Modeling and Analysis","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.9407914876937866},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.8840325474739075},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8154858946800232},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.8118489980697632},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6046011447906494},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5735099911689758},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.510396420955658},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5009157657623291},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.49184346199035645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4517665207386017},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45049819350242615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3452197313308716}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.9407914876937866},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8840325474739075},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8154858946800232},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.8118489980697632},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6046011447906494},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5735099911689758},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.510396420955658},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5009157657623291},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.49184346199035645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4517665207386017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45049819350242615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3452197313308716},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/tac.2019.2897511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2019.2897511","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2044858512","https://openalex.org/W2158243788","https://openalex.org/W2607898266","https://openalex.org/W2831356539"],"related_works":["https://openalex.org/W2032269072","https://openalex.org/W1989788631","https://openalex.org/W1999231617","https://openalex.org/W2099490078","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W2150468037","https://openalex.org/W3125880387","https://openalex.org/W1531156418"],"abstract_inverted_index":{"This":[0,50],"note":[1],"aims":[2],"to":[3,39],"correct":[4,74],"a":[5,40,108],"complexity":[6,69],"result":[7,23,70],"in":[8,81,103,120],"our":[9],"paper":[10],"that":[11,31,66],"investigates":[12],"the":[13,32,94,99,112],"verification":[14,34],"of":[15,24],"diagnosability":[16,33],"for":[17,107],"unbounded":[18],"Petri":[19,41],"nets.":[20],"The":[21],"main":[22,51],"[1]":[25],"is":[26,53,71,85,90],"Theorem":[27],"IV.1,":[28],"which":[29,97],"shows":[30],"problem":[35,45,48,84,116],"can":[36,117],"be":[37,118],"reduced":[38],"net":[42],"model":[43],"checking":[44],"called":[46,111],"Yen's":[47,67,83,115],"[2].":[49],"reduction":[52],"still":[54,86],"correct.":[55],"However,":[56],"it":[57,89],"was":[58],"pointed":[59],"out":[60],"by":[61],"Atig":[62],"and":[63,105],"Habermehl":[64],"[3]":[65],"original":[68,100],"not":[72],"completely":[73],"1.":[75],"Specifically,":[76],"they":[77],"showed":[78],"that:":[79],"(i)":[80],"general,":[82],"decidable,":[87],"but":[88],"as":[91,93],"hard":[92],"reachability":[95],"problem,":[96],"corrects":[98],"EXPSPACE-completeness":[101],"claim":[102],"[2];":[104],"(ii)":[106],"special":[109],"case":[110],"increasing":[113],"fragment,":[114],"solved":[119],"EXPSPACE.":[121]},"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"}