Simulation and verification of P systems through communicating X-machines

P. Kefalas, G. Eleftherakis, M. Holcombe, M. Gheorghe

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)135-148
Number of pages14
JournalBioSystems
Volume70
Issue number2
DOIs
StatePublished - Jul 2003

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Modeling and Simulation
  • General Biochemistry, Genetics and Molecular Biology
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Simulation and verification of P systems through communicating X-machines'. Together they form a unique fingerprint.

Cite this