Scenario Based P Systems

摘要

In this paper we introduce and study Scenario Based P Systems in order to model computation inspired by metabolic pathways and networks. Starting from the classical definition of P systems with symbol objects and multiset rewriting rules, we use regular expressions able to capture the causal dependencies among different executions of the rules. For SBP systems we define the synchronisation degree and based on it and on the types of the rules that are used we study their computational capabilities.