Simulation and verification of P systems through communicating X-machines.
The aim of this paper is to prove the suitability of a parallel distributed computational model, communicating X-machines, to simulate in a natural way a well established model of molecular computation, P systems, and to present some further benefits of the approach allowing us to check for some formal properties. A set of rules to transform any P system with symbol-objects into a communicating X-machine model is presented and a variation of temporal logic for X-machines is briefly discussed, which facilitates model checking of desired properties of the system. Finally, the benefits resulting from the transformation are discussed.
Kefalas
P
P
Department of Computer Science, CITY College, 13 Tsimiski Street, Thessaloniki 546 24, Greece. kefalas@city.academic.gr
Eleftherakis
G
G
Holcombe
M
M
Gheorghe
M
M
D000465:Algorithms; D002450:Cell Communication / Q000502:physiology*; D002462:Cell Membrane / Q000502:physiology*; D003198:Computer Simulation; D039301:Computers, Molecular; D003205:Computing Methodologies; D004777:Environment; D005110:Extracellular Space / Q000502:physiology*; D016247:Information Storage and Retrieval / Q000379:methods*; D017136:Ion Transport / Q000502:physiology; D008954:Models, Biological; D017711:Nonlinear Dynamics; D009626:Terminology as Topic