{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:12:07Z","timestamp":1648905127314},"reference-count":46,"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":[[2006,2]]},"abstract":"<jats:p> We discuss aspects of biological relevance to the modelling of bio-computation in a multiset rewriting system context: turnover, robustness against perturbations, and the dataflow programming paradigm. The systems under consideration are maximally parallel and asynchronous parallel membrane systems, the latter corresponding to computation in which the notion of time is operationally meaningless. <\/jats:p><jats:p> A natural geometrical setting which seems promising for the study of computational processes in general multiset rewriting systems is presented. Configuration space corresponds to a subset of the lattice [Formula: see text], d \u2208 N, and state transitions correspond to vector addition. The similarities and differences with Vector Addition Systems and Petri nets are discussed. Symbolic dynamics are introduced on special partitions of configuration space and we indicate different notions of complexity for membrane systems based on this and related concepts such as graph complexity and minimal automata. Some examples of synchronized, pipelined dataflow computations are given and decompositions into functional subunits are briefly commented on. <\/jats:p>","DOI":"10.1142\/s0129054106003747","type":"journal-article","created":{"date-parts":[[2006,2,9]],"date-time":"2006-02-09T05:25:16Z","timestamp":1139462716000},"page":"147-165","source":"Crossref","is-referenced-by-count":1,"title":["COMPLEXITY OF BIO-COMPUTATION: SYMBOLIC DYNAMICS IN MEMBRANE SYSTEMS"],"prefix":"10.1142","volume":"17","author":[{"given":"MICHAEL","family":"MUSKULUS","sequence":"first","affiliation":[{"name":"Mathematical Institute, Leiden University, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands"}]},{"given":"ROBERT","family":"BRIJDER","sequence":"additional","affiliation":[{"name":"Leiden Institute of Advanced Computer Science, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","volume-title":"Algebraic Theory of Machines, Languages, and Semigroups","author":"Arbib M. A.","year":"1969"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0006-3495(94)80516-8"},{"key":"rf4","first-page":"369","volume":"8","author":"Arroyo F.","journal-title":"J. Universal Computer Sci."},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1145\/151233.151242"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1038\/nrg1272"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07675-0_10"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511524585"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-002-0090-7"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0096-3003(88)90090-2"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.63.105"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(94)90273-9"},{"key":"rf14","first-page":"1423","volume":"4","author":"Deckard A.","journal-title":"ChemBioChem"},{"key":"rf15","volume-title":"Handbook of Theoretical Computer Science","author":"Dershowitz N.","year":"1990"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1162\/106454601753238636"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68220-9"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1007\/BF00375614"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(99)00086-6"},{"key":"rf21","first-page":"1","volume":"56","author":"Fontana W.","journal-title":"Bull. Math. Biol."},{"key":"rf22","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1162\/artl.1993.1.1_2.211","volume":"1","author":"Fontana W.","journal-title":"Artificial Life"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1038\/35011540"},{"key":"rf26","first-page":"378","volume":"312","author":"Ibarra O. H.","journal-title":"Theor. Comp. Sci."},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1145\/1013208.1013209"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2003.11.002"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1038\/nrg1471"},{"key":"rf30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-17906-2_35"},{"key":"rf32","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0188316-1"},{"key":"rf33","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-5193(03)00034-1"},{"key":"rf34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"rf35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626302"},{"key":"rf36","first-page":"561","volume":"7","author":"Mart\u00edn-Vide C.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf37","first-page":"134","volume":"9","author":"Mart\u00edn-Vide C.","journal-title":"Computer Science Journal of Moldova"},{"key":"rf38","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010016313373"},{"key":"rf39","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"rf40","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020971802526"},{"key":"rf41","first-page":"451","volume":"77","author":"Murata T.","journal-title":"Proc. Inst. Electr. Eng."},{"key":"rf43","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037362"},{"key":"rf44","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1693"},{"key":"rf45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2"},{"key":"rf46","volume-title":"Petri Nets Theory and the Modeling of Systems","author":"Petersen J. L.","year":"1981"},{"key":"rf47","doi-asserted-by":"publisher","DOI":"10.1007\/BF02478302"},{"key":"rf48","volume-title":"Formal Languages","author":"Salomaa A.","year":"1973"},{"key":"rf49","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010388907793"},{"key":"rf50","doi-asserted-by":"publisher","DOI":"10.1038\/nature03248"},{"key":"rf51","unstructured":"A.\u00a0Syropoulos, Multiset processing. Mathematical, Computer Science, Molecular Computing Points of View, LNCS 2235, eds. C. S.\u00a0Calude (Springer-Verlag, Berlin, 2001)\u00a0pp. 347\u2013358."},{"key":"rf52","doi-asserted-by":"publisher","DOI":"10.1145\/27633.28055"},{"key":"rf53","doi-asserted-by":"publisher","DOI":"10.1007\/s10559-005-0012-0"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106003747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:41:09Z","timestamp":1565124069000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106003747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":46,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1142\/S0129054106003747"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106003747","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}