state transition graphadditive cellular automatapolynomialstopological parameter/ C4220 Automata theory C1160 Combinatorial mathematicsCharacterization of additive cellular automata (CA) on the basis of the inv
Volume A covers models of computation, complexity theory, data structures, and efficient computation in many recognized subdisciplines of theoretical computer science. Volume B takes up the theory of automata and rewriting systems, the foundations of modern programming languages, and logics for program...
the subject of this paper, falls into this second strand of research. Reaction systems were proposed as a formal model for the investigation of the functioning of the living cell, where this functioning is viewed in terms of formal processes resulting from interactions between biochemical reactions ...
Discrete event behavior modeling techniques are all descendants of the finite-state machines (FSMs) (or finite-state automata) [3]. A finite-state machine FSM = (E, S, T) is an abstract machine, where • E is a finite set of recognized event types. Instances of events e ∈ E often...
We do this in a general reversible setting where two or more metastable states are allowed and some of them may even be degenerate. This generalizes previous results that hold for a series of only two metastable states. We then focus on a specific Probabilistic Cellular Automata (PCA) with ...
An algorithm is also presented which computes bisimulation formulae for finite state symbolic transition graphs with assignments, in terms of the greatest solutions of predicate equation systems.Huimin LinCONCUR'96: Concurrency theoryLin, H.: Symbolic transition graph with assignment. In: Proc. of ...
Prediction of the lowest energy structure for transition metal clusters and related systems is fundamental in cluster science. Advances in the structure search methods have reduced the computer time for structure prediction, standing on the performance of density functional theory (DFT) calculations. This...
Graph Theory in Probability Social Structure 1Introduction Designing distributed algorithms that let the nodes of a graph reach aconsensus, i.e., a configuration of states where all the nodes agree on the same state, is a fundamental problem in distributed computing and multi-agent systems. Consen...
There are two kinds of bisimulations and simulations, namely, crisp and fuzzy, for fuzzy graph-based structures such as FLTSs, fuzzy automata, fuzzy/weighted social networks, fuzzy Kripke models and fuzzy interpretations in description logic. They have been studied by a considerable number of rese...
Abstract Definitions and theorems fundamental for the study of general Petri nets or place/transition nets are presented. The results give properties of marking graphs, provide insight into the computational complexity of several decision procedures, show the initimate relation of reachability sets to Pr...