{"id":"https://openalex.org/W2073633429","doi":"https://doi.org/10.1109/tac.2014.2322991","title":"On the Complexity of Some State-Counting Problems for Bounded Petri Nets","display_name":"On the Complexity of Some State-Counting Problems for Bounded Petri Nets","publication_year":2014,"publication_date":"2014-05-09","ids":{"openalex":"https://openalex.org/W2073633429","doi":"https://doi.org/10.1109/tac.2014.2322991","mag":"2073633429"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2014.2322991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2014.2322991","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/A5008675858","display_name":"Spyros Reveliotis","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Spyros Reveliotis","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008675858"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.3574,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64090503,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"60","issue":"1","first_page":"205","last_page":"210"},"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":0.9994000196456909,"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.9944999814033508,"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/reachability","display_name":"Reachability","score":0.8645726442337036},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.7816299200057983},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.710098922252655},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6921790838241577},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.6024031043052673},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5501022934913635},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5031959414482117},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4139825999736786},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4113956093788147},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3571820855140686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.346233606338501},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.21058502793312073}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8645726442337036},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7816299200057983},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.710098922252655},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6921790838241577},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6024031043052673},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5501022934913635},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5031959414482117},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4139825999736786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4113956093788147},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3571820855140686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.346233606338501},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.21058502793312073},{"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.1109/tac.2014.2322991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2014.2322991","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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":15,"referenced_works":["https://openalex.org/W1567452221","https://openalex.org/W1996109622","https://openalex.org/W2004401545","https://openalex.org/W2006912660","https://openalex.org/W2032789786","https://openalex.org/W2115826669","https://openalex.org/W2119361484","https://openalex.org/W2161407006","https://openalex.org/W2164002382","https://openalex.org/W2170657991","https://openalex.org/W2509841691","https://openalex.org/W3141776272","https://openalex.org/W4241441762","https://openalex.org/W4285719527","https://openalex.org/W6651575874"],"related_works":["https://openalex.org/W2154794415","https://openalex.org/W2107824370","https://openalex.org/W1500907979","https://openalex.org/W1551903405","https://openalex.org/W2039577724","https://openalex.org/W2380814829","https://openalex.org/W2499946963","https://openalex.org/W2387511021","https://openalex.org/W1531156418","https://openalex.org/W2095048141"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"an":[2],"emerging":[3],"need":[4],"for":[5,17,52,71,96],"pertinent":[6],"sizing":[7],"and":[8,21],"indexing":[9],"of":[10,23,27,37,41,55,67,75,82],"various":[11,42],"data":[12],"structures":[13],"that":[14,45,99],"are":[15],"used":[16],"the":[18,24,35,38,53,65,68,72,80,102,105],"efficient":[19],"storage":[20],"processing":[22],"reachability":[25],"graph":[26],"certain":[28],"bounded":[29],"PN":[30,103],"subclasses,":[31],"this":[32,85],"work":[33],"investigates":[34],"complexity":[36],"cardinality":[39],"assessment":[40],"marking":[43,77],"sets":[44],"have":[46],"been":[47],"proposed":[48],"as":[49],"reasonable":[50],"(over-)approximations":[51],"set":[54],"reachable":[56],"markings.":[57],"Along":[58],"these":[59,76],"lines,":[60],"our":[61,83],"main":[62],"results":[63,95],"establish":[64],"#P-hardness":[66,94],"aforementioned":[69],"estimation":[70],"most":[73],"prominent":[74],"sets.":[78],"To":[79],"best":[81],"knowledge,":[84],"is":[86],"also":[87],"a":[88],"first":[89],"attempt":[90],"to":[91],"provide":[92],"formal":[93],"counting":[97],"problems":[98],"arise":[100],"in":[101],"(and":[104],"broader":[106],"DES)":[107],"modeling":[108],"framework.":[109]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}