scientific article

zbMath1108.68056MaRDI QIDQ3425581

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 26 February 2007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40)

Related Items

Complexity of model checking for reaction systems ⋮ Investigating dynamic causalities in reaction systems ⋮ Evolving reaction systems ⋮ Minimal reaction systems: duration and blips ⋮ Minimal and almost minimal reaction systems ⋮ Representing Reaction Systems by Trees ⋮ Peptide Computers ⋮ Relevance of Entities in Reaction Systems ⋮ Towards “Fypercomputations” (in Membrane Computing) ⋮ Step semantics of Boolean nets ⋮ Predictors for flat membrane systems ⋮ On the complexity of occurrence and convergence problems in reaction systems ⋮ A Formal Framework for Processes Inspired by the Functioning of Living Cells ⋮ Controlled reversibility in communicating reaction systems ⋮ Characterization and computation of ancestors in reaction systems ⋮ Events and modules in reaction systems ⋮ Minimal Reaction Systems Defining Subset Functions ⋮ Evolvability of reaction systems and the invisibility theorem ⋮ Steady states of constrained reaction systems ⋮ A graph isomorphism condition and equivalence of reaction systems ⋮ Signal set tissue systems and overlapping localities ⋮ Complexity of the dynamics of reaction systems ⋮ Numerical networks of cells ⋮ Process calculi for biological processes ⋮ Compositional semantics and behavioural equivalences for reaction systems with restriction ⋮ Computing preimages and ancestors in reaction systems ⋮ Functions and sequences generated by reaction systems ⋮ Decomposition and factorization of chemical reaction transducers ⋮ Plug-in context providers for reaction systems ⋮ Standard and ordered zoom structures ⋮ Ancestors, descendants, and gardens of Eden in reaction systems ⋮ Classifying invariant structures of step traces ⋮ On the computational power of swarm automata using agents with position information ⋮ Fixed points and attractors of reactantless and inhibitorless reaction systems ⋮ Computational complexity of reversible reaction systems ⋮ On probabilistic and quantum reaction systems ⋮ Reaction automata ⋮ Towards bridging two cell-inspired models: P systems and R systems ⋮ Reaction Systems, Transition Systems, and Equivalences ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ A P systems variant for reasoning about sequential controllability of Boolean networks ⋮ Simulating R Systems by P Systems ⋮ Unnamed Item ⋮ The \texttt{link}-calculus for open multiparty interactions ⋮ Unnamed Item ⋮ Compositions of Functions and Permutations Specified by Minimal Reaction Systems ⋮ Unnamed Item ⋮ Applications of the Chinese remainder theorem to reaction systems with duration ⋮ Dependency graphs and mass conservation in reaction systems ⋮ Reaction systems and extremal combinatorics properties ⋮ Multi-Stability, Limit Cycles, and Period-Doubling Bifurcation with Reaction Systems ⋮ Facilitation in reaction systems ⋮ Simulation of reaction systems by the strictly minimal ones ⋮ Mutual exclusion and reversibility in reaction systems ⋮ Simulating reversible computation with reaction systems ⋮ Extracting reaction systems from function behavior ⋮ A survey of gene regulatory networks modelling methods: from differential equations, to Boolean and qualitative bioinspired models ⋮ Reversible computation in nature inspired rule-based systems ⋮ Controllability of reaction systems ⋮ Theory of reaction automata: a survey ⋮ Reaction Systems with Duration ⋮ Generalized contexts for reaction systems: definition and study of dynamic causalities ⋮ Irreducible reaction systems and reaction system rank ⋮ Model checking temporal properties of reaction systems ⋮ Encoding Threshold Boolean Networks into Reaction Systems for the Analysis of Gene Regulatory Networks ⋮ Reducing control alphabet size for the control of right linear grammars with unknown behaviors ⋮ Graph transformation through graph surfing in reaction systems ⋮ An excursion in reaction systems: from computer science to biology ⋮ On the properties of language classes defined by bounded reaction automata ⋮ Ranks of strictly minimal reaction systems induced by permutations ⋮ Preimage Problems for Reaction Systems ⋮ Introducing time in reaction systems ⋮ Computational virtuality in biological systems ⋮ Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation ⋮ Transactions and contracts based on reaction systems ⋮ Comparing reactions in reaction systems ⋮ Asynchrony and persistence in reaction systems ⋮ A categorial approach to reaction systems: first steps ⋮ Reaction systems with influence on environment ⋮ Networks of Reaction Systems ⋮ Towards Quantitative Verification of Reaction Systems ⋮ Transition graphs of reversible reaction systems ⋮ Communicating reaction systems with direct communication ⋮ Certain state sequences defined by P systems with reactions ⋮ The computational capability of chemical reaction automata ⋮ Theory of tailor automata ⋮ Companions and an Essential Motion of a Reaction System ⋮ Uncertainty representation in dynamical systems using rough set theory ⋮ From networks of reaction systems to communicating reaction systems and back ⋮ Languages of distributed reaction systems ⋮ On the computational complexity of reaction systems, revisited ⋮ Topics in region theory and synthesis problems ⋮ Transformations of reaction systems over categories by means of epi-mono factorization and functors

This page was built for publication: