{"id":"https://openalex.org/W4402665431","doi":"https://doi.org/10.3233/fi-242196","title":"Taking Complete Finite Prefixes To High Level, Symbolically*","display_name":"Taking Complete Finite Prefixes To High Level, Symbolically*","publication_year":2024,"publication_date":"2024-09-20","ids":{"openalex":"https://openalex.org/W4402665431","doi":"https://doi.org/10.3233/fi-242196"},"language":"en","primary_location":{"id":"doi:10.3233/fi-242196","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-242196","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5036983822","display_name":"Nick W\u00fcrdemann","orcid":"https://orcid.org/0000-0001-7934-820X"},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Nick W\u00fcrdemann","raw_affiliation_strings":["Department of Computing Science, University of Oldenburg, Oldenburg, Germany. wuerdemann@informatik.uni-oldenburg.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Oldenburg, Oldenburg, Germany. wuerdemann@informatik.uni-oldenburg.de","institution_ids":["https://openalex.org/I129877168"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082604436","display_name":"Thomas Chatain","orcid":"https://orcid.org/0000-0002-1470-5074"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Thomas Chatain","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay, INRIA and LMF, CNRS and ENS Paris-Saclay, Gif-sur-Yvette, France. thomas.chatain@inria.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, INRIA and LMF, CNRS and ENS Paris-Saclay, Gif-sur-Yvette, France. thomas.chatain@inria.fr","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008279822","display_name":"Stefan Haar","orcid":"https://orcid.org/0000-0002-1892-2703"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Stefan Haar","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay, INRIA and LMF, CNRS and ENS Paris-Saclay, Gif-sur-Yvette, France. stefan.haar@inria.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, INRIA and LMF, CNRS and ENS Paris-Saclay, Gif-sur-Yvette, France. stefan.haar@inria.fr","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5093320982","display_name":"Lukas Panneke","orcid":null},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Lukas Panneke","raw_affiliation_strings":["Department of Computing Science, University of Oldenburg, Oldenburg, Germany. lukas.panneke@informatik.uni-oldenburg.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Oldenburg, Oldenburg, Germany. lukas.panneke@informatik.uni-oldenburg.de","institution_ids":["https://openalex.org/I129877168"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008279822","https://openalex.org/A5036983822","https://openalex.org/A5082604436","https://openalex.org/A5093320982"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I129877168","https://openalex.org/I1326498283","https://openalex.org/I277688954"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2234495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"192","issue":"3-4","first_page":"313","last_page":"361"},"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.9991000294685364,"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.9991000294685364,"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/T10142","display_name":"Formal Methods in Verification","score":0.9957000017166138,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9955999851226807,"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/petri-net","display_name":"Petri net","score":0.9420304298400879},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.8496519923210144},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8172650337219238},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6662088632583618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6502000689506531},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6009281873703003},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.5520805716514587},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5495010614395142},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.5135347843170166},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5072538256645203},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5026381015777588},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43790706992149353},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3823153078556061},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3627081513404846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3078523874282837},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13990914821624756}],"concepts":[{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.9420304298400879},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.8496519923210144},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8172650337219238},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6662088632583618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6502000689506531},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6009281873703003},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.5520805716514587},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5495010614395142},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.5135347843170166},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5072538256645203},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5026381015777588},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43790706992149353},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3823153078556061},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3627081513404846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3078523874282837},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13990914821624756},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-242196","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-242196","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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":0,"referenced_works":[],"related_works":["https://openalex.org/W1980200158","https://openalex.org/W2154794415","https://openalex.org/W2107824370","https://openalex.org/W2522627362","https://openalex.org/W2110957508","https://openalex.org/W2387511021","https://openalex.org/W2095453628","https://openalex.org/W2400441765","https://openalex.org/W2380814829","https://openalex.org/W2292945367"],"abstract_inverted_index":{"Unfoldings":[0],"are":[1],"a":[2,38,71,98,109,150],"well":[3],"known":[4],"partial-order":[5],"semantics":[6],"of":[7,37,50,62,66,73,113],"P/T":[8,39,146],"Petri":[9,24,40,68,76],"nets":[10,114],"that":[11,137],"can":[12],"be":[13,142],"applied":[14,143],"to":[15,46,144],"various":[16],"model":[17],"checking":[18],"or":[19],"verification":[20],"problems.":[21],"For":[22,70],"high-level":[23,67,75,151],"nets,":[25,77],"the":[26,63,80,130,135,138,145],"so-called":[27],"symbolic":[28,64],"unfolding":[29,42,65],"generalizes":[30],"this":[31,94],"notion.":[32],"A":[33],"complete":[34,59,131],"finite":[35,60],"prefix":[36,132],"net\u2019s":[41],"contains":[43],"all":[44],"information":[45],"verify,":[47],"e.g.,":[48],"reachability":[49],"markings.":[51],"We":[52,92],"unite":[53],"these":[54],"two":[55],"concepts":[56],"and":[57],"define":[58],"prefixes":[61],"nets.":[69],"class":[72,112],"safe":[74],"we":[78,107],"generalize":[79],"well-known":[81],"algorithm":[82,96,140],"by":[83,149],"Esparza":[84],"et":[85],"al.":[86],"for":[87,120],"constructing":[88],"small":[89],"such":[90],"prefixes.":[91],"evaluate":[93],"extended":[95],"through":[97],"prototype":[99],"implementation":[100],"on":[101],"four":[102],"novel":[103],"benchmark":[104],"families.":[105],"Additionally,":[106],"identify":[108],"more":[110],"general":[111],"with":[115,124],"infinitely":[116],"many":[117],"reachable":[118],"markings,":[119],"which":[121],"an":[122,125],"approach":[123],"adapted":[126],"cut-off":[127],"criterion":[128],"extends":[129],"methodology,":[133],"in":[134],"sense":[136],"original":[139],"cannot":[141],"net":[147],"represented":[148],"net.":[152]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}