{"id":"https://openalex.org/W2018409411","doi":"https://doi.org/10.1016/s0304-3975(97)00235-1","title":"Reachability in live and safe free-choice Petri nets is NP-complete","display_name":"Reachability in live and safe free-choice Petri nets is NP-complete","publication_year":1998,"publication_date":"1998-05-01","ids":{"openalex":"https://openalex.org/W2018409411","doi":"https://doi.org/10.1016/s0304-3975(97)00235-1","mag":"2018409411"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(97)00235-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00235-1","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5090378914","display_name":"Javier Esparza","orcid":"https://orcid.org/0000-0001-9862-4919"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Javier Esparza","raw_affiliation_strings":["Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Arcisstr. 21, D-80290 M\u00fcnchen, Germany","Technische Univ. M\u00fcnchen, Munich, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Arcisstr. 21, D-80290 M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Technische Univ. M\u00fcnchen, Munich, Germany#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090378914"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.5084,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.64599461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"198","issue":"1-2","first_page":"211","last_page":"224"},"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.9998999834060669,"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.9998999834060669,"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":0.9965000152587891,"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/T10927","display_name":"Access Control and Trust","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9287993907928467},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.8982958793640137},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.7269847393035889},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.5913918614387512},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.49993300437927246},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4972591698169708},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47515222430229187},{"id":"https://openalex.org/keywords/process-architecture","display_name":"Process architecture","score":0.46144571900367737},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4566574990749359},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4347338378429413},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42168742418289185},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41407376527786255},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3861755430698395},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.337624192237854},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22314801812171936}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9287993907928467},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8982958793640137},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.7269847393035889},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5913918614387512},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.49993300437927246},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4972591698169708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47515222430229187},{"id":"https://openalex.org/C136155141","wikidata":"https://www.wikidata.org/wiki/Q7247260","display_name":"Process architecture","level":3,"score":0.46144571900367737},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4566574990749359},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4347338378429413},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42168742418289185},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41407376527786255},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3861755430698395},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.337624192237854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22314801812171936}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0304-3975(97)00235-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00235-1","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.5813","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-stuttgart.de/fmi/szs/publications/esparza/FC-reach.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.9380","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.9380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.leo.org/pub/comp/doc/techreports/tum/informatik/report/1996/TUM-I9621.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W143456117","https://openalex.org/W1551214605","https://openalex.org/W1601437325","https://openalex.org/W1996297578","https://openalex.org/W2002089154","https://openalex.org/W2011039300","https://openalex.org/W2068247526","https://openalex.org/W2071268441","https://openalex.org/W2914259485","https://openalex.org/W4302339081","https://openalex.org/W6632945319","https://openalex.org/W6635905098","https://openalex.org/W6667550989"],"related_works":["https://openalex.org/W2148229336","https://openalex.org/W2141183298","https://openalex.org/W2341552178","https://openalex.org/W2890208214","https://openalex.org/W2084570980","https://openalex.org/W2016151994","https://openalex.org/W2993657370","https://openalex.org/W3095813970","https://openalex.org/W2018409411","https://openalex.org/W2375360938"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}