{"id":"https://openalex.org/W2164003033","doi":"https://doi.org/10.1137/0213029","title":"An Algorithm for the General Petri Net Reachability Problem","display_name":"An Algorithm for the General Petri Net Reachability Problem","publication_year":1984,"publication_date":"1984-08-01","ids":{"openalex":"https://openalex.org/W2164003033","doi":"https://doi.org/10.1137/0213029","mag":"2164003033"},"language":"en","primary_location":{"id":"doi:10.1137/0213029","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213029","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5109876781","display_name":"Ernst Mayr","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ernst W. Mayr","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109876781"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8937,"has_fulltext":false,"cited_by_count":457,"citation_normalized_percentile":{"value":0.96005352,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"13","issue":"3","first_page":"441","last_page":"460"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9993000030517578,"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":0.9993000030517578,"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/T11567","display_name":"semigroups and automata theory","score":0.9980999827384949,"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/T10679","display_name":"Service-Oriented Architecture and Web Services","score":0.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9572858214378357},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.8097962141036987},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.7479637861251831},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6695801019668579},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.578697681427002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5434428453445435},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4931165874004364},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4629683494567871},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4508787989616394},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.4505780041217804},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4444512724876404},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.4392937123775482},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4241534173488617},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3942298889160156},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27172383666038513},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27142274379730225}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9572858214378357},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8097962141036987},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.7479637861251831},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6695801019668579},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.578697681427002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5434428453445435},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4931165874004364},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4629683494567871},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4508787989616394},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.4505780041217804},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4444512724876404},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.4392937123775482},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4241534173488617},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3942298889160156},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27172383666038513},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27142274379730225},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0213029","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213029","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1516875903","https://openalex.org/W1561267729","https://openalex.org/W1964874178","https://openalex.org/W1971231744","https://openalex.org/W1975261774","https://openalex.org/W2008770192","https://openalex.org/W2014030742","https://openalex.org/W2016549422","https://openalex.org/W2017315323","https://openalex.org/W2027710994","https://openalex.org/W2049741213","https://openalex.org/W2075742699","https://openalex.org/W2083567135","https://openalex.org/W2106001218","https://openalex.org/W2157390113","https://openalex.org/W2162339458","https://openalex.org/W2316437449"],"related_works":["https://openalex.org/W1980200158","https://openalex.org/W2016151994","https://openalex.org/W1978320803","https://openalex.org/W1548737106","https://openalex.org/W1938126780","https://openalex.org/W2149498196","https://openalex.org/W2380814829","https://openalex.org/W1909968065","https://openalex.org/W2400912383","https://openalex.org/W2347589446"],"abstract_inverted_index":{"An":[0],"algorithm":[1,61,78],"is":[2,12,24,54,62,70,79],"presented":[3],"for":[4,45,68],"the":[5,18,30,51],"general":[6],"Petri":[7],"net":[8],"reachability":[9,20,69],"problem.":[10,82],"It":[11],"based":[13],"on":[14],"a":[15,65],"generalization":[16],"of":[17,36,76],"basic":[19],"tree":[21],"construction":[22],"which":[23],"made":[25],"symmetric":[26],"with":[27],"respect":[28],"to":[29,47],"initial":[31],"and":[32,50],"final":[33],"marking.":[34],"Sets":[35],"transition":[37],"sequences":[38],"described":[39],"by":[40,56],"finite":[41],"automata":[42],"are":[43],"used":[44],"approximations":[46],"firing":[48],"sequences,":[49],"approximation":[52,60],"error":[53],"assessed":[55],"Presburger":[57],"expressions.":[58],"The":[59,72],"iterated":[63],"until":[64],"sufficient":[66],"criterion":[67],"satisfied.":[71],"exact":[73],"computational":[74],"complexity":[75],"our":[77],"an":[80],"open":[81]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}