Related papers: Reaction Automata
Given any finite and closed chemical reaction system, it is possible to efficiently determine whether or not it contains a `self-sustaining and collectively autocatalytic' subset of reactions, and to find such subsets when they exist.…
Open-domain dialog systems (also known as chatbots) have increasingly drawn attention in natural language processing. Some of the recent work aims at incorporating affect information into sequence-to-sequence neural dialog modeling, making…
Group classification of systems of two coupled nonlinear reaction-diffusion equation with a diagonal diffusion matrix is carried out. Symmetries of diffusion systems with singular diffusion matrix and additional first order derivative terms…
Chemical reaction network theory is a field of applied mathematics concerned with modeling chemical systems, and can be used in other contexts such as in systems biology to study cellular signaling pathways or epidemiology to study the…
In order to develop systems capable of modeling artificial life, we need to identify, which systems can produce complex behavior. We present a novel classification method applicable to any class of deterministic discrete space and time…
Dynamical system models of complex biochemical reaction networks are usually high-dimensional, nonlinear, and contain many unknown parameters. In some cases the reaction network structure dictates that positive equilibria must be unique for…
Autocatalytic Sets are reaction networks theorised as networks at the basis of life. Their main feature is the ability of spontaneously emerging and self-reproducing. The Reflexively and Food-generated theory provides a formal definition of…
We introduce the Concurrent Modular Agent (CMA), a framework that orchestrates multiple Large-Language-Model (LLM)-based modules that operate fully asynchronously yet maintain a coherent and fault-tolerant behavioral loop. This framework…
Stochastic reaction networks, which are usually modeled as continuous-time Markov chains on $\mathbb Z^d_{\ge 0}$, and simulated via a version of the "Gillespie algorithm," have proven to be a useful tool for the understanding of processes,…
In a supervisory control system the human agent knowledge of past, current, and future system behavior is critical for system performance. Being able to reason about that knowledge in a precise and structured manner is central to effective…
Reaction systems, introduced by Ehrenfeucht and Rozenberg, are elementary computational models based on biochemical reactions transpiring within the living cells. Numerous studies focus on mathematical aspects of minimal reaction systems…
Mass-action chemical reaction systems are frequently used in Computational Biology. The corresponding polynomial dynamical systems are often large (consisting of tens or even hundreds of ordinary differential equations) and poorly…
Recent years have seen a boom in interest in machine learning systems that can provide a human-understandable rationale for their predictions or decisions. However, exactly what kinds of explanation are truly human-interpretable remains…
39 detailed mechanisms for combustion of hydrogen, carbon monoxide and methanol are investigated using ReactionKinetics, a Mathematica based package. The obtained results in most cases do not depend on the choice of reaction rate…
Multi-stack machines and Turing machines can simulate to each other. In this note, we give a succinct definition of multi-stack machines, and from this definition it is clearly seen that pushdown automata and deterministic finite automata…
Requirements are formulated for a reaction kinetics package to be useful for an as wide as possible circle of users and illustrated with examples using ReactionKinetics, a Mathematica based package.
Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While…
A formalism is presented for computing and organizing actions for autonomous agents in dynamic environments. We introduce the notion of teleo-reactive (T-R) programs whose execution entails the construction of circuitry for the continuous…
It is well known that the action functional can be used to define classical, quantum, closed, and open dynamics in a generalization of the variational principle and in the path integral formalism in classical and quantum dynamics,…
In this paper we consider the class of lambda-nondeterministic linear automata as a model of the class of linear languages. As usual in other automata models, lambda-moves do not increase the acceptance power. The main contribution of this…