A formalization of transition P systems

Abstract:

In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: transition P systems as they were given in [3], addressed with completely different techniques than in [1] and [2]. For this, we present a formal syntax and semantic of the transition P systems capturing the synchronized work of P systems, and the nondeterministic and maximally parallel manner in which the rules of these systems can be applied.

Año de publicación:

2002

Keywords:

• Formal verification
• P system
• Natural Computing

Fuente:

scopus