A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pathway of Plasma Membrane – Glycoprotein

Abstract

Membrane computing is a branch of Natural computing aiming to abstract computing models from the structure and functioning of the living cell. A comprehensive introduction to membrane computing is meant to offer both computer scientists and non-computer scientists an up-to-date overview of the field. In this paper, we consider a uniform way of treating objects and rules in P Systems with the help of Multiset rewriting rules. Here the synthesis and secretory pathway of glycoprotein in epithelial cells of the small intestine are considered as an example. A natural and finite link is explored between Petri nets and membrane Computing. A Petri net (PN) algorithm combined with P Systems is implemented for the synthesis and secretory pathway of Glycoprotein. To capture the compartmentalization of P Systems, the Petri net is extended with localities and to show how to adopt the notion of a Petri net process accordingly. The algorithm uses symbolic representations of multisets of rules to efficiently generate all the regions associated with the membrane. In essence, this algorithm is built from transport routes sharing a set of places modeling the availability of system resources. The algorithm when simulated shows a significant pathway of safe Petri nets.