| Articolul precedent |
| Articolul urmator |
 |
 219 3 |
| Ultima descărcare din IBN: 2023-10-02 12:23 |
 SM ISO690:2012ALHAZOV, Artiom, FREUND, Rudolf, IVANOV, Sergiu. P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks. In: Electronic Proceedings in Theoretical Computer Science: EPTCS, 26-27 august 2022, Debrecen. The Hague, Netherlands: Open Publishing Association, 2022, Ediţia a 12-a, pp. 28-48. ISSN 20752180. DOI: https://doi.org/10.4204/EPTCS.367.3 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Electronic Proceedings in Theoretical Computer Science Ediţia a 12-a, 2022 |
||||||
|
Masa rotundă "12th International Workshop on Non-Classical Models of Automata and Applications" Debrecen, Ungaria, 26-27 august 2022 | ||||||
|
||||||
| DOI:https://doi.org/10.4204/EPTCS.367.3 | ||||||
| Pag. 28-48 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Membrane computing and P systems are a paradigm of massively parallel natural computing introduced by Gheorghe Pǎun in 1999, inspired by the structure of the living cell and by its biochemical reactions. In spite of this explicit biological motivation, P systems have not been extensively used in modelling real-world systems. To confirm this intuition, we establish a state of the art investigation comparing the use of P systems to that of Boolean networks in this line of research. We then propose to use P systems as a tool for setting up formal frameworks to reason about other formalisms, and we introduce Boolean P systems, specifically tailored for capturing sequential controllability of Boolean networks. We show how to tackle some technical challenges and prove that sequential controllability properly embeds in the framework of Boolean P systems. |
||||||
| Cuvinte-cheie Boolean networks, controllability, formal framework |
||||||
|
|
|
|
