7 research outputs found
Testing Identifiable Kernel P Systems Using an X-machine Approach
This paper presents a testing approach for kernel P systems (kP systems),
based on the X-machine testing framework and the concept of cover automaton. The
testing methodology ensures that the implementation conforms the speci cations, under
certain conditions, such as the identi ably concept in the context of kernel P systems
Spiking neural P systems: matrix representation and formal verification
YesStructural and behavioural properties of models are very important in development of complex systems and applications. In this paper, we investigate such properties for some classes of SN P systems. First, a class of SN P systems associated to a set of routing problems are investigated through their matrix representation. This allows to make certain connections amongst some of these problems. Secondly, the behavioural properties of these SN P systems are formally verified through a natural and direct mapping of these models into kP systems which are equipped with adequate formal verification methods and tools. Some examples are used to prove the effectiveness of the verification approach.EPSRC research grant EP/R043787/1; DOST-ERDT research grants; Semirara Mining Corp; UPD-OVCRD
An Analysis of Correlative and Static Causality in P Systems
In this paper we present two approaches, namely correlative and static causality, to study cause-effect relationships in reaction models and we propose
a framework which integrates them in order to study causality by means of transition P systems. The proposed framework is based on the fact that statistical analysis can be used to building up a membrane model which can be used to analyze causality relationships in terms of multisets of objects and rules in presence of non-determinism and parallelism.We prove that the P system which is defined by means of correlation analysis provides a correspondence between the static and correlative notions of causality
Reversing steps in membrane systems computations
The issue of reversibility in computational paradigms has gained interest in recent years. In this paper we investigate how to reverse steps in membrane systems computations. The problem is that computation steps in membrane systems do not preserve all the information that has to be used when reversing them. We try to formalize the relevant information needed, and we show that the proposed approach enjoy the so called loop lemma, which basically assures that the undoing obtained by reversely applying rules is correct
Foundations of reversible computation
Reversible computation allows computation to proceed not only in the standard, forward direction, but also backward, recovering past states. While reversible computation has attracted interest for its multiple applications, covering areas as different as low-power computing, simulation, robotics and debugging, such applications need to be supported by a clear understanding of the foundations of reversible computation. We report below on many threads of research in the area of foundations of reversible computing, giving particular emphasis to the results obtained in the framework of the European COST Action IC1405, entitled “Reversible Computation - Extending Horizons of Computing”, which took place in the years 2015–2019