-
Article
Solving subset sum and SAT problems by reaction systems
We study the efficiency of the reaction systems in solving NP-complete problems. Due to the fact that standard reaction systems are qualitative, in order to accomplish our aim, in this paper we consider commun...
-
Article
Variants of spiking neural P systems and their operational semantics in Haskell
This article presents the Haskell implementations of spiking neural P systems and of two variants subsequently introduced in the literature, namely the spiking neural P systems with inhibitory rules and spikin...
-
Article
Spiking neural P systems and their semantics in Haskell
We use the functional programming language Haskell to design semantic interpreters for the spiking neural P systems. Haskell provides an appropriate support for implementing the denotational semantics of a con...
-
Article
Various forms of infinity for finitely supported structures
The goal of this paper is to define and study the notion of infinity in the framework of finitely supported structures, presenting new properties of infinite cardinalities. Some of these properties are extende...
-
Chapter and Conference Paper
Interval Probability for Sessions Types
We propose a ty** system based on multiparty session types and probabilistic interactions. We define a probabilistic process calculus using nondeterministic external choices and probabilistic internal choice...
-
Article
Travelling salesman problem in tissue P systems with costs
We define tissue P systems with costs assigning execution costs to the synapses that are used to transport the objects between cells. We use the Priced-Timed Maude rewriting engine to provide an implementation...
-
Article
Memory associated with membranes systems
We study the notion of memory associated with membranes systems. Such a memory can be used in various ways; in this paper, we focus on two of them. One way is to consider the memory as a device for tracking ho...
-
Article
Reversible computation in nature inspired rule-based systems
Since reversibility is an inherent property of many natural phenomena, it makes sense to investigate reversibility in natural computing. More exactly, to study reversible computation in rule-based systems insp...
-
Article
Mutual exclusion and reversibility in reaction systems
The evolution of a reaction system is usually driven by a fixed set of unconstrained rules. In this paper, we present a different approach by imposing some constraints over the rules. Thus, we define restricte...
-
Article
Properties of the atoms in finitely supported structures
The goal of this paper is to present a collection of properties of the set of atoms and the set of finite injective tuples of atoms, as well as of the (finite and cofinite) powersets of atoms in the framework ...
-
Chapter
Choice Principles for Finitely Supported Structures
The validity and the non-validity of choice principles in various models of Zermelo-Fraenkel set theory and of Zermelo-Fraenkel set theory with atoms (including the symmetric models and the permutation models)...
-
Chapter
Constructions of Lattices in Finitely Supported Mathematics
We present various fundamental examples of invariant lattices and study their properties. We particularly mention the finitely supported subsets of an invariant set, the finitely supported functions from an in...
-
Chapter
Properties of Atoms in Finitely Supported Mathematics
AbstractWe present a large collection of properties of the set of atoms, of its (finite or cofinite) powerset and of its (finite) higher-order powerset in the world of finitely supported algebraic structures. ...
-
Chapter
Abstraction in Finitely Supported Mathematics
The notion of abstraction appearing in the theory of nominal sets is used in order to model basic concepts in computer science such as renaming, binding and fresh name. We provide a uniform presentation of the...
-
Chapter
Conclusion
It is presented a summary of the main ideas and results.
-
Chapter
Connections with Tarski’s Concept of Logicality
Our goal is to emphasize a connection between the approach regarding finitely supported structures and Tarski’s definition of logicality requiring invariance under the one-to-one transformations of a universe ...
-
Chapter
Lattices in Finitely Supported Mathematics
We introduce and study lattices in the framework of finitely supported structures. Various properties of lattices are obtained by extending the classical Zermelo-Fraenkel results from the world of non-atomic s...
-
Chapter
Galois Connections in Finitely Supported Mathematics
We introduce and study Galois connections between finitely supported ordered structures. Particularly, we present properties of finitely supported Galois connections between invariant complete lattices. As an ...
-
Chapter
Freshness in Finitely Supported Mathematics
The goal of this chapter is to describe properties of elements placed outside the support of a given element. We present a specific quantifier (introduced initially by Gabbay and Pitts) that encodes ‘for all b...
-
Chapter
Relaxing the Finite Support Requirement
PA-sets are defined as classical sets equipped with actions of the group of all bijections of an amorphous set A. They are constructed in the same way as SAsets, except that for defining PA-sets we consider all t...
