Buscar
Mostrando ítems 1-10 de 17
Tesis Doctoral
Especificación y verificación de programas moleculares en PVS
(2003-09-29)
La Computación Molecular y, en concreto, la Computación con ADN, es una disciplina que se enmarca dentro del campo de investigación conocido como Computación Natural. Tiene como objetivo el desarrollo de modelos de computación ...
Capítulo de Libro
A MzScheme Implementation of Transition P Systems
(Springer, 2003)
The main goal of this paper is to present the design of an MzScheme program that allows us to simulate the behavior of transition P systems. For that, a library of procedures have been developed that work in two stages. ...
Tesis Doctoral
Verificación de programas en modelos de computación no convencionales
(2002)
El objetivo fundamental de esta memoria consiste en desarrollar una primer aproximación a la verificación formal de procedimientos mecánicos en modelos no convencionales, en el marco de la Computación Natural. Para ello, ...
Ponencia
Molecular Computation Models in ACL2: a Simulation of Lipton’s Experiment Solving SAT
(2002)
In this paper we present an ACL2 formalization of a molecular computing model: Adleman’s restricted model [2]. This is a first step to formalize unconventional models of computation in ACL2. As an application of this ...
Ponencia
Complexity Classes in Cellular Computing with Membranes
(2003)
In this paper we introduce the complexity class PMC∗ F of all decision problems solvable in polynomial time by a family of P systems belonging to a prefixed class of recognizer membrane systems, F.
Capítulo de Libro
Computationally Hard Problems Addressed Through P Systems
(Springer, 2006)
In this chapter we present a general framework to provide efficient solutions to decision problems through families of cell-like membrane systems constructed in a semi-uniform way (associating with each instance of the ...
Capítulo de Libro
Implementing in Prolog an Effective Cellular Solution to the Knapsack Problem
(Springer, 2004)
In this paper we present an implementation in Prolog of an effective solution to the Knapsack problem via a family of deterministic P systems with active membranes using 2-division.
Artículo
Verifying a P system generating squares
(Romanian Academy, Section for Information Science and Technology, 2002)
In [1], an example of a P system generating exactly all the squares of natural numbers greater than 1 is given. Nevertheless, only an informal reasoning of this result is presented. In this paper we study a similar P ...
Artículo
Modelos de computación celular con membranas
(SEMA, 2004)
Capítulo de Libro
Formal Verification of Programs in Molecular Models with Random Access Memory
(Fénix Editorial, 2005)
Formal verification of molecular programs is a first step towards their automatic processing by means of reasoning systems (ACL2, PVS, etc). In this paper a systematic method to establish verifications of these programs ...