{"id":"https://openalex.org/W2009533696","doi":"https://doi.org/10.1093/imamci/dnu025","title":"Enumeration of reachable (forbidden, live and deadlock) states ofkth order system of Petri nets","display_name":"Enumeration of reachable (forbidden, live and deadlock) states ofkth order system of Petri nets","publication_year":2014,"publication_date":"2014-07-13","ids":{"openalex":"https://openalex.org/W2009533696","doi":"https://doi.org/10.1093/imamci/dnu025","mag":"2009533696"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1093/imamci/dnu025","pdf_url":null,"source":{"id":"https://openalex.org/S162756791","display_name":"IMA Journal of Mathematical Control and Information","issn_l":"0265-0754","issn":["0265-0754","1471-6887"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311647","https://openalex.org/P4310311648"],"host_organization_lineage_names":["University of Oxford","Oxford University Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5111529913","display_name":"Daniel Yuh Chao","orcid":null},"institutions":[],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Daniel Yuh Chao","raw_affiliation_strings":["Department of Management and Information Science, National Cheng Chi University, Taipei 116, Taiwan, ROC"],"affiliations":[{"raw_affiliation_string":"Department of Management and Information Science, National Cheng Chi University, Taipei 116, Taiwan, ROC","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5111529913"],"corresponding_institution_ids":[],"apc_list":{"value":2582,"currency":"GBP","value_usd":3167,"provenance":"doaj"},"apc_paid":null,"fwci":2.561,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":11,"citation_normalized_percentile":{"value":0.748456,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":87},"biblio":{"volume":null,"issue":null,"first_page":"dnu025","last_page":"dnu025"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9997,"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.9997,"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/T10703","display_name":"Business Process Modeling and Analysis","score":0.9927,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9842,"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/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.690102},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.4453604}],"concepts":[{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8127042},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.78466725},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.690102},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.66873574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.55127954},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.4453604},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4430184},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4105841},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.380475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36866426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32260478},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.29552945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28405517},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14122546},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1093/imamci/dnu025","pdf_url":null,"source":{"id":"https://openalex.org/S162756791","display_name":"IMA Journal of Mathematical Control and Information","issn_l":"0265-0754","issn":["0265-0754","1471-6887"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311647","https://openalex.org/P4310311648"],"host_organization_lineage_names":["University of Oxford","Oxford University Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2753608416","https://openalex.org/W2385269475","https://openalex.org/W2143286588","https://openalex.org/W2036031969","https://openalex.org/W2009533696","https://openalex.org/W1980233554","https://openalex.org/W1965237160","https://openalex.org/W1963976917","https://openalex.org/W1613784134","https://openalex.org/W1545804765"],"abstract_inverted_index":{"So":[0],"far,":[1],"none":[2],"(except":[3],"the":[4,7,13,20,23,46],"authors)":[5],"in":[6],"literature":[8],"proposes":[9],"closed-form":[10,65],"solutions":[11],"of":[12,15,26,38,74],"number":[14,37],"reachable":[16,55],"states":[17,60],"for":[18,71],"even":[19,86],"marked":[21],"graphs,":[22],"simplest":[24],"subclass":[25,73],"Petri":[27],"nets,":[28],"not":[29],"to":[30,49,100,110],"mention":[31],"infinite":[32,88,91],"systems":[33],"(i.e.":[34],"very":[35],"large":[36,111],"resources":[39,92],"and":[40,58,64],"process":[41],"steps).":[42],"This":[43],"paper":[44],"is":[45,117],"first":[47],"one":[48],"tackle":[50],"such":[51],"issues":[52],"by":[53],"estimating":[54],"(forbidden,":[56],"live":[57],"deadlock)":[59],"with":[61,76,85,90],"a":[62,72,80],"non-recursion":[63],"formula":[66],"(depending":[67],"on":[68],"parameter":[69],"k)":[70],"nets":[75],"k":[77],"resources.":[78],"As":[79],"result,":[81],"we":[82],"can":[83,95],"deal":[84],"an":[87],"system":[89],"which":[93],"nobody":[94],"ever":[96],"do":[97],"it.":[98],"Extension":[99],"more":[101],"than":[102],"two":[103],"processes":[104],"has":[105],"been":[106],"briefly":[107],"presented.":[108],"Application":[109],"Gadara":[112],"RAS":[113],"(resource":[114],"allocation":[115],"system)":[116],"also":[118],"mentioned.":[119]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2009533696","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2025-01-21T20:53:56.703204","created_date":"2016-06-24"}