Specialized Predictor for Reaction Systems with Context Properties

• Autorzy: Barbuti R. , Gori R. , Levi F. , Milazzo P.

Identyfikatory

DOI

10.3233/FI-2016-1403

• Konferencja: International Workshop on CONCURRENCY, SPECIFICATION, and PROGRAMMING (CS&P 2015), (24; 28-30.09.2015, Rzeszów, Poland).
• Języki publikacji: EN

Abstrakty

EN

Reaction systems are a qualitative formalism for modeling systems of biochemical reactions characterized by the non-permanency of the elements: molecules disappear if not produced by any enabled reaction. Reaction systems execute in an environment that provides new molecules at each step. Brijder, Ehrenfeucht and Rozemberg introduced the idea of predictors. A predictor of a molecule s, for a given n, is the set of molecules to be observed in the environment to determine whether s is produced or not at step n by the system. We introduced the notion of formula based predictor, that is a propositional logic formula that precisely characterizes environments that lead to the production of s after n steps. In this paper we revise the notion of formula based predictor by defining a specialized version that assumes the environment to provide molecules according to what expressed by a temporal logic formula. As an application, we use specialized formula based predictors to give theoretical grounds to previously obtained results on a model of gene regulation.

Słowa kluczowe

EN

chemical reactions; proposition; set theory; genetic regulation; modality

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2016
• Tom: Vol. 147, nr 2/3
• Strony: 173--191
• Opis fizyczny: Bibliogr. 23 poz.

Twórcy

autor

Barbuti R.

• Dipartimento di Informatica, Università di Pisa, Italy

autor

Gori R.

• Dipartimento di Informatica, Università di Pisa, Italy

autor

Levi F.

• Dipartimento di Informatica, Università di Pisa, Italy

autor

Milazzo P.

• Dipartimento di Informatica, Università di Pisa, Italy

Bibliografia

• [1] Kari L, Rozenberg G. The many facets of natural computing. Communications of the ACM. 2008; 51(10):72–83. Available from: http://doi.acm.org/10.1145/1400181.1400200, doi:10.1145/1400181.1400200.
• [2] De Castro LN. Fundamentals of natural computing: basic concepts, algorithms, and applications. CRC Press; 2006. ISBN- 13:978-1584886433, 10:1584886439.
• [3] Ehrenfeucht A, Rozenberg G. Reaction systems. Fundam Inform. 2007;75(1-4):263–280. Available from: http://dx.doi.org/10.1016/j.dam.2006.04.041, doi:10.1016/j.dam.2006.04.041.
• [4] Brijder R, Ehrenfeucht A, Main MG, Rozenberg G. A tour of reaction Systems. Int J Found Comput Sci. 2011;22(7):1499–1517. Available from: http://dx.doi.org/10.1142/S0129054111008842, doi:10.1142/S0129054111008842.
• [5] Ehrenfeucht A, Rozenberg G. Events and modules in reaction systems. Theor Comput Sci. 2007; 376(1-2):3–16. Available from: http://dx.doi.org/10.1016/j.tcs.2007.01.008, doi:10.1016/j.tcs.2007.01.008.
• [6] Brijder R, Ehrenfeucht A, Rozenberg G. A Note on causalities in reaction systems. ECEASST. 2010;30. Available from: http://journal.ub.tu-berlin.de/index.php/eceasst/article/view/429.
• [7] Ehrenfeucht A, Main MG, Rozenberg G. Functions Defined by Reaction Systems. Int J Found Comput Sci. 2011;22(1):167–178. Available from: http://dx.doi.org/10.1142/S0129054111007927, doi:10.1142/S0129054111007927.
• [8] Brijder R, Ehrenfeucht A, Rozenberg G. Representing reaction systems by trees. In: Computation, Physics and Beyond. vol. 7160 of LNCS; 2012. p. 330–342. Available from: http://dx.doi.org/10.1007/978-3-642-27654-5_26, doi:10.1007/978-3-642-27654-5_26.
• [9] Ehrenfeucht A, Main MG, Rozenberg G, Brown AT. Stability and chaos in reaction systems. Int J Found Comput Sci. 2012;23(5):1173–1184. Available from: http://dx.doi.org/10.1142/S0129054112500177, doi:10.1142/S0129054112500177.
• [10] Pardini G, Barbuti R, Maggiolo-Schettini A, Milazzo P, Tini S. Compositional semantics and behavioural equivalences for reaction systems with restriction. Theor Comput Sci. 2014;551:1–21. Available from: http://dx.doi.org/10.1016/j.tcs.2014.04.010, doi:10.1016/j.tcs.2014.04.010.
• [11] Pardini G, Barbuti R, Maggiolo-Schettini A, Milazzo P, Tini S. A Compositional Semantics of Reaction Systems with Restriction. The Nature of Computation. Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings. LNCS 7921. Springer Berlin Heidelberg; 2013. p. 330–339. Available from: http://dx.doi.org/10.1007/978-3-642-39053-1_39, doi:10.1007/978-3-642-39053-1_39.
• [12] Barbuti R, Gori R, Levi F, Milazzo P. Specialized Predictor for Reaction Systems with Context Properties, Proceedings of the 24th International Workshop on Concurrency, Specification and Programming, Rzeszow, Poland, September 28-30, 2015. p. 31–43. Available from: http://ceur-ws.org/Vol-1492/Paper_04.pdf.
• [13] Barbuti R, Gori R, Levi F, Milazzo P. Investigating Dynamic Causalities in Reaction Systems. Theor. Comput. Sci., 2016;623:114–145. Available from: http://dx.doi.org/10.1016/j.tcs.2015.11.041, doi:10.1016/j.tcs.2015.11.041.
• [14] Corolli L, Maj C, Marini F, Besozzi D, Mauri G. An excursion in reaction systems: From computer science to biology. Theor Comput Sci. 2012;454:95–108.
• [15] Hight SL. Minimal Input Solutions. IEEE Transactions on Computers. 1971;C-20(8):923–925. Available from: http://dx.doi.org/10.1109/T-C.1971.223372, doi:10.1109/T-C.1971.223372.
• [16] Halatsis C, Gaitanis N. Irredundant Normal Forms and Minimal Dependece Sets of a Boolean Function. IEEE Trans Computers. 1978;27(11):1064–1068. Available from: http://dx.doi.org/10.1109/TC.1978.1674997, doi:10.1109/TC.1978.1674997.
• [17] Dietmeyer DL. Logic Design of Digital Systems. Allyn and Bacon Inc., Boston; 1978. ISBN-0205059600.
• [18] Kambayashi Y. Logic Design of Programmable Logic Arrays. IEEE Trans Computers. 1979;28(9):609–617. Available from: http://dx.doi.org/10.1109/TC.1979.1675428, doi:10.1109/TC.1979.1675428.
• [19] Brown FM. Boolean reasoning - the logic of boolean equations. Kluwer; 1990. ISBN-13: 978-0486427850, 10: 0486427854.
• [20] Fujita M, Matsunaga Y. Multi-Level Logic Minimization Based on Minimal Support and its Application to the Minimization of Look-Up Table Type FPGAs. In: 1991 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1993, Santa Clara, CA, USA, November 11-14, 1991. Digest of Technical Papers; 1991. p. 560–563. ISBN: 0-8186-2157-5. doi:10.1109/ICCAD.1991.185332.
• [21] Konieczny P, Jóźwiak L. Minimal Input Support Problem and Algorithms to Solve It. Eindhoven University of Thechnology Reaserch Report. 1995;p. 1–55. Available from: https://pure.tue.nl/ws/files/1472651/9511330.pdf.
• [22] Hassoun S, Sasao T, editors. Logic Synthesis and Verification. Kluwer Academic Publishers; 2002. ISBN:978-1-4613-5253-2. doi:10.1007/978-1-4615-0817-5.
• [23] Meski A, Penczek W, Rozenberg G. Model checking temporal properties of reaction systems. Information Sciences. 2015;313:22–42. Available from: http://dx.doi.org/10.1016/j.ins.2015.03.048, doi:10.1016/j.ins.2015.03.048.

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).