Search
Search Results
-
Solving the SAT problem with the string multiset rewriting calculus
In this paper, we develop computing machinery within the framework of the String Multiset Rewriting calculus (SMSR), as defined by Barbuti et al. [
4 ],... -
On the spectrum between reaction systems and string rewriting
Reaction systems are a model of computing aiming to formalize biochemistry by capturing the qualitative relations between the species, and explicitly...
-
On the Hierarchy of Swarm-automaton for the Number of Agents
We have introduced and extended the notion of swarm automaton to analyze the computability using swarm movement represented by multiset rewriting....
-
On the computational power of swarm automata using agents with position information
Based on swarm movements and computing models using multisets, a swarm automaton was introduced to construct a new computing system using swarm...
-
On the Security and Complexity of Periodic Systems
Recent years have seen a tremendous increase in the reliance of industrial systems on a variety of interconnected components ranging in complexity...
-
Generation of chain code pictures using cell-like spiking neural P system with several types of spikes
Spiking neural P systems (SN P Systems) are a class of computational models stimulated by the neural biological systems in which information is...
-
On languages generated by isotonic array P systems with/without priority rules
Membrane computing and array grammars are two well-known areas in formal language theory. In this paper, we investigate the languages generated by...
-
Chemical Reaction Regular Grammars
We propose a new type of computing devices based on grammatical formulation augmented by multiset storages, called chemical reaction regular grammars...
-
Watson-crick (D)0 L systems: a survey
Watson-Crick L systems are string generating formal models obtained by augmenting Lindenmayer systems with the Watson-Crick morphism inspired by the...
-
Theory of reaction automata: a survey
In this paper, we survey on reaction automata theory to model and analyze the biochemical behaviors of vital reactions occurring in nature. Inspired...
-
On the efficiency of synchronized P systems
We consider synchronized membrane systems extended with communication and division rules, using the maximal parallelism evolution strategy together...
-
P systems with reactive membranes
Membranes are one of the key concepts in P systems and membrane computing, and a lot of research activities focus on their properties and possible...
-
P systems with limited number of objects
P systems are a model of compartmentalized multiset rewriting inspired by the structure of living cells and the way they function. In this paper, we...
-
Simple variants of non-cooperative polymorphic P systems
We investigate the computational power of non-cooperative polymorphic P systems with no additional ingredients. The variants we study are even more...
-
Protocol Dialects as Formal Patterns
A protocol dialect is a lightweight method to obfuscate the communication exchanges between legitimate protocol users to make it hard for malicious...
-
Swarm-Based Multiset Rewriting Computing Models
Swarm-based computing models and multi-agent-based models have been investigated using parallel processing computation. Based on the preceding models...
-
A Maude Formalization of Object Nets
Self-adaptive systems gain growing attention by raising service quality and reducing development costs. But on the other hand, self-adaptation is a...
-
A Rule-Based Procedure for Graph Query Solving
We consider a core language for graph queries. These queries, which may transform graphs to graphs, are seen as formulas to be solved with respect to...
-
The MaxSAT Problem in the Real-Valued MV-Algebra
This work addresses the maximum satisfiability (MaxSAT) problem for a multiset of arbitrary formulas of the language of propositional Łukasiewicz...