{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:17:31Z","timestamp":1649035051867},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p> Semilinearity plays a key role not only in formal languages but also in the study of Petri nets. Although the reachability set of a Petri net may not be semilinear in general, there are a wide variety of subclasses of Petri nets which enjoy having semilinear reachability sets. In this paper, we develop sufficient conditions for Petri nets under which semilinearity is guaranteed. Our approach, based on the idea of path decomposition, can be used for consolidating several existing semilinearity results as well as for deriving new results all under the same framework. <\/jats:p>","DOI":"10.1142\/s0129054109006759","type":"journal-article","created":{"date-parts":[[2009,7,29]],"date-time":"2009-07-29T11:44:22Z","timestamp":1248867862000},"page":"581-596","source":"Crossref","is-referenced-by-count":3,"title":["PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS"],"prefix":"10.1142","volume":"20","author":[{"given":"HSU-CHUN","family":"YEN","sequence":"first","affiliation":[{"name":"Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan, R.O.C."},{"name":"Dept. of Computer Science, Kainan University, Taoyuan, Taiwan, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90059-7"},{"key":"rf4","volume-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg S.","year":"1966"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90026-5"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90329-E"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90041-0"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90046-Y"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322058"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322079"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289268"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90036-1"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90117-4"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90038-0"},{"key":"rf22","unstructured":"H.\u00a0Yen, Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence 25, eds. Z.\u00a0Esik, C.\u00a0Martin-Vide and V.\u00a0Mitrana (Springer, 2006)\u00a0pp. 343\u2013373."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054109006759","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T04:38:51Z","timestamp":1565152731000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054109006759"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":13,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.1142\/S0129054109006759"],"URL":"https:\/\/doi.org\/10.1142\/s0129054109006759","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}