{"id":"https://openalex.org/W2011495892","doi":"https://doi.org/10.1145/800076.802477","title":"An algorithm for the general Petri net reachability problem","display_name":"An algorithm for the general Petri net reachability problem","publication_year":1981,"publication_date":"1981-01-01","ids":{"openalex":"https://openalex.org/W2011495892","doi":"https://doi.org/10.1145/800076.802477","mag":"2011495892"},"language":"en","primary_location":{"id":"doi:10.1145/800076.802477","doi":"https://doi.org/10.1145/800076.802477","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800076.802477","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800076.802477","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/800076.802477","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032081403","display_name":"Ernst W. Mayr","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ernst W. Mayr","raw_affiliation_strings":["","Visiting Scientist l,aboratory tbr (L~mptlter Science Massachttsclts lnslitute of Technology 545 Fechnology Square. Cambridge. Mass. 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]},{"raw_affiliation_string":"Visiting Scientist l,aboratory tbr (L~mptlter Science Massachttsclts lnslitute of Technology 545 Fechnology Square. Cambridge. Mass. 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032081403"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":3.541,"has_fulltext":true,"cited_by_count":312,"citation_normalized_percentile":{"value":0.93142857,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"238","last_page":"246"},"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/T10142","display_name":"Formal Methods in Verification","score":9.999999747378752e-05,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/petri-nets","display_name":"Petri nets","score":0.9890000224113464},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"reachability problem","score":0.9829999804496765},{"id":"https://openalex.org/keywords/firing-sequences","display_name":"firing sequences","score":0.718999981880188},{"id":"https://openalex.org/keywords/transition-sequences","display_name":"transition sequences","score":0.8349999785423279},{"id":"https://openalex.org/keywords/finite-state-machines","display_name":"finite automata","score":0.9679999947547913},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7080000042915344}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9795166850090027},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8776472806930542},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.7737505435943604},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.741675078868866},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6918010115623474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5718382596969604},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.5536940693855286},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5338113903999329},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.49778032302856445},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42607390880584717},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39651036262512207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38287442922592163},{"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.1145/800076.802477","doi":"https://doi.org/10.1145/800076.802477","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800076.802477","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800076.802477","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/800076.802477","doi":"https://doi.org/10.1145/800076.802477","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800076.802477","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800076.802477","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2011495892.pdf","grobid_xml":"https://content.openalex.org/works/W2011495892.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W176352433","https://openalex.org/W1516875903","https://openalex.org/W1566739370","https://openalex.org/W1964874178","https://openalex.org/W1966307150","https://openalex.org/W1971231744","https://openalex.org/W2003894975","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","https://openalex.org/W2534716737","https://openalex.org/W6610195739"],"related_works":["https://openalex.org/W2306898689","https://openalex.org/W1980580719","https://openalex.org/W1551903405","https://openalex.org/W2141183298","https://openalex.org/W7098099362","https://openalex.org/W7100603428","https://openalex.org/W2167180332","https://openalex.org/W2202719247","https://openalex.org/W144646275","https://openalex.org/W1969717724"],"abstract_inverted_index":{"An":[0],"algorithm":[1,59],"is":[2,21,50,60],"presented":[3],"for":[4,41,66],"the":[5,16,26,47,72],"general":[6],"Petri":[7],"net":[8],"reachability":[9,18,67],"problem":[10],"based":[11],"on":[12],"a":[13,63],"generalization":[14],"of":[15,32],"basic":[17],"construction":[19],"which":[20],"symmetric":[22],"with":[23],"respect":[24],"to":[25,43],"initial":[27],"and":[28,46],"final":[29],"marking.":[30],"Sets":[31],"transition":[33],"sequences":[34],"described":[35],"by":[36,52],"finite":[37],"automata":[38],"are":[39],"used":[40],"approximations":[42],"firing":[44],"sequences,":[45],"approximation":[48,58],"error":[49],"assessed":[51],"uniformly":[53],"constructable":[54],"Presburger":[55],"expressions.":[56],"The":[57],"iterated":[61],"until":[62],"sufficient":[64],"criterion":[65],"can":[68],"be":[69],"given,":[70],"not-withstanding":[71],"remaining":[73],"uncertainty.":[74]},"counts_by_year":[{"year":2026,"cited_by_count":16},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":12}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}