Buscar
Mostrando ítems 1-5 de 5
Artículo
On spiking neural P systems
(Springer, 2010)
This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an ...
Artículo
Formal proofs about rewriting using ACL2
(Springer, 2002)
We present an application of the ACL2 theorem prover to reason about rewrite systems theory. We describe the formalization and representation aspects of our work using the firstorder, quantifier-free logic of ACL2 and ...
Artículo
3-Col problem modelling using simple kernel P systems
(Taylor and Francis, 2013)
This paper presents the newly introduced class of (simple) kernel P systems ((s)kP systems) and investigates through a 3-colouring problem case study the expressive power and efficiency of kernel P systems. It describes ...
Artículo
A verified Common Lisp implementation of Buchberger's algorithm in ACL2
(Elsevier, 2010)
In this article, we present the formal verification of a Common Lisp implementation of Buchberger's algorithm for computing Gröbner bases of polynomial ideals. This work is carried out in ACL2, a system which provides ...
Artículo
A Formalization of Transition P Systems
(IOS Press, 2002)
In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: transition P systems as they were given in [3], addressed ...