{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:03:51Z","timestamp":1648811031353},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1994,12]]},"abstract":"<jats:p> We define a subclass of Petri nets called m\u2013state n\u2013cycle Petri nets, each of which can be thought of as a ring of n bounded (by m states) Petri nets using n potentially unbounded places as joins. Let Ring(n, l, m) be the class of m\u2013state n\u2013cycle Petri nets in which the largest integer mentioned can be represented in l bits (when the standard binary encoding scheme is used). As it turns out, both the reachability problem and the boundedness problem can be decided in O(n(l+log m)) nondeterministic space. Our results provide a slight improvement over previous results for the so-called cyclic communicating finite state machines. We also compare and contrast our results with that of VASS(n, l, s), which represents the class of n-dimensional s-state vector addition systems with states where the largest integer mentioned can be described in l bits. <\/jats:p>","DOI":"10.1142\/s0129054194000153","type":"journal-article","created":{"date-parts":[[2004,11,18]],"date-time":"2004-11-18T21:21:13Z","timestamp":1100812873000},"page":"281-292","source":"Crossref","is-referenced-by-count":0,"title":["SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS"],"prefix":"10.1142","volume":"05","author":[{"given":"HSU-CHUN","family":"YEN","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan 106, Republic of China"}]},{"given":"BOW-YAW","family":"WANG","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan 106, Republic of China"}]},{"given":"MING-SHANG","family":"YANG","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan 106, Republic of China"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054194000153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:44:09Z","timestamp":1565124249000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054194000153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":0,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1994,12]]}},"alternative-id":["10.1142\/S0129054194000153"],"URL":"https:\/\/doi.org\/10.1142\/s0129054194000153","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}