Abstract | ||
---|---|---|
The aim of this paper is to show how the P systems with replicated rewriting can be modeled 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. |
Year | Venue | Keywords |
---|---|---|
2002 | Fundam. Inform. | stream x-machines,parallel behaviour,eilenberg machines,p system,eilenberg machine,p systems,x-machine testing procedure,replicated rewriting,specific mechanism,stream x-machines eilenberg machines,single x-machine,sequential process,communication system,formal specification,finite state machine,formal specifications,finite state machines |
Field | DocType | Volume |
Synchronization,Programming language,Computer science,Correctness,Formal specification,Theoretical computer science,Finite-state machine,Rewriting,P system | Journal | 49 |
Issue | ISSN | Citations |
1 | 0169-2968 | 13 |
PageRank | References | Authors |
0.75 | 7 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Joaquin Aguado | 1 | 41 | 4.65 |
Tudor Balanescu | 2 | 78 | 8.02 |
Tony Cowling | 3 | 64 | 5.41 |
Marian Gheorghe | 4 | 893 | 74.31 |
Mike Holcombe | 5 | 510 | 54.25 |
Florentin Ipate | 6 | 419 | 43.20 |