{"id":"https://openalex.org/W2314356162","doi":"https://doi.org/10.3233/fi-2016-1318","title":"Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities","display_name":"Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities","publication_year":2016,"publication_date":"2016-03-04","ids":{"openalex":"https://openalex.org/W2314356162","doi":"https://doi.org/10.3233/fi-2016-1318","mag":"2314356162"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2016-1318","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1318","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/A5109876781","display_name":"Ernst Mayr","orcid":null},"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":"Ernst W. Mayr","raw_affiliation_strings":["Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Garching, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065895400","display_name":"Jeremias Weihmann","orcid":null},"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":false,"raw_author_name":"Jeremias Weihmann","raw_affiliation_strings":["Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Garching, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109876781"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.3261,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64766282,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"143","issue":"3-4","first_page":"355","last_page":"391"},"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.9983000159263611,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.996399998664856,"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/pspace","display_name":"PSPACE","score":0.8066767454147339},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.789110541343689},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7298462986946106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6049551367759705},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.5307331681251526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5186766386032104},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4383193254470825},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4341791868209839},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.4339746832847595},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4300912618637085},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27623021602630615},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2420574128627777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19997039437294006},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.16638949513435364}],"concepts":[{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.8066767454147339},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.789110541343689},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7298462986946106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6049551367759705},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.5307331681251526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5186766386032104},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4383193254470825},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4341791868209839},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.4339746832847595},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4300912618637085},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27623021602630615},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2420574128627777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19997039437294006},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.16638949513435364},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2016-1318","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1318","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":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W103976318","https://openalex.org/W176758562","https://openalex.org/W194455684","https://openalex.org/W1524248088","https://openalex.org/W1531231269","https://openalex.org/W1580879785","https://openalex.org/W1589381382","https://openalex.org/W1598641851","https://openalex.org/W1887498819","https://openalex.org/W2011495892","https://openalex.org/W2013504313","https://openalex.org/W2021009590","https://openalex.org/W2023196288","https://openalex.org/W2086631659","https://openalex.org/W2087907688","https://openalex.org/W2119733884"],"related_works":["https://openalex.org/W2154794415","https://openalex.org/W2107824370","https://openalex.org/W4312626387","https://openalex.org/W1500907979","https://openalex.org/W1651168384","https://openalex.org/W2039577724","https://openalex.org/W2103504376","https://openalex.org/W2380814829","https://openalex.org/W1551903405","https://openalex.org/W2341675553"],"abstract_inverted_index":{"We":[0,29],"investigate":[1],"gcf-Petri":[2],"nets,":[3],"a":[4,61,105],"generalization":[5],"of":[6,50,63,84,96,117],"communication-free":[7],"Petri":[8],"nets":[9],"allowing":[10],"arbitrary":[11],"arc":[12],"multiplicities,":[13],"and":[14,47,114],"characterized":[15],"by":[16,59],"the":[17,42,93,112],"sole":[18],"restriction":[19],"that":[20,41],"each":[21],"transition":[22],"has":[23],"at":[24,70],"most":[25,71],"one":[26,72],"incoming":[27],"arc.":[28],"use":[30],"canonical":[31],"firing":[32],"sequences":[33],"with":[34],"nice":[35],"properties":[36],"for":[37,79,92,111],"gcf-PNs":[38,51,64],"to":[39],"show":[40,100],"Re":[43],"cLFS,":[44],"(zero-)reachability,":[45],"covering,":[46],"boundedness":[48],"problems":[49,81,116],"are":[52],"in":[53,82],"PSPACE.":[54],"By":[55],"simulating":[56],"PSPACE-Turing":[57],"machines":[58],"gss-PNs,":[60],"subclass":[62],"where":[65],"additionally":[66],"all":[67],"transitions":[68],"have":[69],"outgoing":[73],"arc,":[74],"we":[75,89,99],"ultimately":[76],"obtain":[77],"PSPACE-completess":[78],"these":[80],"case":[83],"gss-PNs":[85,118],"or":[86,119],"gcf-PNs.":[87,97,120],"Additionally,":[88],"prove":[90],"PSPACE-completeness":[91],"liveness":[94],"problem":[95],"Last,":[98],"PSPACE-hardness":[101],"as":[102,104],"well":[103],"doubly":[106],"exponential":[107],"space":[108],"upper":[109],"bound":[110],"containment":[113],"equivalence":[115]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}