{"id":"https://openalex.org/W1975901756","doi":"https://doi.org/10.1093/imamci/dnt029","title":"A merging method for the siphon-based FMS maximally permissive controllers with simpler structures","display_name":"A merging method for the siphon-based FMS maximally permissive controllers with simpler structures","publication_year":2013,"publication_date":"2013-08-21","ids":{"openalex":"https://openalex.org/W1975901756","doi":"https://doi.org/10.1093/imamci/dnt029","mag":"1975901756"},"language":"en","primary_location":{"id":"doi:10.1093/imamci/dnt029","is_oa":false,"landing_page_url":"https://doi.org/10.1093/imamci/dnt029","pdf_url":null,"source":{"id":"https://openalex.org/S162756791","display_name":"IMA Journal of Mathematical Control and Information","issn_l":"0265-0754","issn":["0265-0754","1471-6887"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IMA Journal of Mathematical Control and Information","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/A5021236088","display_name":"Gaiyun Liu","orcid":"https://orcid.org/0000-0002-4947-6267"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"G. Y. Liu","raw_affiliation_strings":["[School of Electro-Mechanical Engineering, Xidian University, Xi\u2019an 710071, China.]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[School of Electro-Mechanical Engineering, Xidian University, Xi\u2019an 710071, China.]","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111529913","display_name":"Daniel Yuh Chao","orcid":null},"institutions":[{"id":"https://openalex.org/I87354575","display_name":"National Chengchi University","ror":"https://ror.org/03rqk8h36","country_code":"TW","type":"education","lineage":["https://openalex.org/I87354575"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"D. Y. Chao","raw_affiliation_strings":["Department of Management and Information Systems, National ChengChi University, Taipei 116, Taiwan, yuhyaw@gmail.com","Department of Management and Information Systems , National ChengChi University , Taipei 116, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management and Information Systems, National ChengChi University, Taipei 116, Taiwan, yuhyaw@gmail.com","institution_ids":["https://openalex.org/I87354575"]},{"raw_affiliation_string":"Department of Management and Information Systems , National ChengChi University , Taipei 116, Taiwan","institution_ids":["https://openalex.org/I87354575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004568400","display_name":"Murat Uzam","orcid":"https://orcid.org/0000-0001-9625-5523"},"institutions":[{"id":"https://openalex.org/I3132082138","display_name":"Meliksah University","ror":"https://ror.org/05wasnw28","country_code":"TR","type":"education","lineage":["https://openalex.org/I3132082138"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"M. Uzam","raw_affiliation_strings":["Elektrik-Elektronik Muhendislig\u0308i B\u00f6l\u00fcm\u00fc, Muhendislik-Mimarlik Fak\u00fcltesi, Meliksah Universitesi, 38280 Talas/Kayseri, Turkey, murat_uzam@hotmail.com","Elektrik-Elektronik Muhendislig\u0308i B\u00f6l\u00fcm\u00fc, Muhendislik-Mimarlik Fak\u00fcltesi, Meliksah Universitesi, 38280 Talas/Kayseri, Turkey,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Elektrik-Elektronik Muhendislig\u0308i B\u00f6l\u00fcm\u00fc, Muhendislik-Mimarlik Fak\u00fcltesi, Meliksah Universitesi, 38280 Talas/Kayseri, Turkey, murat_uzam@hotmail.com","institution_ids":["https://openalex.org/I3132082138"]},{"raw_affiliation_string":"Elektrik-Elektronik Muhendislig\u0308i B\u00f6l\u00fcm\u00fc, Muhendislik-Mimarlik Fak\u00fcltesi, Meliksah Universitesi, 38280 Talas/Kayseri, Turkey,","institution_ids":["https://openalex.org/I3132082138"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021236088"],"corresponding_institution_ids":["https://openalex.org/I149594827"],"apc_list":{"value":2582,"currency":"GBP","value_usd":3167},"apc_paid":null,"fwci":1.1171,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.77874929,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"31","issue":"4","first_page":"551","last_page":"573"},"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/T11741","display_name":"Flexible and Reconfigurable Manufacturing Systems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9940000176429749,"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/reachability","display_name":"Reachability","score":0.939764142036438},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.7820547819137573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.708920955657959},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.6676508188247681},{"id":"https://openalex.org/keywords/permissive","display_name":"Permissive","score":0.5165764093399048},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5011091232299805},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.4836810529232025},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.44444066286087036},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4289427101612091},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3745708465576172},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.354638010263443},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3317917585372925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2745705246925354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19262313842773438},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.09184759855270386}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.939764142036438},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7820547819137573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.708920955657959},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.6676508188247681},{"id":"https://openalex.org/C15224491","wikidata":"https://www.wikidata.org/wiki/Q7169338","display_name":"Permissive","level":2,"score":0.5165764093399048},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5011091232299805},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.4836810529232025},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.44444066286087036},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4289427101612091},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3745708465576172},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.354638010263443},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3317917585372925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2745705246925354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19262313842773438},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09184759855270386},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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.1093/imamci/dnt029","is_oa":false,"landing_page_url":"https://doi.org/10.1093/imamci/dnt029","pdf_url":null,"source":{"id":"https://openalex.org/S162756791","display_name":"IMA Journal of Mathematical Control and Information","issn_l":"0265-0754","issn":["0265-0754","1471-6887"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IMA Journal of Mathematical Control and Information","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W332683046","https://openalex.org/W1996109622","https://openalex.org/W2037793894","https://openalex.org/W2089870759","https://openalex.org/W2140872435","https://openalex.org/W2147281200","https://openalex.org/W2155682070","https://openalex.org/W2157750688","https://openalex.org/W2165406169"],"related_works":["https://openalex.org/W1904030840","https://openalex.org/W153779636","https://openalex.org/W2144623944","https://openalex.org/W2552031328","https://openalex.org/W2141563078","https://openalex.org/W3083862868","https://openalex.org/W4361186044","https://openalex.org/W2025827957","https://openalex.org/W2036655415","https://openalex.org/W2153540690"],"abstract_inverted_index":{"It":[0,143],"has":[1],"been":[2],"a":[3,52,65,127,134],"hot":[4],"race":[5],"to":[6,10,99,129],"design":[7],"optimal":[8],"controllers":[9],"be":[11],"maximally":[12,32],"permissive":[13,33],"with":[14,43,164],"fewest":[15],"monitors":[16,63,98,114,132],"in":[17,149],"the":[18,46,111,140,145,150,155,165,169],"shortest":[19],"amount":[20],"of":[21,39,55,113,121,168],"time":[22],"for":[23,37],"flexible":[24],"manufacturing":[25],"systems":[26,38],"modelled":[27],"by":[28,49,64,74,93],"Petri":[29],"nets.":[30,170],"Recent":[31],"deadlock":[34],"prevention":[35],"controls":[36],"simple":[40],"sequential":[41],"processes":[42],"resources":[44],"reduce":[45],"computation":[47],"burden":[48],"considering":[50],"only":[51],"small":[53],"portion":[54],"all":[56],"forbidding":[57,76],"markings":[58],"and":[59,96,110],"employ":[60],"much":[61],"fewer":[62],"linear":[66],"integer":[67],"programming":[68],"method.":[69],"Maximal":[70],"permissiveness":[71],"is":[72,116],"ensured":[73],"not":[75,138,161],"any":[77],"live":[78,105,141],"state.":[79],"However,":[80,103],"it":[81],"still":[82],"requires":[83],"costly":[84],"reachability":[85,91,157],"analysis.":[86],"Our":[87],"previous":[88],"work":[89],"avoids":[90],"analysis":[92,158],"classifying":[94],"siphons":[95,101],"adding":[97],"critical":[100,122],"only.":[102],"some":[104],"states":[106],"may":[107],"get":[108],"lost":[109],"number":[112],"required":[115],"as":[117,119],"many":[118],"that":[120],"siphons.":[123],"This":[124],"paper":[125],"proposes":[126],"method":[128],"merge":[130],"several":[131],"into":[133],"single":[135],"one":[136],"while":[137,153],"losing":[139],"states.":[142],"achieves":[144],"same":[146],"best":[147],"results":[148],"existing":[151],"literature":[152],"avoiding":[154],"time-consuming":[156],"which":[159],"does":[160],"scale":[162],"well":[163],"large":[166],"size":[167]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}