论文信息 - Maximally Parallel multiset-rewriting systems: Browsing the Configurations

Maximally Parallel multiset-rewriting systems: Browsing the Configurations

The aim of this research is to produce an algorithm for the software that would let a researcher to observe the evolution of maximally parallel multiset-rewriting systems with permitting and forbidding contexts, browsing the configuration space by following transitions like following hyperlinks in the World-Wide Web. The relationships of maximally parallel multiset-rewriting systems with other rewriting systems are investigated, such as Petri nets, different kinds of P systems, Lindenmayer systems, grammar systems, regulated grammars.

Artiom Alhazov

[1] Carlos Martín-Vide,et al. Membrane systems with promoters/inhibitors , 2002, Acta Informatica.

[2] Fernando Arroyo,et al. Towards an Electronic Implementation of Membrane Computing: A Formal Description of Non-deterministic Evolution in Transition P Systems , 2001, DNA.

[3] Artiom Alhazov,et al. Communicative P Systems with Minimal Cooperation , 2004, Workshop on Membrane Computing.

[4] Ioan I. Ardelean,et al. Modelling biological processes by using a probabilistic P system software , 2004, Natural Computing.

[5] Fernando Arroyo,et al. A Software Simulation of Transition P Systems in Haskell , 2002, WMC-CdeA.

[6] Nepomuceno Chamorro,et al. A Java Simulator for Basic Transition P Systems , 2004 .

[7] Gheorghe Paun,et al. Membrane Computing , 2002, Natural Computing Series.

[8] Rudolf Freund,et al. Implementation of Catalytic P Systems , 2004, CIAA.

[9] Mario J. Pérez-Jiménez,et al. A MzScheme Implementation of Transition P Systems , 2002, WMC-CdeA.