{"id":"https://openalex.org/W7130407152","doi":"https://doi.org/10.48550/arxiv.2602.15739","title":"Hierarchical Decomposition of Separable Workflow-Nets","display_name":"Hierarchical Decomposition of Separable Workflow-Nets","publication_year":2026,"publication_date":"2026-02-17","ids":{"openalex":"https://openalex.org/W7130407152","doi":"https://doi.org/10.48550/arxiv.2602.15739"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.15739","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.15739","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.15739","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025843920","display_name":"Humam Kourani","orcid":"https://orcid.org/0000-0003-2375-2152"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kourani, Humam","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122901952","display_name":"Gyunam Park","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Park, Gyunam","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126295732","display_name":"Wil M. P. van der Aalst","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van der Aalst, Wil M. P.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025843920"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10703","display_name":"Business Process Modeling and Analysis","score":0.9886000156402588,"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"}},"topics":[{"id":"https://openalex.org/T10703","display_name":"Business Process Modeling and Analysis","score":0.9886000156402588,"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"}},{"id":"https://openalex.org/T10679","display_name":"Service-Oriented Architecture and Web Services","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11986","display_name":"Scientific Computing and Data Management","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6309999823570251},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.47760000824928284},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.4758000075817108},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.4668999910354614},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.3407999873161316},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.3352999985218048},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.32850000262260437},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.31630000472068787}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6309999823570251},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5885999798774719},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4966999888420105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4943999946117401},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.47760000824928284},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.4758000075817108},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.4668999910354614},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.3407999873161316},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3352999985218048},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.32850000262260437},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2919999957084656},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C179603123","wikidata":"https://www.wikidata.org/wiki/Q1941921","display_name":"Modeling language","level":3,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.15739","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.15739","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2602.15739","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.15739","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"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":{"The":[0,98],"Partially":[1],"Ordered":[2],"Workflow":[3],"Language":[4],"(POWL)":[5],"has":[6,37],"recently":[7,38],"emerged":[8],"as":[9],"a":[10,82,214],"process":[11,197,221,263],"modeling":[12,49],"notation,":[13],"offering":[14],"strong":[15],"quality":[16],"guarantees":[17],"and":[18,33,53,65,88,107,126,138,188,219,265],"high":[19,202],"expressiveness.":[20],"While":[21],"early":[22],"versions":[23],"of":[24,50,63,146,158,167,173,185,216,259],"POWL":[25,41,64,95,112,153,234,260],"relied":[26],"on":[27,170,195],"strict":[28],"block-structured":[29],"operators":[30],"for":[31,69,85,123,256],"choices":[32,125],"loops,":[34,127],"the":[35,48,57,60,66,105,115,144,151,156,159,165,171,182,243,254],"language":[36,157],"evolved":[39],"into":[40,93,110],"2.0,":[42],"introducing":[43],"choice":[44,132],"graphs":[45,133],"to":[46,134,178,199,205,213,241],"enable":[47],"non-block-structured":[51],"decisions":[52],"cycles.":[54],"To":[55],"bridge":[56],"gap":[58],"between":[59],"theoretical":[61],"advantages":[62],"practical":[67,208,262],"need":[68],"compatibility":[70],"with":[71],"established":[72],"notations,":[73],"robust":[74],"model":[75,154],"transformations":[76],"are":[77],"required.":[78],"This":[79,251],"paper":[80],"presents":[81],"novel":[83],"algorithm":[84,99,130,169,194,224],"transforming":[86],"safe":[87],"sound":[89],"workflow":[90],"nets":[91,179],"(WF-nets)":[92],"equivalent":[94],"2.0":[96],"models.":[97,222],"recursively":[100],"identifies":[101],"structural":[102],"patterns":[103],"within":[104],"WF-net":[106],"translates":[108],"them":[109],"their":[111],"representation.":[113],"Unlike":[114],"previous":[116],"approach":[117],"that":[118,150,233],"required":[119],"separate":[120],"detection":[121],"strategies":[122],"exclusive":[124],"our":[128,147,168,193],"new":[129],"utilizes":[131],"capture":[135,242],"generalized":[136],"decision":[137],"cyclic":[139],"patterns.":[140],"We":[141,191],"formally":[142],"prove":[143,164],"correctness":[145],"approach,":[148],"showing":[149],"generated":[152],"preserves":[155],"input":[160],"WF-net.":[161],"Furthermore,":[162,204],"we":[163,210],"completeness":[166],"class":[172],"separable":[174],"WF-nets,":[175],"which":[176],"corresponds":[177],"constructed":[180],"via":[181],"hierarchical":[183],"nesting":[184],"state":[186],"machines":[187],"marked":[189],"graphs.":[190],"evaluate":[192],"large-scale":[196],"models":[198,228],"demonstrate":[200],"its":[201,207],"scalability.":[203],"test":[206],"expressiveness,":[209],"applied":[211],"it":[212],"benchmark":[215],"1,493":[217],"industrial":[218],"synthetic":[220],"Our":[223],"successfully":[225],"transformed":[226],"all":[227],"in":[229,247,261],"this":[230],"benchmark,":[231],"suggesting":[232],"2.0's":[235],"expressive":[236],"power":[237],"is":[238],"generally":[239],"sufficient":[240],"complex":[244],"logic":[245],"found":[246],"real-world":[248],"business":[249],"processes.":[250],"work":[252],"paves":[253],"way":[255],"broader":[257],"adoption":[258],"analysis":[264],"improvement":[266],"applications.":[267]},"counts_by_year":[],"updated_date":"2026-02-19T06:31:58.851227","created_date":"2026-02-19T00:00:00"}