{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:19Z","timestamp":1760202619574},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,1]]},"abstract":"<jats:p> We consider transition P systems as originally defined in the seminal paper of Gh. P\u0103un, where he introduced the field of membrane computing. We show that it is decidable to determine, given a P system \u03a0, whether it is strongly reversible (i.e., every configuration has at most one direct predecessor), resolving in the affirmative a recent open problem in the field. We also show that the set of all direct predecessors of a given configuration in a P system is an effectively computable semilinear set, which can effectively be expressed as a Presburger formula, strengthening an early result in the literature. We also prove other related results. <\/jats:p>","DOI":"10.1142\/s0129054111007782","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T05:43:19Z","timestamp":1295588599000},"page":"7-14","source":"Crossref","is-referenced-by-count":9,"title":["ON STRONG REVERSIBILITY IN <font>P<\/font> SYSTEMS AND RELATED PROBLEMS"],"prefix":"10.1142","volume":"22","author":[{"given":"OSCAR H.","family":"IBARRA","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of California, Santa Barbara, CA 93106, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322058"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1624"},{"key":"rf6","first-page":"529","volume":"74","author":"Leporati A.","journal-title":"Fundam., Inform."},{"key":"rf7","first-page":"437","author":"Minsky M.","journal-title":"Ann. of Math."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111007782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:53:42Z","timestamp":1565124822000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111007782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":4,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,1]]}},"alternative-id":["10.1142\/S0129054111007782"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111007782","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}