{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:14:53Z","timestamp":1761488093072},"reference-count":6,"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":[[2008,8]]},"abstract":"<jats:p> The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event system from reaching any forbidden state during the course of its computation. In this paper, we regard the forbidden state problem as a decision problem, and investigate the decidability\/complexity issue of the problem under two new types of control policies, namely, non-blocking and fair policies, for finite state systems and Petri nets. <\/jats:p>","DOI":"10.1142\/s0129054108006091","type":"journal-article","created":{"date-parts":[[2008,8,6]],"date-time":"2008-08-06T06:30:40Z","timestamp":1218004240000},"page":"999-1013","source":"Crossref","is-referenced-by-count":1,"title":["DECIDABILITY AND COMPLEXITY ANALYSIS OF FORBIDDEN STATE PROBLEMS FOR DISCRETE EVENT SYSTEMS"],"prefix":"10.1142","volume":"19","author":[{"given":"HSU-CHUN","family":"YEN","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan 106, R.O.C."},{"name":"Department of Computer Science, Kainan University, Taoyuan, Taiwan 338, R.O.C."}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0033544"},{"key":"rf2","first-page":"219","volume":"34","author":"Holloway L.","journal-title":"IEEE Trans. SMC-A"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90228-T"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90068-2"},{"key":"rf6","volume-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson J.","year":"1981"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/5.21072"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108006091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:24:08Z","timestamp":1565177048000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108006091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":6,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.1142\/S0129054108006091"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108006091","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}