PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Studying Opacity of Reaction Systems through Formula Based Predictors

Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
Reaction systems are a qualitative formalism for modeling systems of biochemical reactions. They describe the evolution of sets of objects representing biochemical molecules. One of the main characteristics of Reaction systems is the non-permanency of the objects, namely objects disappear if not produced by any enabled reaction. Reaction systems execute in an environment that provides new objects at each step. Causality properties of reaction systems can be studied by using notions of formula based predictor. In this context, we define a notion of opacity that can be used to study information flow properties for reaction systems. Objects will be partitioned into high level (invisible) and low level (visible) ones. Opacity ensures that the presence (or absence) of high level objects cannot be guessed observing the low level objects only. Such a property is shown to be decidable and computable by exploiting the algorithms for minimal formula based predictors.
Słowa kluczowe
Wydawca
Rocznik
Strony
303--319
Opis fizyczny
Bibliogr. 20 poz.
Twórcy
autor
  • Dipartimento di Informatica, Università di Pisa, Italy
autor
  • Department of Applied Informatics, Comenius University in Bratislava, Slovak Republic
  • Dipartimento di Informatica, Università di Pisa, Italy
Bibliografia
  • [1] Ehrenfeucht A, Rozenberg G. Reaction Systems. Fundamenta Informaticae, 2007. 75(1-4):263-280. URL http://content.iospress.com/articles/fundamenta-informaticae/fi75-1-4-15.
  • [2] Brijder R, Ehrenfeucht A, Main MG, Rozenberg G. A Tour of reaction Systems. International Journal of Foundations of Computer Science, 2011. 22(7):1499-1517. URL https://doi.org/10.1142/S0129054111008842.
  • [3] Gori R, Levi F. Abstract interpretation based verification of temporal properties for BioAmbients. Information and Computation, 2010. 208(8):869-921. URL https://doi.org/10.1016/j.ic.2010.03.004.
  • [4] Bodei C, Gori R, Levi F. An Analysis for Causal Properties of Membrane Interactions. Electronic Notes in Theoretical Computer Science, 2013. 299:15-31. URL https://doi.org/10.1016/j.entcs.2013. 11.003.
  • [5] Bodei C, Gori R, Levi F. Causal static analysis for Brane Calculi. Theoretical Computer Science, 2015. 587:73-103. URL https://doi.org/10.1016/j.tcs.2015.03.014.
  • [6]Busi N. Towards a causal semantics for brane calculi. Proceedings of the Fifth Brainstorming Week on Membrane Computing, 97-111. Sevilla, ETS de Ingeniería Informática, 29 de Enero-2 de Febrero, 2007, 2007.
  • [7] Busi N. Causality in Membrane Systems. In: Membrane Computing, 8th International Workshop, WMC 2007, Thessaloniki, Greece, June 25-28, 2007 Revised Selected and Invited Papers. 2007 pp. 160-171. URL https://doi.org/10.1007/978-3-540-77312-2\_10.
  • [8] Barbuti R, Gori R, Milazzo P. Multiset Patterns and Their Application to Dynamic Causalities in Membrane Systems. In: Membrane Computing - 18th International Conference, CMC 2017, Bradford, UK, July 25-28, 2017, Revised Selected Papers. 2017 pp. 54-73. URL https://doi.org/10.1007/978-3-319-73359-3\_4.
  • [9] Brijder R, Ehrenfeucht A, Rozenberg G. A Note on Causalities in Reaction Systems. ECEASST, 2010.30. URL https://doi.org/10.14279/tuj.eceasst.30.429.
  • [10] Barbuti R, Gori R, Levi F, Milazzo P. Investigating dynamic causalities in reaction systems. Theoretical Computer Science, 2016. 623:114-145. URL https://doi.org/10.1016/j.tcs.2015.11.041.
  • [11] Barbuti R, Gori R, Levi F, Milazzo P. Specialized Predictor for Reaction Systems with Context Properties. In: Proceedings of the 24th International Workshop on Concurrency, Specification and Programming, Rzeszow, Poland, September 28-30, 2015. 2015 pp. 31-43. URL http://ceur-ws.org/Vol-1492/Paper\_04.pdf.
  • [12] Barbuti R, Gori R, Levi F, Milazzo P. Specialized Predictor for Reaction Systems with Context Properties. Fundamenta Informaticae, 2016. 147(2-3):173-191. URL https://doi.org/10.3233/FI-2016-1403.
  • [13] Goguen JA, Meseguer J. Security Policies and Security Models. Proc. of IEEE Symposium on Security and Privacy, 1982. URL https://doi.org/10.1109/SP.1982.10014.
  • [14] Bryans J, Koutny M, Ryan P. Modelling non-deducibility using Petri Nets. In: Proc. of the 2nd International Workshop on Security Issues with Petri Nets and other Computational Models. 2004.
  • [15] Bryans JW, Koutny M, Mazaré L, Ryan PY. Opacity generalised to transition systems. International Journal of Information Security, 2008. 7(6):421-435. URL https://doi.org/10.1007/s10207-008-0058-x.
  • [16] Gruska DP. Informational analysis of security and integrity. Fundamenta Informaticae, 2012. 120(3-4):295-309. URL https://doi.org/10.3233/FI-2012-763.
  • [17] Jacob R, Lesage J, Faure J. Overview of discrete event systems opacity: Models, validation, and quantification. Annual Reviews in Control, 2016. 41:135-146. URL https://doi.org/10.1016/j.arcontrol.2016.04.015.
  • [18] Tong Y, Li Z, Seatzu C, Giua A. Verification of State-Based Opacity Using Petri Nets. EEE Transactions on Automatic Control, 2017. 62(6):2823-2837. URL https://doi.org/10.1109/TAC.2016.2620429.
  • [19] Tong Y, Li Z, Seatzu C, Giua A. Current-state opacity enforcement in discrete event systems under incomparable observations. Discrete Event Dynamic Systems, 2018. 28(2):161-182. URL https://doi.org/10.1007/s10626-017-0264-7.
  • [20] Barbuti R, Gori R, Levi F, Milazzo P. Generalized contexts for reaction systems: definition and study of dynamic causalities. Acta Informatica, 2018. 55(3):227-267. URL https://doi.org/10.1007/s00236-017-0296-3.
Uwagi
Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-99291770-a0be-4045-958f-29a2080f5b54
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.