P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg
Machines)
Authors: J. Aguado, T. Balanescu, A. J. Cowling, M. Gheorghe, M.
Holcombe and F. Ipate.
Published in Fundamenta Informaticae, Volume 49.1-3
(2002),
pages 17 - 33.
Abstract
The aim of this paper is to show how the P systems with replicated
rewriting
can be modelled by X-machines (also called Eilenberg machines).
In
the first approach, the parallel behaviour of the regions of a P system
is simulated by a sequential process involving a single
X-machine.
This allows the application of the X-machine testing procedures in
order
to prove the correctness of P systems. In the second approach, a
P system is simulated by a communicating system of X-machines.
Each
component of such a system is an X-machine associated with a region of
the given P system. The components act in parallel, as their
counterparts
do in a P system, and use some specific mechanism for communication and
synchronisation.
Full Text
The journal has a website,
but the contents of individual issues are then buried within a dynamic
site, and it is not clear whether individual papers have fixed
URLs. You can get to this paper from the journal page by clicking
on the button labelled "Contents", and then finding this
particular issue in the list, and navigating to the page for
it, which has a link for each paper. To access the contents this
way, though, you will have to pay for them!
Alternatively, if you have access to a library that has a
subscription
to the journal, they will probably have their own links for accessing
it.
Return to the CSXMS papers page.
Go to the main CSXMS page.
This page created by A.
J.
Cowling, and last updated on 27 September 2006