{"id":"https://openalex.org/W7131669411","doi":"https://doi.org/10.48550/arxiv.2602.22094","title":"Petri Net Relaxation for Infeasibility Explanation and Sequential Task Planning","display_name":"Petri Net Relaxation for Infeasibility Explanation and Sequential Task Planning","publication_year":2026,"publication_date":"2026-02-25","ids":{"openalex":"https://openalex.org/W7131669411","doi":"https://doi.org/10.48550/arxiv.2602.22094"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.22094","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126879470","display_name":"Nguyen Cong Nhat Le","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Le, Nguyen Cong Nhat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101870284","display_name":"John G. Rogers","orcid":"https://orcid.org/0000-0002-6074-0823"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rogers, John G.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087092493","display_name":"Claire Bonial","orcid":"https://orcid.org/0000-0002-3154-2852"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bonial, Claire N.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029447901","display_name":"Neil T. Dantam","orcid":"https://orcid.org/0000-0002-0907-2241"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dantam, Neil T.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.24005879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9616000056266785,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9616000056266785,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.007600000128149986,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0035000001080334187,"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/reachability","display_name":"Reachability","score":0.8418999910354614},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.8198999762535095},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6237000226974487},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5720999836921692},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4964999854564667},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.45829999446868896},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.44850000739097595},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.41909998655319214}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8418999910354614},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8198999762535095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.630299985408783},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6237000226974487},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5720999836921692},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5382000207901001},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4964999854564667},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.45829999446868896},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.44850000739097595},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.41909998655319214},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4180999994277954},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.37450000643730164},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.35910001397132874},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.33880001306533813},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.322299987077713},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.31040000915527344},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29330000281333923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28060001134872437},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C2777909354","wikidata":"https://www.wikidata.org/wiki/Q1386523","display_name":"Production planning","level":3,"score":0.2768999934196472},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2703999876976013},{"id":"https://openalex.org/C2777869240","wikidata":"https://www.wikidata.org/wiki/Q1424398","display_name":"Flexible manufacturing system","level":3,"score":0.2590999901294708}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.22094","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.22094","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.22094","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":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.22094","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6026778817176819}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Plans":[0],"often":[1],"change":[2],"due":[3],"to":[4,29,60,78,86,98],"changes":[5],"in":[6,43,105,110,114],"the":[7,13,115],"situation":[8],"or":[9,50],"our":[10,88],"understanding":[11],"of":[12,94],"situation.":[14],"Sometimes,":[15],"a":[16,55,91],"feasible":[17,44],"plan":[18,112],"may":[19],"not":[20],"even":[21],"exist,":[22],"and":[23,68,81,108],"identifying":[24],"such":[25],"infeasibilities":[26],"is":[27],"useful":[28],"determine":[30],"when":[31],"requirements":[32],"need":[33],"adjustment.":[34],"Common":[35],"planning":[36,42],"approaches":[37],"focus":[38],"on":[39],"efficient":[40,65],"one-shot":[41,106],"cases":[45],"rather":[46],"than":[47],"updating":[48],"domains":[49],"detecting":[51],"infeasibility.":[52],"We":[53,72],"propose":[54],"Petri":[56],"net":[57],"reachability":[58],"relaxation":[59],"enable":[61],"robust":[62],"invariant":[63],"synthesis,":[64],"goal-unreachability":[66],"detection,":[67],"helpful":[69],"infeasibility":[70],"explanations.":[71],"further":[73],"leverage":[74],"incremental":[75],"constraint":[76,82],"solvers":[77],"support":[79],"goal":[80],"updates.":[83],"Empirically,":[84],"compared":[85],"baselines,":[87],"system":[89],"produces":[90],"comparable":[92],"number":[93],"invariants,":[95],"detects":[96],"up":[97],"2":[99],"times":[100],"more":[101],"infeasibilities,":[102],"performs":[103],"competitively":[104],"planning,":[107],"outperforms":[109],"sequential":[111],"updates":[113],"tested":[116],"domains.":[117]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-02-27T00:00:00"}