Related Experiment Video
Updated: Sep 20, 2026

Interactive and Visualized Online Experimentation System for Engineering Education and Research
Published on: November 24, 2021
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
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.
Related Concept Videos
Multimachine Stability
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
Multi-input and Multi-variable systems
In the absence of...
Signal and System
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Simplified Synchronous Machine Model
In this model, each generator is connected to a...
Machines: Problem Solving II