Related Experiment Videos
Simulation and verification of P systems through communicating X-machines
P Kefalas1, G Eleftherakis, M Holcombe
1Department of Computer Science, CITY College, 13 Tsimiski Street, Thessaloniki 546 24, Greece. kefalas@city.academic.gr
Bio Systems
|August 14, 2003
Summary
This study demonstrates how communicating X-machines can effectively simulate P systems, a model for molecular computation. This approach also aids in verifying the formal properties of these systems.
Area of Science:
- Theoretical Computer Science
- Computational Biology
- Formal Methods
Background:
- P systems are a well-established model for molecular computation.
- Formal verification of computational models is crucial for understanding their properties.
- Communicating X-machines offer a parallel distributed computational framework.
Purpose of the Study:
- To establish the suitability of communicating X-machines for simulating P systems.
- To introduce benefits of this simulation for formal property checking.
- To present a method for transforming P systems into communicating X-machine models.
Main Methods:
- Development of a transformation framework from P systems to communicating X-machine models.
- Adaptation of temporal logic for X-machine model checking.
- Analysis of the benefits derived from the transformation process.
Main Results:
- Demonstrated the natural simulation capability of communicating X-machines for P systems.
- Presented a concrete set of rules for P system to X-machine transformation.
- Introduced a temporal logic variation for enhanced property verification.
Conclusions:
- Communicating X-machines provide a suitable and beneficial model for simulating P systems.
- The proposed transformation facilitates the formal verification of molecular computation models.
- This work bridges theoretical computer science and molecular computation through formal methods.