WorldWideScience

Sample records for automata theory

  1. Algebraic and structural automata theory

    CERN Document Server

    Mikolajczak, B

    1991-01-01

    Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.The result of over ten years of research, this book presents work in the following areas of Automata Theory: automata morphisms, time-varying automata, automata realizations and relationships between automata and semigroups.Aimed at those working in discrete mathematics and computer science, parts of the book are suitable for use in graduate courses in computer science, electronics, telecommunications, and control engineering. It is assumed that the reader is familiar with the basic concepts of algebra and graph theory.

  2. Theory of Digital Automata

    CERN Document Server

    Borowik, Bohdan; Lahno, Valery; Petrov, Oleksandr

    2013-01-01

    This book serves a dual purpose: firstly to combine the treatment of circuits and digital electronics, and secondly, to establish a strong connection with the contemporary world of digital systems. The need for this approach arises from the observation that introducing digital electronics through a course in traditional circuit analysis is fast becoming obsolete. Our world has gone digital. Automata theory helps with the design of digital circuits such as parts of computers, telephone systems and control systems. A complete perspective is emphasized, because even the most elegant computer architecture will not function without adequate supporting circuits. The focus is on explaining the real-world implementation of complete digital systems. In doing so, the reader is prepared to immediately begin design and implementation work. This work serves as a bridge to take readers from the theoretical world to the everyday design world where solutions must be complete to be successful.

  3. Automata theory and its applications

    CERN Document Server

    Khoussainov, Bakhadyr

    2001-01-01

    The theory of finite automata on finite stings, infinite strings, and trees has had a dis­ tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's ...

  4. Learning automata theory and applications

    CERN Document Server

    Najim, K

    1994-01-01

    Learning systems have made a significant impact on all areas of engineering problems. They are attractive methods for solving many problems which are too complex, highly non-linear, uncertain, incomplete or non-stationary, and have subtle and interactive exchanges with the environment where they operate. The main aim of the book is to give a systematic treatment of learning automata and to produce a guide to a wide variety of ideas and methods that can be used in learning systems, including enough theoretical material to enable the user of the relevant techniques and concepts to understand why

  5. An Interface Theory for Input/Output Automata

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand; Nyman, Ulrik; Wasowski, Andrzej

    Building on the theory of interface automata by de~Alfaro and Henzinger we design an interface language for Lynch's Input/Output Automata, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit....... We also present a method for solving systems of relativized behavioral inequalities as used in our setup and draw a formal correspondence between our work and interface automata. Proofs are provided in an appendix....

  6. Elements of automata theory and the theory of Markov chains. [Self-organizing control systems

    Energy Technology Data Exchange (ETDEWEB)

    Lind, M

    1975-03-01

    Selected topics from automata theory and the theory of Markov chains are treated. In particular, finite-memory automata are discussed in detail, and the results are used to formulate an automation model of a class of continuous systems. Stochastic automata are introduced as a natural generalization of the deterministic automaton. Markov chains are shown to be closely related to stochastic automata. Results from Markov chain theory are thereby directly applicable to analysis of stochastic automata. This report provides the theoretical foundation for the investigation in Riso Report No. 315 of a class of self-organizing control systems. (25 figures) (auth)

  7. Theory of automata, formal languages and computation

    CERN Document Server

    Xavier, SPE

    2004-01-01

    This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems.

  8. Classification of networks of automata by dynamical mean field theory

    International Nuclear Information System (INIS)

    Burda, Z.; Jurkiewicz, J.; Flyvbjerg, H.

    1990-01-01

    Dynamical mean field theory is used to classify the 2 24 =65,536 different networks of binary automata on a square lattice with nearest neighbour interactions. Application of mean field theory gives 700 different mean field classes, which fall in seven classes of different asymptotic dynamics characterized by fixed points and two-cycles. (orig.)

  9. A half-century of automata theory celebration and inspiration

    CERN Document Server

    Salomaa, A; Yu, S

    2001-01-01

    This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of automata theory are reminisced about and future directions are suggested. Although some of the contributions go into rather intriguing technical details, most of the book is accessible to a wide audience interested in the progress of the age of computers. The book is a must for professionals in theoretical computer science and related areas of mathematics. For students in these areas it provides an exceptionally deep view at the beginn

  10. Fire and Heat Spreading Model Based on Cellular Automata Theory

    Science.gov (United States)

    Samartsev, A. A.; Rezchikov, A. F.; Kushnikov, V. A.; Ivashchenko, V. A.; Bogomolov, A. S.; Filimonyuk, L. Yu; Dolinina, O. N.; Kushnikov, O. V.; Shulga, T. E.; Tverdokhlebov, V. A.; Fominykh, D. S.

    2018-05-01

    The distinctive feature of the proposed fire and heat spreading model in premises is the reduction of the computational complexity due to the use of the theory of cellular automata with probability rules of behavior. The possibilities and prospects of using this model in practice are noted. The proposed model has a simple mechanism of integration with agent-based evacuation models. The joint use of these models could improve floor plans and reduce the time of evacuation from premises during fires.

  11. A survey on the modeling and applications of cellular automata theory

    Science.gov (United States)

    Gong, Yimin

    2017-09-01

    The Cellular Automata Theory is a discrete model which is now widely used in scientific researches and simulations. The model is comprised of some cells which changes according to a specific rule over time. This paper provides a survey of the Modeling and Applications of Cellular Automata Theory, which focus on the program realization of Cellular Automata Theory and the application of Cellular Automata in each field, such as road traffic, land use, and cutting machines. Each application is further explained, and several related main models are briefly introduced. This research aims to help decision-makers formulate appropriate development plans.

  12. Automata and automata mappings of semigroups

    OpenAIRE

    Plotkin, Boris; Plotkin, Tatjana

    2015-01-01

    The paper is devoted to two types of algebraic models of automata. The usual (first type) model leads to the developed decomposition theory (Krohn-Rhodes theory). We introduce another type of automata model and study how these automata are related to cascade connections of automata of the first type. The introduced automata play a significant role in group theory and, hopefully, in the theory of formal languages.

  13. Computer Models and Automata Theory in Biology and Medicine

    CERN Document Server

    Baianu, I C

    2004-01-01

    The applications of computers to biological and biomedical problem solving goes back to the very beginnings of computer science, automata theory [1], and mathematical biology [2]. With the advent of more versatile and powerful computers, biological and biomedical applications of computers have proliferated so rapidly that it would be virtually impossible to compile a comprehensive review of all developments in this field. Limitations of computer simulations in biology have also come under close scrutiny, and claims have been made that biological systems have limited information processing power [3]. Such general conjectures do not, however, deter biologists and biomedical researchers from developing new computer applications in biology and medicine. Microprocessors are being widely employed in biological laboratories both for automatic data acquisition/processing and modeling; one particular area, which is of great biomedical interest, involves fast digital image processing and is already established for rout...

  14. Priced Timed AutomataTheory and Tools

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand

    2009-01-01

    Priced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)deci\\-dability results related to priced timed automata as well as point to a number of open problems....

  15. Complementation of coalgebra automata

    NARCIS (Netherlands)

    Kissig, C.; Venema, Y.

    2009-01-01

    Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This coalgebraic perspective on automata lays foundation to a universal theory of automata operating on infinite models of computation.

  16. Cellular Automata Ideas in Digital Circuits and Switching Theory.

    Science.gov (United States)

    Siwak, Pawel P.

    1985-01-01

    Presents two examples which illustrate the usefulness of ideas from cellular automata. First, Lee's algorithm is recalled and its cellular nature shown. Then a problem from digraphs, which has arisen from analyzing predecessing configurations in the famous Conway's "game of life," is considered. (Author/JN)

  17. NATO Advanced Study Institute on Structural Theory of Automata, Semigroups and Universal Algebra

    CERN Document Server

    Rosenberg, Ivo; Goldstein, Martin

    2005-01-01

    Several of the contributions to this volume bring forward many mutually beneficial interactions and connections between the three domains of the title. Developing them was the main purpose of the NATO ASI summerschool held in Montreal in 2003. Although some connections, for example between semigroups and automata, were known for a long time, developing them and surveying them in one volume is novel and hopefully stimulating for the future. Another aspect is the emphasis on the structural theory of automata that studies ways to contstruct big automata from small ones. The volume also has contributions on top current research or surveys in the three domains. One contribution even links clones of universal algebra with the computational complexity of computer science. Three contributions introduce the reader to research in the former East block.

  18. Stimulus-Response Theory of Finite Automata, Technical Report No. 133.

    Science.gov (United States)

    Suppes, Patrick

    The central aim of this paper and its projected successors is to prove in detail that stimulus-response theory, or at least a mathematically precise version, can give an account of the learning of many phrase-structure grammars. Section 2 is concerned with standard notions of finite and probabilistic automata. An automaton is defined as a device…

  19. Finite automata, their algebras and grammars towards a theory of formal expressions

    CERN Document Server

    Büchi, J Richard

    1989-01-01

    The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and aga...

  20. Learning automata an introduction

    CERN Document Server

    Narendra, Kumpati S

    2012-01-01

    This self-contained introductory text on the behavior of learning automata focuses on how a sequential decision-maker with a finite number of choices responds in a random environment. Topics include fixed structure automata, variable structure stochastic automata, convergence, 0 and S models, nonstationary environments, interconnected automata and games, and applications of learning automata. A must for all students of stochastic algorithms, this treatment is the work of two well-known scientists and is suitable for a one-semester graduate course in automata theory and stochastic algorithms.

  1. Automation of Algorithmic Tasks for Virtual Laboratories Based on Automata Theory

    Directory of Open Access Journals (Sweden)

    Evgeniy A. Efimchik

    2016-03-01

    Full Text Available In the work a description of an automata model of standard algorithm for constructing a correct solution of algorithmic tests is given. The described model allows a formal determination of the variant complexity of algorithmic test and serves as a basis for determining the complexity functions, including the collision concept – the situation of uncertainty, when a choice must be made upon fulfilling the task between the alternatives with various priorities. The influence of collisions on the automata model and its inner structure is described. The model and complexity functions are applied for virtual laboratories upon designing the algorithms of constructing variant with a predetermined complexity in real time and algorithms of the estimation procedures of students’ solution with respect to collisions. The results of the work are applied to the development of virtual laboratories, which are used in the practical part of massive online course on graph theory.

  2. Efficient Identification of Timed Automata : Theory and practice

    NARCIS (Netherlands)

    Verwer, S.E.

    2010-01-01

    This thesis contains a study in a subfield of artificial intelligence, learning theory, machine learning, and statistics, known as system (or language) identification. System identification is concerned with constructing (mathematical) models from observations. Such a model is an intuitive

  3. A Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding

    Directory of Open Access Journals (Sweden)

    Shailesh Kamble

    2016-12-01

    Full Text Available Fractal compression is the lossy compression technique in the field of gray/color image and video compression. It gives high compression ratio, better image quality with fast decoding time but improvement in encoding time is a challenge. This review paper/article presents the analysis of most significant existing approaches in the field of fractal based gray/color images and video compression, different block matching motion estimation approaches for finding out the motion vectors in a frame based on inter-frame coding and intra-frame coding i.e. individual frame coding and automata theory based coding approaches to represent an image/sequence of images. Though different review papers exist related to fractal coding, this paper is different in many sense. One can develop the new shape pattern for motion estimation and modify the existing block matching motion estimation with automata coding to explore the fractal compression technique with specific focus on reducing the encoding time and achieving better image/video reconstruction quality. This paper is useful for the beginners in the domain of video compression.

  4. Robots and lattice automata

    CERN Document Server

    Adamatzky, Andrew

    2015-01-01

    The book gives a comprehensive overview of the state-of-the-art research and engineering in theory and application of Lattice Automata in design and control of autonomous Robots. Automata and robots share the same notional meaning. Automata (originated from the latinization of the Greek word “αυτόματον”) as self-operating autonomous machines invented from ancient years can be easily considered the first steps of robotic-like efforts. Automata are mathematical models of Robots and also they are integral parts of robotic control systems. A Lattice Automaton is a regular array or a collective of finite state machines, or automata. The Automata update their states by the same rules depending on states of their immediate neighbours. In the context of this book, Lattice Automata are used in developing modular reconfigurable robotic systems, path planning and map exploration for robots, as robot controllers, synchronisation of robot collectives, robot vision, parallel robotic actuators. All chapters are...

  5. Probabilistic Reversible Automata and Quantum Automata

    OpenAIRE

    Golovkins, Marats; Kravtsev, Maksim

    2002-01-01

    To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.

  6. The Determining Finite Automata Process

    Directory of Open Access Journals (Sweden)

    M. S. Vinogradova

    2017-01-01

    Full Text Available The theory of formal languages widely uses finite state automata both in implementation of automata-based approach to programming, and in synthesis of logical control algorithms.To ensure unambiguous operation of the algorithms, the synthesized finite state automata must be deterministic. Within the approach to the synthesis of the mobile robot controls, for example, based on the theory of formal languages, there are problems concerning the construction of various finite automata, but such finite automata, as a rule, will not be deterministic. The algorithm of determinization can be applied to the finite automata, as specified, in various ways. The basic ideas of the algorithm of determinization can be most simply explained using the representations of a finite automaton in the form of a weighted directed graph.The paper deals with finite automata represented as weighted directed graphs, and discusses in detail the procedure for determining the finite automata represented in this way. Gives a detailed description of the algorithm for determining finite automata. A large number of examples illustrate a capability of the determinization algorithm.

  7. Cellular automata analysis and applications

    CERN Document Server

    Hadeler, Karl-Peter

    2017-01-01

    This book focuses on a coherent representation of the main approaches to analyze the dynamics of cellular automata. Cellular automata are an inevitable tool in mathematical modeling. In contrast to classical modeling approaches as partial differential equations, cellular automata are straightforward to simulate but hard to analyze. In this book we present a review of approaches and theories that allow the reader to understand the behavior of cellular automata beyond simulations. The first part consists of an introduction of cellular automata on Cayley graphs, and their characterization via the fundamental Cutis-Hedlund-Lyndon theorems in the context of different topological concepts (Cantor, Besicovitch and Weyl topology). The second part focuses on classification results: What classification follows from topological concepts (Hurley classification), Lyapunov stability (Gilman classification), and the theory of formal languages and grammars (Kůrka classification). These classifications suggest to cluster cel...

  8. Statistical mechanics of cellular automata

    International Nuclear Information System (INIS)

    Wolfram, S.

    1983-01-01

    Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors. With simple initial configurations, the cellular automata either tend to homogeneous states, or generate self-similar patterns with fractal dimensions approx. =1.59 or approx. =1.69. With ''random'' initial configurations, the irreversible character of the cellular automaton evolution leads to several self-organization phenomena. Statistical properties of the structures generated are found to lie in two universality classes, independent of the details of the initial state or the cellular automaton rules. More complicated cellular automata are briefly considered, and connections with dynamical systems theory and the formal theory of computation are discussed

  9. Interface Input/Output Automata

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand; Nyman, Ulrik; Wasowski, Andrzej

    2006-01-01

    Building on the theory of interface automata by de Alfaro and Henzinger we design an interface language for Lynch’s I/O, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit separation of assumptions...... a method for solving systems of relativized behavioral inequalities as used in our setup and draw a formal correspondence between our work and interface automata....

  10. On path hypercompositions in graphs and automata

    Directory of Open Access Journals (Sweden)

    Massouros Christos G.

    2016-01-01

    Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.

  11. Logic and Automata History and Perspectives

    CERN Document Server

    Gradel, Erich; Wilk, Thomas

    2007-01-01

    Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field. Title: Logic and Automata : History and Perspectives Print ISBN: 9789053565766 Author(s): Flum, Jörg; Gr; del, Erich; Wilke, Thomas eISBN: 9789048501281 Publisher: Amsterdam University Press Dewey: 511.3 Publication Date: 01 Jan, 2007 Pages: 737 Category: Mathematics LCCN: Language: English Edition: N/A LCSH:

  12. A cellular automata model for traffic flow based on kinetics theory, vehicles capabilities and driver reactions

    Science.gov (United States)

    Guzmán, H. A.; Lárraga, M. E.; Alvarez-Icaza, L.; Carvajal, J.

    2018-02-01

    In this paper, a reliable cellular automata model oriented to faithfully reproduce deceleration and acceleration according to realistic reactions of drivers, when vehicles with different deceleration capabilities are considered is presented. The model focuses on describing complex traffic phenomena by coding in its rules the basic mechanisms of drivers behavior, vehicles capabilities and kinetics, while preserving simplicity. In particular, vehiclés kinetics is based on uniform accelerated motion, rather than in impulsive accelerated motion as in most existing CA models. Thus, the proposed model calculates in an analytic way three safe preserving distances to determine the best action a follower vehicle can take under a worst case scenario. Besides, the prediction analysis guarantees that under the proper assumptions, collision between vehicles may not happen at any future time. Simulations results indicate that all interactions of heterogeneous vehicles (i.e., car-truck, truck-car, car-car and truck-truck) are properly reproduced by the model. In addition, the model overcomes one of the major limitations of CA models for traffic modeling: the inability to perform smooth approach to slower or stopped vehicles. Moreover, the model is also capable of reproducing most empirical findings including the backward speed of the downstream front of the traffic jam, and different congested traffic patterns induced by a system with open boundary conditions with an on-ramp. Like most CA models, integer values are used to make the model run faster, which makes the proposed model suitable for real time traffic simulation of large networks.

  13. Automata, Logic, and XML

    OpenAIRE

    NEVEN, Frank

    2002-01-01

    We survey some recent developments in the broad area of automata and logic which are motivated by the advent of XML. In particular, we consider unranked tree automata, tree-walking automata, and automata over infinite alphabets. We focus on their connection with logic and on questions imposed by XML.

  14. On Algebraic Study of Type-2 Fuzzy Finite State Automata

    Directory of Open Access Journals (Sweden)

    Anupam K. Singh

    2017-08-01

    Full Text Available Theories of fuzzy sets and type-2 fuzzy sets are powerful mathematical tools for modeling various types of uncertainty. In this paper we introduce the concept of type-2 fuzzy finite state automata and discuss the algebraic study of type-2 fuzzy finite state automata, i.e., to introduce the concept of homomorphisms between two type-2 fuzzy finite state automata, to associate a type-2 fuzzy transformation semigroup with a type-2 fuzzy finite state automata. Finally, we discuss several product of type-2 fuzzy finite state automata and shown that these product is a categorical product.

  15. Algorithmic crystal chemistry: A cellular automata approach

    International Nuclear Information System (INIS)

    Krivovichev, S. V.

    2012-01-01

    Atomic-molecular mechanisms of crystal growth can be modeled based on crystallochemical information using cellular automata (a particular case of finite deterministic automata). In particular, the formation of heteropolyhedral layered complexes in uranyl selenates can be modeled applying a one-dimensional three-colored cellular automaton. The use of the theory of calculations (in particular, the theory of automata) in crystallography allows one to interpret crystal growth as a computational process (the realization of an algorithm or program with a finite number of steps).

  16. A Decomposition Theorem for Finite Automata.

    Science.gov (United States)

    Santa Coloma, Teresa L.; Tucci, Ralph P.

    1990-01-01

    Described is automata theory which is a branch of theoretical computer science. A decomposition theorem is presented that is easier than the Krohn-Rhodes theorem. Included are the definitions, the theorem, and a proof. (KR)

  17. The Role of Automata and Machine Theory in School and College Mathematics Syllabuses.

    Science.gov (United States)

    Holcombe, M.

    1981-01-01

    The introduction of certain topics in the theory of machines and languages into school and college mathematics courses in place of the more usual discussion of groups and formal logic is proposed. Examples of machines and languages and their interconnections suitable for such courses are outlined. (MP)

  18. Integrating cellular automata, artificial neural network and fuzzy set theory to simulate threatened orchards: Application to Maragheh, Iran

    NARCIS (Netherlands)

    Azari, M; Tayyebi, A; Helbich, M; Ahadnejad Reveshty, M

    2016-01-01

    Urbanization processes challenge the growth of orchards areas in many cities in Iran. In Maragheh orchards are crucial ecological, economical, and tourist sources. To explore orchards threatened by urban expansion, this study aims, first, to develop a new model by coupling cellular automata and

  19. Improved Undecidability Results for Reachability Games on Recursive Timed Automata

    Directory of Open Access Journals (Sweden)

    Shankara Narayanan Krishna

    2014-08-01

    Full Text Available We study reachability games on recursive timed automata (RTA that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clocks, while the problem is decidable for automata with only one clock. Ouaknine and Worrell recently proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. We revisited games on recursive timed automata with time-bounded restriction in the hope of recovering decidability. However, we found that the problem still remains undecidable for recursive timed automata with three or more clocks. Using similar proof techniques we characterize a decidability frontier for a generalization of RTA to recursive stopwatch automata.

  20. Modular tree automata

    DEFF Research Database (Denmark)

    Bahr, Patrick

    2012-01-01

    Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular...

  1. Efficient automata constructions and approximate automata

    NARCIS (Netherlands)

    Watson, B.W.; Kourie, D.G.; Ngassam, E.K.; Strauss, T.; Cleophas, L.G.W.A.

    2008-01-01

    In this paper, we present data structures and algorithms for efficiently constructing approximate automata. An approximate automaton for a regular language L is one which accepts at least L. Such automata can be used in a variety of practical applications, including network security pattern

  2. Efficient automata constructions and approximate automata

    NARCIS (Netherlands)

    Watson, B.W.; Kourie, D.G.; Ngassam, E.K.; Strauss, T.; Cleophas, L.G.W.A.; Holub, J.; Zdárek, J.

    2006-01-01

    In this paper, we present data structures and algorithms for efficiently constructing approximate automata. An approximate automaton for a regular language L is one which accepts at least L. Such automata can be used in a variety of practical applications, including network security pattern

  3. Visibly Pushdown Automata

    DEFF Research Database (Denmark)

    Srba, Jiri

    2006-01-01

    We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds...... for a number of studied preorders and equivalences like simulation, completed simulation, ready simulation, 2-nested simulation preorders/equivalences and bisimulation equivalence. Our main results are that all the mentioned equivalences and preorders are EXPTIME-complete on visibly pushdown automata, PSPACE......-complete on visibly one-counter automata and P-complete on visibly BPA. Our PSPACE lower bound for visibly one-counter automata improves also the previously known DP-hardness results for ordinary one-counter automata and one-counter nets. Finally, we study regularity checking problems for visibly pushdown automata...

  4. Algebraic Systems and Pushdown Automata

    Science.gov (United States)

    Petre, Ion; Salomaa, Arto

    We concentrate in this chapter on the core aspects of algebraic series, pushdown automata, and their relation to formal languages. We choose to follow here a presentation of their theory based on the concept of properness. We introduce in Sect. 2 some auxiliary notions and results needed throughout the chapter, in particular the notions of discrete convergence in semirings and C-cycle free infinite matrices. In Sect. 3 we introduce the algebraic power series in terms of algebraic systems of equations. We focus on interconnections with context-free grammars and on normal forms. We then conclude the section with a presentation of the theorems of Shamir and Chomsky-Schützenberger. We discuss in Sect. 4 the algebraic and the regulated rational transductions, as well as some representation results related to them. Section 5 is dedicated to pushdown automata and focuses on the interconnections with classical (non-weighted) pushdown automata and on the interconnections with algebraic systems. We then conclude the chapter with a brief discussion of some of the other topics related to algebraic systems and pushdown automata.

  5. Quantum features of natural cellular automata

    International Nuclear Information System (INIS)

    Elze, Hans-Thomas

    2016-01-01

    Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schrödinger equation. This includes corresponding conservation laws. The class of “natural” Hamiltonian cellular automata is based exclusively on integer-valued variables and couplings and their dynamics derives from an Action Principle. They can be mapped reversibly to continuum models by applying Sampling Theory. Thus, “deformed” quantum mechanical models with a finite discreteness scale l are obtained, which for l → 0 reproduce familiar continuum results. We have recently demonstrated that such automata can form “multipartite” systems consistently with the tensor product structures of nonrelativistic many-body quantum mechanics, while interacting and maintaining the linear evolution. Consequently, the Superposition Principle fully applies for such primitive discrete deterministic automata and their composites and can produce the essential quantum effects of interference and entanglement. (paper)

  6. The Quest for Minimal Quotients for Probabilistic Automata

    DEFF Research Database (Denmark)

    Eisentraut, Christian; Hermanns, Holger; Schuster, Johann

    2013-01-01

    One of the prevailing ideas in applied concurrency theory and verification is the concept of automata minimization with respect to strong or weak bisimilarity. The minimal automata can be seen as canonical representations of the behaviour modulo the bisimilarity considered. Together with congruence...... results wrt. process algebraic operators, this can be exploited to alleviate the notorious state space explosion problem. In this paper, we aim at identifying minimal automata and canonical representations for concurrent probabilistic models. We present minimality and canonicity results for probabilistic...... automata wrt. strong and weak bisimilarity, together with polynomial time minimization algorithms....

  7. Continuity controlled Hybrid Automata

    NARCIS (Netherlands)

    Bergstra, J.A.; Middelburg, C.A.

    We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation

  8. Continuity Controlled Hybrid Automata

    NARCIS (Netherlands)

    Bergstra, J.A.; Middelburg, C.A.

    2004-01-01

    We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of

  9. Experiments with automata compression

    NARCIS (Netherlands)

    Daciuk, J.; Yu, S; Daley, M; Eramian, M G

    2001-01-01

    Several compression methods of finite-state automata are presented and evaluated. Most compression methods used here are already described in the literature. However, their impact on the size of automata has not been described yet. We fill that gap, presenting results of experiments carried out on

  10. Continuity controlled hybrid automata

    NARCIS (Netherlands)

    Bergstra, J.A.; Middelburg, C.A.

    2004-01-01

    We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of

  11. Linearizable cellular automata

    International Nuclear Information System (INIS)

    Nobe, Atsushi; Yura, Fumitaka

    2007-01-01

    The initial value problem for a class of reversible elementary cellular automata with periodic boundaries is reduced to an initial-boundary value problem for a class of linear systems on a finite commutative ring Z 2 . Moreover, a family of such linearizable cellular automata is given

  12. Continuity controlled hybrid automata

    NARCIS (Netherlands)

    Bergstra, J.A.; Middelburg, C.A.

    2006-01-01

    We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of

  13. Nested cellular automata

    International Nuclear Information System (INIS)

    Quasthoff, U.

    1985-07-01

    Cellular automata by definition consist of a finite or infinite number of cells, say of unit length, with each cell having the same transition function. These cells are usually considered as the smallest elements and so the space filled with these cells becomes discrete. Nevertheless, large pictures created by such cellular automata look very fractal. So we try to replace each cell by a couple of smaller cells, which have the same transition functions as the large ones. There are automata where this replacement does not destroy the macroscopic structure. In these cases this nesting process can be iterated. The paper contains large classes of automata with the above properties. In the case of one dimensional automata with two states and next neighbour interaction and a nesting function of the same type a complete classification is given. (author)

  14. Types and Automata

    DEFF Research Database (Denmark)

    Schwartzbach, Michael Ignatieff; Meineche Smidt, Erik

    A hierarchical type system for imperative programming languages gives rise to various computational problems, such as type equivalence, type ordering, etc. We present a particular class of finite automata which are shown to be isomorphic to type equations. All the relevant type concepts turn out...... to have well-known automata analogues, such as language equality, language inclusion, etc. This provides optimal or best known algorithms for the type system, by a process of translating type equations to automata, solving the analogous problem, and translating the result back to type equations. Apart...

  15. Zeno's paradox in quantum cellular automata

    International Nuclear Information System (INIS)

    Groessing, G.; Zeilinger, A.

    1991-01-01

    The effect of Zeno's paradox in quantum theory is demonstrated with the aid of quantum mechanical cellular automata. It is shown that the degree of non-unitarity of the cellular automaton evolution and the frequency of consecutive measurements of cellular automaton states are operationally indistinguishable. (orig.)

  16. Zeno's paradox in quantum cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Groessing, G [Atominst. der Oesterreichischen Universitaeten, Vienna (Austria); Zeilinger, A [Inst. fuer Experimentalphysik, Univ. Innsbruck (Austria)

    1991-07-01

    The effect of Zeno's paradox in quantum theory is demonstrated with the aid of quantum mechanical cellular automata. It is shown that the degree of non-unitarity of the cellular automaton evolution and the frequency of consecutive measurements of cellular automaton states are operationally indistinguishable. (orig.).

  17. Monitoring with Data Automata

    Science.gov (United States)

    Havelund, Klaus

    2014-01-01

    We present a form of automaton, referred to as data automata, suited for monitoring sequences of data-carrying events, for example emitted by an executing software system. This form of automata allows states to be parameterized with data, forming named records, which are stored in an efficiently indexed data structure, a form of database. This very explicit approach differs from other automaton-based monitoring approaches. Data automata are also characterized by allowing transition conditions to refer to other parameterized states, and by allowing transitions sequences. The presented automaton concept is inspired by rule-based systems, especially the Rete algorithm, which is one of the well-established algorithms for executing rule-based systems. We present an optimized external DSL for data automata, as well as a comparable unoptimized internal DSL (API) in the Scala programming language, in order to compare the two solutions. An evaluation compares these two solutions to several other monitoring systems.

  18. Product interval automata

    Indian Academy of Sciences (India)

    M. Senthilkumar (Newgen Imaging) 1461 1996 Oct 15 13:05:22

    automata are expressive enough to model the timed behaviour of asynchronous .... F,G ⊆ Q are, respectively, the finitary and infinitary acceptance state sets. ...... 19th Foundations of Software Technology and Theoretical Computer Science ...

  19. Magnetohydrodynamics cellular automata

    International Nuclear Information System (INIS)

    Hatori, Tadatsugu.

    1990-02-01

    There has been a renewal of interest in cellular automata, partly because they give an architecture for a special purpose computer with parallel processing optimized to solve a particular problem. The lattice gas cellular automata are briefly surveyed, which are recently developed to solve partial differential equations such as hydrodynamics or magnetohydrodynamics. A new model is given in the present paper to implement the magnetic Lorentz force in a more deterministic and local procedure than the previous one. (author)

  20. Magnetohydrodynamic cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Hatori, Tadatsugu [National Inst. for Fusion Science, Nagoya (Japan)

    1990-03-01

    There has been a renewal of interest in cellular automata, partly because they give an architecture for a special purpose computer with parallel processing optimized to solve a particular problem. The lattice gas cellular automata are briefly surveyed, which are recently developed to solve partial differential equations such as hydrodynamics or magnetohydrodynamics. A new model is given in the present paper to implement the magnetic Lorentz force in a more deterministic and local procedure than the previous one. (author).

  1. Magnetohydrodynamic cellular automata

    International Nuclear Information System (INIS)

    Hatori, Tadatsugu

    1990-01-01

    There has been a renewal of interest in cellular automata, partly because they give an architecture for a special purpose computer with parallel processing optimized to solve a particular problem. The lattice gas cellular automata are briefly surveyed, which are recently developed to solve partial differential equations such as hydrodynamics or magnetohydrodynamics. A new model is given in the present paper to implement the magnetic Lorentz force in a more deterministic and local procedure than the previous one. (author)

  2. Confluence reduction for Markov automata

    NARCIS (Netherlands)

    Timmer, Mark; Katoen, Joost P.; van de Pol, Jaco; Stoelinga, Mariëlle Ida Antoinette

    2016-01-01

    Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. As expected, the state space explosion threatens the analysability of these models. We therefore introduce confluence reduction for Markov automata, a powerful reduction

  3. Extended Cellular Automata Models of Particles and Space-Time

    Science.gov (United States)

    Beedle, Michael

    2005-04-01

    Models of particles and space-time are explored through simulations and theoretical models that use Extended Cellular Automata models. The expanded Cellular Automata Models consist go beyond simple scalar binary cell-fields, into discrete multi-level group representations like S0(2), SU(2), SU(3), SPIN(3,1). The propagation and evolution of these expanded cellular automatas are then compared to quantum field theories based on the "harmonic paradigm" i.e. built by an infinite number of harmonic oscillators, and with gravitational models.

  4. Modelling Social-Technical Attacks with Timed Automata

    DEFF Research Database (Denmark)

    David, Nicolas; David, Alexandre; Hansen, Rene Rydhof

    2015-01-01

    . In this paper we develop an approach towards modelling socio-technical systems in general and socio-technical attacks in particular, using timed automata and illustrate its application by a complex case study. Thanks to automated model checking and automata theory, we can automatically generate possible attacks...... in our model and perform analysis and simulation of both model and attack, revealing details about the specific interaction between attacker and victim. Using timed automata also allows for intuitive modelling of systems, in which quantities like time and cost can be easily added and analysed....

  5. Finite automata over algebraic structures: models and some methods of analysis

    Directory of Open Access Journals (Sweden)

    Volodymyr V. Skobelev

    2015-10-01

    Full Text Available In this paper some results of research in two new trends of finite automata theory are presented. For understanding the value and the aim of these researches some short retrospective analysis of development of finite automata theory is given. The first trend deals with families of finite automata defined via recurrence relations on algebraic structures over finite rings. The problem of design of some algorithm that simulates with some accuracy any element of given family of automata is investigated. Some general scheme for design of families of hash functions defined by outputless automata is elaborated. Computational security of these families of hash functions is analyzed. Automata defined on varieties with some algebra are presented and their homomorphisms are characterized. Special case of these automata, namely automata on elliptic curves, are investigated in detail. The second trend deals with quantum automata. Languages accepted by some basic models of quantum automata under supposition that unitary operators associated with input alphabet commute each with the others are characterized.

  6. Surjective cellular automata with zero entropy are almost one-to-one

    International Nuclear Information System (INIS)

    Moothathu, T.K.S.

    2011-01-01

    Highlights: → We use information about maps with zero entropy from Ergodic Theory. → Surjective cellular automata with zero entropy are almost one-to-one. → Surjective, additive cellular automata with zero entropy are injective. - Abstract: We show that any one-dimensional surjective cellular automata whose entropy is zero with respect to the uniform Bernoulli measure must be almost one-to-one.

  7. Minimal entropy approximation for cellular automata

    International Nuclear Information System (INIS)

    Fukś, Henryk

    2014-01-01

    We present a method for the construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that is, construction of a probability measure consistent with given block probabilities and maximizing entropy. If instead of maximizing entropy one minimizes it, one can develop another method for the construction of approximate orbits, at the heart of which is the iteration of finite-dimensional maps, called minimal entropy maps. We present numerical evidence that the minimal entropy approximation sometimes outperforms the local structure theory in characterizing the properties of cellular automata. The density response curve for elementary CA rule 26 is used to illustrate this claim. (paper)

  8. Long-time tails of the velocity autocorrelation function in 2D and 3D lattice gas cellular automata: a test of mode-coupling theory

    NARCIS (Netherlands)

    Hoef, M.A. van der; Frenkel, D.

    1990-01-01

    We report simulations of the velocity autocorrelation function (VACF) of a tagged particle in two- and three-dimensional lattice-gas cellular automata, using a new technique that is about a million times more efficient than the conventional techniques. The simulations clearly show the algebraic

  9. Priced Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

    2004-01-01

    This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European...... projects VHS [22] and AMETIST [17] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [20,5] specialized for cost-optimal reachability for the extended model of priced timed automata....

  10. Virtual Stationary Automata for Mobile Networks

    National Research Council Canada - National Science Library

    Dolev, Shlomi; Gilbert, Seth; Lahiani, Limor; Lynch, Nancy; Nolte, Tina

    2005-01-01

    We define a programming abstraction for mobile networks called the Virtual Stationary Automata programming layer, consisting of real mobile clients, virtual timed I/O automata called virtual stationary automata (VSAs...

  11. Probabilistic cellular automata.

    Science.gov (United States)

    Agapie, Alexandru; Andreica, Anca; Giuclea, Marius

    2014-09-01

    Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involved to some degree in the transition rule, we speak of probabilistic automata, otherwise they are called deterministic. With either type of cellular automaton we are dealing with, the main theoretical challenge stays the same: starting from an arbitrary initial configuration, predict (with highest accuracy) the end configuration. If the automaton is deterministic, the outcome simplifies to one of two configurations, all zeros or all ones. If the automaton is probabilistic, the whole process is modeled by a finite homogeneous Markov chain, and the outcome is the corresponding stationary distribution. Based on our previous results for the asynchronous case-connecting the probability of a configuration in the stationary distribution to its number of zero-one borders-the article offers both numerical and theoretical insight into the long-term behavior of synchronous cellular automata.

  12. Data Automata in Scala

    Science.gov (United States)

    Havelund, Klaus

    2014-01-01

    The field of runtime verification has during the last decade seen a multitude of systems for monitoring event sequences (traces) emitted by a running system. The objective is to ensure correctness of a system by checking its execution traces against formal specifications representing requirements. A special challenge is data parameterized events, where monitors have to keep track of the combination of control states as well as data constraints, relating events and the data they carry across time points. This poses a challenge wrt. efficiency of monitors, as well as expressiveness of logics. Data automata is a form of automata where states are parameterized with data, supporting monitoring of data parameterized events. We describe the full details of a very simple API in the Scala programming language, an internal DSL (Domain-Specific Language), implementing data automata. The small implementation suggests a design pattern. Data automata allow transition conditions to refer to other states than the source state, and allow target states of transitions to be inlined, offering a temporal logic flavored notation. An embedding of a logic in a high-level language like Scala in addition allows monitors to be programmed using all of Scala's language constructs, offering the full flexibility of a programming language. The framework is demonstrated on an XML processing scenario previously addressed in related work.

  13. Automata, universality, computation tribute to Maurice Margenstern

    CERN Document Server

    2015-01-01

    This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation. World top experts in computer science and mathematics overview exciting and intriguing topics of logical theory of monoids, geometry of Gauss word, philosophy of mathematics in computer science, asynchronous and parallel P-systems, decidability in cellular automata, splicing systems, reversible Turing machines, information flows in two-way finite automata, prime generators in automaton arrays, Grossone and Turing machines, automaton models of atomic lattices. The book is  full of visually attractive examples of mathematical machines, open problems and challenges for future research. Those interested in the advancement of a theory of computation, philosophy of mathematics, future and emergent computing paradigms, architectures and implementations will find the book vital for their research and development.

  14. QM Automata: A New Class of Restricted Quantum Membrane Automata.

    Science.gov (United States)

    Giannakis, Konstantinos; Singh, Alexandros; Kastampolidou, Kalliopi; Papalitsas, Christos; Andronikos, Theodore

    2017-01-01

    The term "Unconventional Computing" describes the use of non-standard methods and models in computing. It is a recently established field, with many interesting and promising results. In this work we combine notions from quantum computing with aspects of membrane computing to define what we call QM automata. Specifically, we introduce a variant of quantum membrane automata that operate in accordance with the principles of quantum computing. We explore the functionality and capabilities of the QM automata through indicative examples. Finally we suggest future directions for research on QM automata.

  15. Designing beauty the art of cellular automata

    CERN Document Server

    Martínez, Genaro

    2016-01-01

    This fascinating, colourful book offers in-depth insights and first-hand working experiences in the production of art works, using simple computational models with rich morphological behaviour, at the edge of mathematics, computer science, physics and biology. It organically combines ground breaking scientific discoveries in the theory of computation and complex systems with artistic representations of the research results. In this appealing book mathematicians, computer scientists, physicists, and engineers brought together marvelous and esoteric patterns generated by cellular automata, which are arrays of simple machines with complex behavior. Configurations produced by cellular automata uncover mechanics of dynamic patterns formation, their propagation and interaction in natural systems: heart pacemaker, bacterial membrane proteins, chemical rectors, water permeation in soil, compressed gas, cell division, population dynamics, reaction-diffusion media and self-organisation. The book inspires artists to tak...

  16. Stochastic properties of disturbed Elementary Cellular Automata

    International Nuclear Information System (INIS)

    Posiewnik, M.

    2005-01-01

    Cellular automata are class of simple mathematical systems that generate diverse, often complicated behaviour. Evolution of such a system is given by set of local and deterministic rules. However, in spite of simplicity of 'interactions' it's global behaviour can't be, in general, simply predicted or even can not be predicted in time shorter that time of it's strict evolution. We get as, a systems well known 1-dimensional, Wolfram class automata, and connect it into the reservoir consists of some random source (noise). In our experiment we are interested in: a) numeric verification of ergodicity for such a coupled system. b) finding it's probability distribution and evolution. c) finding some analogous for 'real' quantities and behaviour. d) using the dynamical systems and Markov chains theory to describe the system, and to make any predictions of it's behaviour. (author)

  17. Compositions of (max, +) automata

    Czech Academy of Sciences Publication Activity Database

    Lahaye, S.; Komenda, Jan; Boimond, J.-L.

    2015-01-01

    Roč. 25, 1-2 (2015), s. 323-344 ISSN 0924-6703 R&D Projects: GA ČR(CZ) GAP103/11/0517 Institutional support: RVO:67985840 Keywords : (max,+) automata * synchronous product * asynchronous product Subject RIV: BA - General Mathematics Impact factor: 1.268, year: 2015 http://link.springer.com/article/10.1007/s10626-014-0186-6

  18. A compositional Translation of Stochastic Automata into Timed Automata

    NARCIS (Netherlands)

    d' Argenio, P.R.

    We present a translation from stochastic automata [17, 16] into timed automata with deadlines [37, 13]. The translation preserves traces when the stochastic characteristics, namely the probability measures, are abstracted from the original stochastic automaton. Moreover, we show that the translation

  19. Predictability in cellular automata.

    Science.gov (United States)

    Agapie, Alexandru; Andreica, Anca; Chira, Camelia; Giuclea, Marius

    2014-01-01

    Modelled as finite homogeneous Markov chains, probabilistic cellular automata with local transition probabilities in (0, 1) always posses a stationary distribution. This result alone is not very helpful when it comes to predicting the final configuration; one needs also a formula connecting the probabilities in the stationary distribution to some intrinsic feature of the lattice configuration. Previous results on the asynchronous cellular automata have showed that such feature really exists. It is the number of zero-one borders within the automaton's binary configuration. An exponential formula in the number of zero-one borders has been proved for the 1-D, 2-D and 3-D asynchronous automata with neighborhood three, five and seven, respectively. We perform computer experiments on a synchronous cellular automaton to check whether the empirical distribution obeys also that theoretical formula. The numerical results indicate a perfect fit for neighbourhood three and five, which opens the way for a rigorous proof of the formula in this new, synchronous case.

  20. Wavefront cellular learning automata.

    Science.gov (United States)

    Moradabadi, Behnaz; Meybodi, Mohammad Reza

    2018-02-01

    This paper proposes a new cellular learning automaton, called a wavefront cellular learning automaton (WCLA). The proposed WCLA has a set of learning automata mapped to a connected structure and uses this structure to propagate the state changes of the learning automata over the structure using waves. In the WCLA, after one learning automaton chooses its action, if this chosen action is different from the previous action, it can send a wave to its neighbors and activate them. Each neighbor receiving the wave is activated and must choose a new action. This structure for the WCLA is necessary in many dynamic areas such as social networks, computer networks, grid computing, and web mining. In this paper, we introduce the WCLA framework as an optimization tool with diffusion capability, study its behavior over time using ordinary differential equation solutions, and present its accuracy using expediency analysis. To show the superiority of the proposed WCLA, we compare the proposed method with some other types of cellular learning automata using two benchmark problems.

  1. Wavefront cellular learning automata

    Science.gov (United States)

    Moradabadi, Behnaz; Meybodi, Mohammad Reza

    2018-02-01

    This paper proposes a new cellular learning automaton, called a wavefront cellular learning automaton (WCLA). The proposed WCLA has a set of learning automata mapped to a connected structure and uses this structure to propagate the state changes of the learning automata over the structure using waves. In the WCLA, after one learning automaton chooses its action, if this chosen action is different from the previous action, it can send a wave to its neighbors and activate them. Each neighbor receiving the wave is activated and must choose a new action. This structure for the WCLA is necessary in many dynamic areas such as social networks, computer networks, grid computing, and web mining. In this paper, we introduce the WCLA framework as an optimization tool with diffusion capability, study its behavior over time using ordinary differential equation solutions, and present its accuracy using expediency analysis. To show the superiority of the proposed WCLA, we compare the proposed method with some other types of cellular learning automata using two benchmark problems.

  2. Weighted Watson-Crick automata

    Energy Technology Data Exchange (ETDEWEB)

    Tamrin, Mohd Izzuddin Mohd [Department of Information System, Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, 50728 Gombak, Selangor (Malaysia); Turaev, Sherzod; Sembok, Tengku Mohd Tengku [Department of Computer Science, Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, 50728 Gombak, Selangor (Malaysia)

    2014-07-10

    There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.

  3. Weighted Watson-Crick automata

    International Nuclear Information System (INIS)

    Tamrin, Mohd Izzuddin Mohd; Turaev, Sherzod; Sembok, Tengku Mohd Tengku

    2014-01-01

    There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power

  4. A Cellular Automata-Based Simulation Tool for Real Fire Accident Prevention

    Directory of Open Access Journals (Sweden)

    Jacek M. Czerniak

    2018-01-01

    Full Text Available Many serious real-life problems could be simulated using cellular automata theory. There were a lot of fires in public places which kill many people. Proposed method, called Cellular Automata Evaluation (CAEva in short, is using cellular automata theory and could be used for checking buildings conditions for fire accident. The tests performed on real accident showed that an appropriately configured program allows obtaining a realistic simulation of human evacuation. The authors analyze some real accidents and proved that CAEva method appears as a very promising solution, especially in the cases of building renovations or temporary unavailability of escape routes.

  5. Multipebble Simulations for Alternating Automata

    Science.gov (United States)

    Clemente, Lorenzo; Mayr, Richard

    We study generalized simulation relations for alternating Büchi automata (ABA), as well as alternating finite automata. Having multiple pebbles allows the Duplicator to "hedge her bets" and delay decisions in the simulation game, thus yielding a coarser simulation relation. We define (k 1,k 2)-simulations, with k 1/k 2 pebbles on the left/right, respectively. This generalizes previous work on ordinary simulation (i.e., (1,1)-simulation) for nondeterministic Büchi automata (NBA)[4] in and ABA in [5], and (1,k)-simulation for NBA in [3].

  6. Global properties of cellular automata

    International Nuclear Information System (INIS)

    Jen, E.

    1986-01-01

    Cellular automata are discrete mathematical systems that generate diverse, often complicated, behavior using simple deterministic rules. Analysis of the local structure of these rules makes possible a description of the global properties of the associated automata. A class of cellular automata that generate infinitely many aperoidic temporal sequences is defined,a s is the set of rules for which inverses exist. Necessary and sufficient conditions are derived characterizing the classes of ''nearest-neighbor'' rules for which arbitrary finite initial conditions (i) evolve to a homogeneous state; (ii) generate at least one constant temporal sequence

  7. Height-Deterministic Pushdown Automata

    DEFF Research Database (Denmark)

    Nowotka, Dirk; Srba, Jiri

    2007-01-01

    We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of height-deterministic pushdown automata, strictly containing the class...... of regular languages and still closed under boolean language operations, are considered. Several of such language classes have been described in the literature. Here, we suggest a natural and intuitive model that subsumes all the formalisms proposed so far by employing height-deterministic pushdown automata...

  8. Energy Games in Multiweighted Automata

    DEFF Research Database (Denmark)

    Fahrenberg, U.; Juhl, L.; Larsen, Kim Guldstrand

    2011-01-01

    Energy games have recently attracted a lot of attention. These are games played on finite weighted automata and concern the existence of infinite runs subject to boundary constraints on the accumulated weight, allowing e.g only for behaviours where a resource is always available (nonnegative...... accumulated weight), yet does not exceed a given maximum capacity. We extend energy games to a multiweighted and parameterized setting, allowing us to model systems with multiple quantitative aspects. We present reductions between Petri nets and multiweighted automata and among different types...... of multiweighted automata and identify new complexity and (un)decidability results for both one- and two-player games. We also investigate the tractability of an extension of multiweighted energy games in the setting of timed automata....

  9. Confluence reduction for Markov automata

    NARCIS (Netherlands)

    Timmer, Mark; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette

    Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models

  10. Confluence Reduction for Markov Automata

    NARCIS (Netherlands)

    Timmer, Mark; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette; Braberman, Victor; Fribourg, Laurent

    Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models

  11. Deterministic Automata for Unordered Trees

    Directory of Open Access Journals (Sweden)

    Adrien Boiret

    2014-08-01

    Full Text Available Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficiently. In this paper, we propose and investigate different notions of "horizontal determinism", starting from automata for unranked trees in which the horizontal evaluation is performed by finite state automata. We show that a restriction to confluent horizontal evaluation leads to polynomial-time emptiness and universality, but still suffers from coNP-completeness of the emptiness of binary intersections. Finally, efficient algorithms can be obtained by imposing an order of horizontal evaluation globally for all automata in the class. Depending on the choice of the order, we obtain different classes of automata, each of which has the same expressiveness as CMso.

  12. Automata and concurrency

    Energy Technology Data Exchange (ETDEWEB)

    Priese, L

    1983-07-01

    The author presents a precise notion of a realization (or simulation) of one concurrent system by another, and studies the relations of modular concurrent systems and non-persistent (i.e. With conflicts) concurrent systems in an automata theoretical style. He introduces a conception of realization that obeys three requirements: it allows for proper hierarchies in certain classes of concurrent systems; it allows for normal-form theorems, and the standard constructions of the literature remain realizations in formal concept; and it clarifies some counterintuitive examples. Further, although this realization conception is developed to translate the computational aspects of concurrent systems, it also gives a formal tool for the handling of synchronization problems. 38 references.

  13. Spin networks, quantum automata and link invariants

    International Nuclear Information System (INIS)

    Garnerone, Silvano; Marzuoli, Annalisa; Rasetti, Mario

    2006-01-01

    The spin network simulator model represents a bridge between (generalized) circuit schemes for standard quantum computation and approaches based on notions from Topological Quantum Field Theories (TQFT). More precisely, when working with purely discrete unitary gates, the simulator is naturally modelled as families of quantum automata which in turn represent discrete versions of topological quantum computation models. Such a quantum combinatorial scheme, which essentially encodes SU(2) Racah-Wigner algebra and its braided counterpart, is particularly suitable to address problems in topology and group theory and we discuss here a finite states-quantum automaton able to accept the language of braid group in view of applications to the problem of estimating link polynomials in Chern-Simons field theory

  14. Subsequence Automata with Default Transitions

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Skjoldjensen, Frederik Rye

    2016-01-01

    of states and transitions) of the subsequence automaton is O(nσ) and that this bound is asymptotically optimal. In this paper, we consider subsequence automata with default transitions, that is, special transitions to be taken only if none of the regular transitions match the current character, and which do...... not consume the current character. We show that with default transitions, much smaller subsequence automata are possible, and provide a full trade-off between the size of the automaton and the delay, i.e., the maximum number of consecutive default transitions followed before consuming a character......(nσ) and delay O(1), thus matching the bound for the standard subsequence automaton construction. The key component of our result is a novel hierarchical automata construction of independent interest....

  15. Subsequence automata with default transitions

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Skjoldjensen, Frederik Rye

    2017-01-01

    of states and transitions) of the subsequence automaton is O(nσ) and that this bound is asymptotically optimal. In this paper, we consider subsequence automata with default transitions, that is, special transitions to be taken only if none of the regular transitions match the current character, and which do...... not consume the current character. We show that with default transitions, much smaller subsequence automata are possible, and provide a full trade-off between the size of the automaton and the delay, i.e., the maximum number of consecutive default transitions followed before consuming a character......(1), thus matching the bound for the standard subsequence automaton construction. Finally, we generalize the result to multiple strings. The key component of our result is a novel hierarchical automata construction of independent interest....

  16. Beyond Language Equivalence on Visibly Pushdown Automata

    DEFF Research Database (Denmark)

    Srba, Jiri

    2009-01-01

    We study (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied...... preorders and equivalences like simulation, completed simulation, ready simulation, 2-nested simulation preorders/equivalences and bisimulation equivalence. Our main results are that all the mentioned equivalences and preorders are EXPTIME-complete on visibly pushdown automata, PSPACE-complete on visibly...... one-counter automata and P-complete on visibly BPA. Our PSPACE lower bound for visibly one-counter automata improves also the previously known DP-hardness results for ordinary one-counter automata and one-counter nets. Finally, we study regularity checking problems for visibly pushdown automata...

  17. Mitochondrial fusion through membrane automata.

    Science.gov (United States)

    Giannakis, Konstantinos; Andronikos, Theodore

    2015-01-01

    Studies have shown that malfunctions in mitochondrial processes can be blamed for diseases. However, the mechanism behind these operations is yet not sufficiently clear. In this work we present a novel approach to describe a biomolecular model for mitochondrial fusion using notions from the membrane computing. We use a case study defined in BioAmbient calculus and we show how to translate it in terms of a P automata variant. We combine brane calculi with (mem)brane automata to produce a new scheme capable of describing simple, realistic models. We propose the further use of similar methods and the test of other biomolecular models with the same behaviour.

  18. Is there a sharp phase transition for deterministic cellular automata?

    International Nuclear Information System (INIS)

    Wootters, W.K.

    1990-01-01

    Previous work has suggested that there is a kind of phase transition between deterministic automata exhibiting periodic behavior and those exhibiting chaotic behavior. However, unlike the usual phase transitions of physics, this transition takes place over a range of values of the parameter rather than at a specific value. The present paper asks whether the transition can be made sharp, either by taking the limit of an infinitely large rule table, or by changing the parameter in terms of which the space of automata is explored. We find strong evidence that, for the class of automata we consider, the transition does become sharp in the limit of an infinite number of symbols, the size of the neighborhood being held fixed. Our work also suggests an alternative parameter in terms of which it is likely that the transition will become fairly sharp even if one does not increase the number of symbols. In the course of our analysis, we find that mean field theory, which is our main tool, gives surprisingly good predictions of the statistical properties of the class of automata we consider. 18 refs., 6 figs

  19. Complex Automata: Multi-scale Modeling with Coupled Cellular Automata

    NARCIS (Netherlands)

    Hoekstra, A.G.; Caiazzo, A.; Lorenz, E.; Falcone, J.-L.; Chopard, B.; Hoekstra, A.G.; Kroc, J.; Sloot, P.M.A.

    2010-01-01

    Cellular Automata (CA) are generally acknowledged to be a powerful way to describe and model natural phenomena [1-3]. There are even tempting claims that nature itself is one big (quantum) information processing system, e.g. [4], and that CA may actually be nature’s way to do this processing [5-7].

  20. Relating timed and register automata

    Directory of Open Access Journals (Sweden)

    Diego Figueira

    2010-11-01

    Full Text Available Timed automata and register automata are well-known models of computation over timed and data words respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can store data values for later comparison. Although these two models behave in appearance differently, several decision problems have the same (undecidability and complexity results for both models. As a prominent example, emptiness is decidable for alternating automata with one clock or register, both with non-primitive recursive complexity. This is not by chance. This work confirms that there is indeed a tight relationship between the two models. We show that a run of a timed automaton can be simulated by a register automaton, and conversely that a run of a register automaton can be simulated by a timed automaton. Our results allow to transfer complexity and decidability results back and forth between these two kinds of models. We justify the usefulness of these reductions by obtaining new results on register automata.

  1. Cellular Automata and the Humanities.

    Science.gov (United States)

    Gallo, Ernest

    1994-01-01

    The use of cellular automata to analyze several pre-Socratic hypotheses about the evolution of the physical world is discussed. These hypotheses combine characteristics of both rigorous and metaphoric language. Since the computer demands explicit instructions for each step in the evolution of the automaton, such models can reveal conceptual…

  2. Cluster Statistics of BTW Automata

    International Nuclear Information System (INIS)

    Ajanta Bhowal Acharyya

    2011-01-01

    The cluster statistics of BTW automata in the SOC states are obtained by extensive computer simulation. Various moments of the clusters are calculated and few results are compared with earlier available numerical estimates and exact results. Reasonably good agreement is observed. An extended statistical analysis has been made. (author)

  3. Cellular automata in image processing and geometry

    CERN Document Server

    Adamatzky, Andrew; Sun, Xianfang

    2014-01-01

    The book presents findings, views and ideas on what exact problems of image processing, pattern recognition and generation can be efficiently solved by cellular automata architectures. This volume provides a convenient collection in this area, in which publications are otherwise widely scattered throughout the literature. The topics covered include image compression and resizing; skeletonization, erosion and dilation; convex hull computation, edge detection and segmentation; forgery detection and content based retrieval; and pattern generation. The book advances the theory of image processing, pattern recognition and generation as well as the design of efficient algorithms and hardware for parallel image processing and analysis. It is aimed at computer scientists, software programmers, electronic engineers, mathematicians and physicists, and at everyone who studies or develops cellular automaton algorithms and tools for image processing and analysis, or develops novel architectures and implementations of mass...

  4. Outer-totalistic cellular automata on graphs

    International Nuclear Information System (INIS)

    Marr, Carsten; Huett, Marc-Thorsten

    2009-01-01

    We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically sensitive elementary cellular automata and find that the overall number of complex patterns decreases under increasing neighborhood size in regular graphs. As exemplary applications, we apply the formalism to complex networks and compare the potential of scale-free graphs and metabolic networks to generate complex dynamics

  5. Multi-head Watson-Crick automata

    OpenAIRE

    Chatterjee, Kingshuk; Ray, Kumar Sankar

    2015-01-01

    Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to Watson-Crick complementarity relation. We establish the superiority of our model over multi-head finite automata and also show that both the deterministic and non-determinis...

  6. On Nonlinear Prices in Timed Automata

    Directory of Open Access Journals (Sweden)

    Devendra Bhave

    2016-12-01

    Full Text Available Priced timed automata provide a natural model for quantitative analysis of real-time systems and have been successfully applied in various scheduling and planning problems. The optimal reachability problem for linearly-priced timed automata is known to be PSPACE-complete. In this paper we investigate priced timed automata with more general prices and show that in the most general setting the optimal reachability problem is undecidable. We adapt and implement the construction of Audemard, Cimatti, Kornilowicz, and Sebastiani for non-linear priced timed automata using state-of-the-art theorem prover Z3 and present some preliminary results.

  7. Construction of fuzzy automata by fuzzy experiments

    International Nuclear Information System (INIS)

    Mironov, A.

    1994-01-01

    The solving the problem of canonical realization of partial reaction morphisms (PRM) for automata in toposes and fuzzy automata is addressed. This problem extends the optimal construction problem for finite deterministic automata by experiments. In the present paper the conception of canonical realization of PRM for automata in toposes is introduced and the sufficient conditions for the existence of canonical realizations for PRM in toposes are presented. As a consequence of this result the existence of canonical realizations for PRM in the category of fuzzy sets over arbitrary complete chain is proven

  8. Construction of fuzzy automata by fuzzy experiments

    Energy Technology Data Exchange (ETDEWEB)

    Mironov, A [Moscow Univ. (Russian Federation). Dept. of Mathematics and Computer Science

    1994-12-31

    The solving the problem of canonical realization of partial reaction morphisms (PRM) for automata in toposes and fuzzy automata is addressed. This problem extends the optimal construction problem for finite deterministic automata by experiments. In the present paper the conception of canonical realization of PRM for automata in toposes is introduced and the sufficient conditions for the existence of canonical realizations for PRM in toposes are presented. As a consequence of this result the existence of canonical realizations for PRM in the category of fuzzy sets over arbitrary complete chain is proven.

  9. Linear Parametric Model Checking of Timed Automata

    DEFF Research Database (Denmark)

    Hune, Tohmas Seidelin; Romijn, Judi; Stoelinga, Mariëlle

    2001-01-01

    We present an extension of the model checker Uppaal capable of synthesize linear parameter constraints for the correctness of parametric timed automata. The symbolic representation of the (parametric) state-space is shown to be correct. A second contribution of this paper is the identication...... of a subclass of parametric timed automata (L/U automata), for which the emptiness problem is decidable, contrary to the full class where it is know to be undecidable. Also we present a number of lemmas enabling the verication eort to be reduced for L/U automata in some cases. We illustrate our approach...

  10. Universal map for cellular automata

    International Nuclear Information System (INIS)

    García-Morales, V.

    2012-01-01

    A universal map is derived for all deterministic 1D cellular automata (CAs) containing no freely adjustable parameters and valid for any alphabet size and any neighborhood range (including non-symmetrical neighborhoods). The map can be extended to an arbitrary number of dimensions and topologies and to arbitrary order in time. Specific CA maps for the famous Conway's Game of Life and Wolfram's 256 elementary CAs are given. An induction method for CAs, based in the universal map, allows mathematical expressions for the orbits of a wide variety of elementary CAs to be systematically derived. -- Highlights: ► A universal map is derived for all deterministic 1D cellular automata (CA). ► The map is generalized to 2D for Von Neumann, Moore and hexagonal neighborhoods. ► A map for all Wolfram's 256 elementary CAs is derived. ► A map for Conway's “Game of Life” is obtained.

  11. Simulating physics with cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Vichniac, G Y

    1984-01-01

    Cellular automata are dynamical systems where space, time, and variables are discrete. They are shown on two-dimensional examples to be capable of non-numerical simulations of physics. They are useful for faithful parallel processing of lattice models. At another level, they exhibit behaviours and illustrate concepts that are unmistakably physical, such as non-ergodicity and order parameters, frustration, relaxation to chaos through period doublings, a conspicuous arrow of time in reversible microscopic dynamics, causality and light-cone, and non-separability. In general, they constitute exactly computable models for complex phenomena and large-scale correlations that result from very simple short-range interactions. The author studies their space, time, and intrinsic symmetries and the corresponding conservation laws, with an emphasis on the conservation of information obeyed by reversible cellular automata. 60 references.

  12. Bounded-oscillation Pushdown Automata

    Directory of Open Access Journals (Sweden)

    Pierre Ganty

    2016-09-01

    Full Text Available We present an underapproximation for context-free languages by filtering out runs of the underlying pushdown automaton depending on how the stack height evolves over time. In particular, we assign to each run a number quantifying the oscillating behavior of the stack along the run. We study languages accepted by pushdown automata restricted to k-oscillating runs. We relate oscillation on pushdown automata with a counterpart restriction on context-free grammars. We also provide a way to filter all but the k-oscillating runs from a given PDA by annotating stack symbols with information about the oscillation. Finally, we study closure properties of the defined class of languages and the complexity of the k-emptiness problem asking, given a pushdown automaton P and k >= 0, whether P has a k-oscillating run. We show that, when k is not part of the input, the k-emptiness problem is NLOGSPACE-complete.

  13. Cellular automata with voting rule

    International Nuclear Information System (INIS)

    Makowiec, D.

    1996-01-01

    The chosen local interaction - the voting (majority) rule applied to the square lattice is known to cause the non ergodic cellular automata behaviour. Presented computer simulation results verify two cases of non ergodicity. The first one is implicated by the noise introduced to the local interactions and the second one follows properties of the initial lattice configuration selected at random. For the simplified voting rule - non symmetric voting, the critical behaviour has been explained rigorously. (author)

  14. Information Flow for Timed Automata

    DEFF Research Database (Denmark)

    Nielson, Flemming; Nielson, Hanne Riis; Vasilikos, Panagiotis

    2017-01-01

    One of the key demands of cyberphysical systems is that they meet their safety goals. Timed Automata has established itself as a formalism for modelling and analysing the real-time safety aspects of cyberphysical systems. Increasingly it is also demanded that cyberphysical systems meet a number o...... of security goals for confidentiality and integrity. Information Flow Control is an approach to ensuring that there are no flows of information that violate the stated security policy....

  15. Graph Cellular Automata with Relation-Based Neighbourhoods of Cells for Complex Systems Modelling: A Case of Traffic Simulation

    Directory of Open Access Journals (Sweden)

    Krzysztof Małecki

    2017-12-01

    Full Text Available A complex system is a set of mutually interacting elements for which it is possible to construct a mathematical model. This article focuses on the cellular automata theory and the graph theory in order to compare various types of cellular automata and to analyse applications of graph structures together with cellular automata. It proposes a graph cellular automaton with a variable configuration of cells and relation-based neighbourhoods (r–GCA. The developed mechanism enables modelling of phenomena found in complex systems (e.g., transport networks, urban logistics, social networks taking into account the interaction between the existing objects. As an implementation example, modelling of moving vehicles has been made and r–GCA was compared to the other cellular automata models simulating the road traffic and used in the computer simulation process.

  16. On Elementary and Algebraic Cellular Automata

    Science.gov (United States)

    Gulak, Yuriy

    In this paper we study elementary cellular automata from an algebraic viewpoint. The goal is to relate the emergent complex behavior observed in such systems with the properties of corresponding algebraic structures. We introduce algebraic cellular automata as a natural generalization of elementary ones and discuss their applications as generic models of complex systems.

  17. Team Automata for Security (A Survey)

    NARCIS (Netherlands)

    ter Beek, Maurice H.; Lenzini, Gabriele; Petrocchi, Marinella

    Kleijn presented a survey of the use of team automata for the specification and analysis of phenomena from the field of computer supported cooperative work, in particular notions related to groupware systems. We present a survey of the use of team automata for the specification and analysis of some

  18. Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information.

    Science.gov (United States)

    Liu, Desheng; Huang, Zhiping; Zhang, Yimeng; Guo, Xiaojun; Su, Shaojing

    2016-01-01

    Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of deterministic finite automatons (DFAs). A minimization algorithm is presented in this paper that consists of two main phases. In the first phase, the backward depth information is built, and the state set of the DFA is partitioned into many blocks. In the second phase, the state set is refined using a hash table. The minimization algorithm has a lower time complexity O(n) than a naive comparison of transitions O(n2). Few states need to be refined by the hash table, because most states have been partitioned by the backward depth information in the coarse partition. This method achieves greater generality than previous methods because building the backward depth information is independent of the topological complexity of the DFA. The proposed algorithm can be applied not only to the minimization of acyclic automata or simple cyclic automata, but also to automata with high topological complexity. Overall, the proposal has three advantages: lower time complexity, greater generality, and scalability. A comparison to Hopcroft's algorithm demonstrates experimentally that the algorithm runs faster than traditional algorithms.

  19. Symmetry analysis of cellular automata

    International Nuclear Information System (INIS)

    García-Morales, V.

    2013-01-01

    By means of B-calculus [V. García-Morales, Phys. Lett. A 376 (2012) 2645] a universal map for deterministic cellular automata (CAs) has been derived. The latter is shown here to be invariant upon certain transformations (global complementation, reflection and shift). When constructing CA rules in terms of rules of lower range a new symmetry, “invariance under construction” is uncovered. Modular arithmetic is also reformulated within B-calculus and a new symmetry of certain totalistic CA rules, which calculate the Pascal simplices modulo an integer number p, is then also uncovered.

  20. On two integrable cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Bobenko, A [Technische Univ. Berlin (Germany). Fachbereich Mathematik; Bordemann, M [Freiburg Univ. (Germany). Fachbereich Physik; Gunn, C [Technische Univ. Berlin (Germany). Fachbereich Mathematik; Pinkall, U [Technische Univ. Berlin (Germany). Fachbereich Mathematik

    1993-11-01

    We describe two simple cellular automata (CA) models which exhibit the essential attributes of soliton systems. The first one is an invertible, 2-state, 1-dimensional CA or, in other words, a nonlinear Z[sub 2]-valued dynamical system with discrete space and time. Against a vacuum state of 0, the system exhibits light cone particles in both spatial directions, which interact in a soliton-like fashion. A complete solution of this system is obtained. We also consider another CA, which is described by the Hirota equation over a finite field, and present a Lax representation for it. (orig.)

  1. Cellular automata a parallel model

    CERN Document Server

    Mazoyer, J

    1999-01-01

    Cellular automata can be viewed both as computational models and modelling systems of real processes. This volume emphasises the first aspect. In articles written by leading researchers, sophisticated massive parallel algorithms (firing squad, life, Fischer's primes recognition) are treated. Their computational power and the specific complexity classes they determine are surveyed, while some recent results in relation to chaos from a new dynamic systems point of view are also presented. Audience: This book will be of interest to specialists of theoretical computer science and the parallelism challenge.

  2. Chaotic behavior in the disorder cellular automata

    International Nuclear Information System (INIS)

    Ko, J.-Y.; Hung, Y.-C.; Ho, M.-C.; Jiang, I-M.

    2008-01-01

    Disordered cellular automata (DCA) represent an intermediate class between elementary cellular automata and the Kauffman network. Recently, Rule 126 of DCA has been explicated: the system can be accurately described by a discrete probability function. However, a means of extending to other rules has not been developed. In this investigation, a density map of the dynamical behavior of DCA is formulated based on Rule 22 and other totalistic rules. The numerical results reveal excellent agreement between the model and original automata. Furthermore, the inhomogeneous situation is also discussed

  3. Distribution functions of probabilistic automata

    Science.gov (United States)

    Vatan, F.

    2001-01-01

    Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.

  4. Boundary Induced Phase Transition in Cellular Automata Models of Pedestrian Flow

    Czech Academy of Sciences Publication Activity Database

    Bukáček, M.; Hrabák, Pavel

    2016-01-01

    Roč. 11, č. 4 (2016), s. 327-338 ISSN 1557-5969 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Adaptive time-span * Cellular automata model * Floor-field * Pedestrian flow * Phase transition * Principle of bonds Subject RIV: BD - Theory of Information Impact factor: 0.696, year: 2016

  5. Applications of automata and graphs: Labeling operators in Hilbert space. II

    International Nuclear Information System (INIS)

    Cho, Ilwoo; Jorgensen, Palle E. T.

    2009-01-01

    We introduced a family of infinite graphs directly associated with a class of von Neumann automaton model A G . These are finite state models used in symbolic dynamics: stimuli models and in control theory. In the context of groupoid von Neumann algebras, and an associated fractal group, we prove a classification theorem for representations of automata.

  6. On the use of spin glass concepts in random automata networks

    Energy Technology Data Exchange (ETDEWEB)

    Miranda, E N; Parga, N

    1988-06-01

    We apply concepts and techniques developed in the context of the mean-field theory of spin glasses to networks of random automata. This approach, proposed recently by Derrida and Flyvbjerg, may be useful in understanding the multivalley structure of the Kauffman model.

  7. Formal languages, automata and numeration systems introduction to combinatorics on words

    CERN Document Server

    Rigo, Michel

    2014-01-01

    Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory). Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidabl

  8. Timed Safety Automata and Logic Conformance

    National Research Council Canada - National Science Library

    Young, Frank

    1999-01-01

    Timed Logic Conformance (TLC) is used to verify the behavioral and timing properties of detailed digital circuits against abstract circuit specifications when both are modeled as Timed Safety Automata (TSA...

  9. Random networks of Boolean cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Miranda, Enrique [Comision Nacional de Energia Atomica, San Carlos de Bariloche (Argentina). Centro Atomico Bariloche

    1990-01-01

    Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author).

  10. Cellular automata and statistical mechanical models

    International Nuclear Information System (INIS)

    Rujan, P.

    1987-01-01

    The authors elaborate on the analogy between the transfer matrix of usual lattice models and the master equation describing the time development of cellular automata. Transient and stationary properties of probabilistic automata are linked to surface and bulk properties, respectively, of restricted statistical mechanical systems. It is demonstrated that methods of statistical physics can be successfully used to describe the dynamic and the stationary behavior of such automata. Some exact results are derived, including duality transformations, exact mappings, disorder, and linear solutions. Many examples are worked out in detail to demonstrate how to use statistical physics in order to construct cellular automata with desired properties. This approach is considered to be a first step toward the design of fully parallel, probabilistic systems whose computational abilities rely on the cooperative behavior of their components

  11. Random networks of Boolean cellular automata

    International Nuclear Information System (INIS)

    Miranda, Enrique

    1990-01-01

    Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)

  12. Systolic automata for VLSI on balanced trees

    Energy Technology Data Exchange (ETDEWEB)

    Culik, K Ii; Gruska, J; Salomaa, A

    1983-01-01

    Systolic tree automata with a binary (or, more generally, balanced) underlying tree are investigated. The main emphasis is on input conditions, decidability, and characterization of acceptable languages. 4 references.

  13. Reaction-Diffusion Automata Phenomenology, Localisations, Computation

    CERN Document Server

    Adamatzky, Andrew

    2013-01-01

    Reaction-diffusion and excitable media are amongst most intriguing substrates. Despite apparent simplicity of the physical processes involved the media exhibit a wide range of amazing patterns: from target and spiral waves to travelling localisations and stationary breathing patterns. These media are at the heart of most natural processes, including morphogenesis of living beings, geological formations, nervous and muscular activity, and socio-economic developments.   This book explores a minimalist paradigm of studying reaction-diffusion and excitable media using locally-connected networks of finite-state machines: cellular automata and automata on proximity graphs. Cellular automata are marvellous objects per se because they show us how to generate and manage complexity using very simple rules of dynamical transitions. When combined with the reaction-diffusion paradigm the cellular automata become an essential user-friendly tool for modelling natural systems and designing future and emergent computing arch...

  14. Confluence reduction for Markov automata (extended version)

    NARCIS (Netherlands)

    Timmer, Mark; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette

    Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models

  15. Computing aggregate properties of preimages for 2D cellular automata.

    Science.gov (United States)

    Beer, Randall D

    2017-11-01

    Computing properties of the set of precursors of a given configuration is a common problem underlying many important questions about cellular automata. Unfortunately, such computations quickly become intractable in dimension greater than one. This paper presents an algorithm-incremental aggregation-that can compute aggregate properties of the set of precursors exponentially faster than naïve approaches. The incremental aggregation algorithm is demonstrated on two problems from the two-dimensional binary Game of Life cellular automaton: precursor count distributions and higher-order mean field theory coefficients. In both cases, incremental aggregation allows us to obtain new results that were previously beyond reach.

  16. Formal languages, automata and numeration systems, v.2

    CERN Document Server

    Rigo, Michel

    2014-01-01

    The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from t

  17. Hierarchy among Automata on Linear Orderings

    OpenAIRE

    Bruyère , Véronique; Carton , Olivier

    2005-01-01

    In a preceding paper, automata and rational expressions have been introduced for words indexed by linear orderings, together with a Kleene-like theorem. We here pursue this work by proposing a hierarchy among the rational sets. Each class of the hierarchy is defined by a subset of the rational operations that can be used. We then characterize any class by an appropriate class of automata, leading to a Kleene theorem inside the class. A characterization by particular classes of orderings is al...

  18. Linear System Control Using Stochastic Learning Automata

    Science.gov (United States)

    Ziyad, Nigel; Cox, E. Lucien; Chouikha, Mohamed F.

    1998-01-01

    This paper explains the use of a Stochastic Learning Automata (SLA) to control switching between three systems to produce the desired output response. The SLA learns the optimal choice of the damping ratio for each system to achieve a desired result. We show that the SLA can learn these states for the control of an unknown system with the proper choice of the error criteria. The results of using a single automaton are compared to using multiple automata.

  19. Control of Petri Nets by finite automata

    Energy Technology Data Exchange (ETDEWEB)

    Burkhard, H D

    1983-01-01

    Petri Nets are considered where the firings are controlled by finite automata. The control may be distributed to various automata working over disjoint sets of transitions. To avoid deadlocks and conflicts for the whole system the distribution of control must be organised in an appropriate manner. The existence of deadlocks and conflicts is shown to be undecidable in general, but conflict resolving and deadlock free controls can be constructed for given nets. 10 references.

  20. The Theory of Timed IO Automata

    CERN Document Server

    Kaynar, Dilsun; Segala, Roberto

    2010-01-01

    This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range of domains including communications, embedded systems, real-time operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability req

  1. Cells as strain-cued automata

    Science.gov (United States)

    Cox, Brian N.; Snead, Malcolm L.

    2016-02-01

    We argue in favor of representing living cells as automata and review demonstrations that autonomous cells can form patterns by responding to local variations in the strain fields that arise from their individual or collective motions. An autonomous cell's response to strain stimuli is assumed to be effected by internally-generated, internally-powered forces, which generally move the cell in directions other than those implied by external energy gradients. Evidence of cells acting as strain-cued automata have been inferred from patterns observed in nature and from experiments conducted in vitro. Simulations that mimic particular cases of pattern forming share the idealization that cells are assumed to pass information among themselves solely via mechanical boundary conditions, i.e., the tractions and displacements present at their membranes. This assumption opens three mechanisms for pattern formation in large cell populations: wavelike behavior, kinematic feedback in cell motility that can lead to sliding and rotational patterns, and directed migration during invasions. Wavelike behavior among ameloblast cells during amelogenesis (the formation of dental enamel) has been inferred from enamel microstructure, while strain waves in populations of epithelial cells have been observed in vitro. One hypothesized kinematic feedback mechanism, "enhanced shear motility", accounts successfully for the spontaneous formation of layered patterns during amelogenesis in the mouse incisor. Directed migration is exemplified by a theory of invader cells that sense and respond to the strains they themselves create in the host population as they invade it: analysis shows that the strain fields contain positional information that could aid the formation of cell network structures, stabilizing the slender geometry of branches and helping govern the frequency of branch bifurcation and branch coalescence (the formation of closed networks). In simulations of pattern formation in

  2. Multi-scale modeling with cellular automata: The complex automata approach

    NARCIS (Netherlands)

    Hoekstra, A.G.; Falcone, J.-L.; Caiazzo, A.; Chopard, B.

    2008-01-01

    Cellular Automata are commonly used to describe complex natural phenomena. In many cases it is required to capture the multi-scale nature of these phenomena. A single Cellular Automata model may not be able to efficiently simulate a wide range of spatial and temporal scales. It is our goal to

  3. Cellular automata in cytoskeletal lattices

    Energy Technology Data Exchange (ETDEWEB)

    Smith, S A; Watt, R C; Hameroff, S R

    1984-01-01

    Cellular automata (CA) activities could mediate biological regulation and information processing via nonlinear electrodynamic effects in cytoskeletal lattice arrays. Frohlich coherent oscillations and other nonlinear mechanisms may effect discrete 10/sup -10/ to 10/sup -11/ s interval events which result in dynamic patterns in biolattices such as cylindrical protein polymers: microtubules (MT). Structural geometry and electrostatic forces of MT subunit dipole oscillations suggest neighbor rules among the hexagonally packed protein subunits. Computer simulations using these suggested rules and MT structural geometry demonstrate CA activities including dynamical and stable self-organizing patterns, oscillators, and traveling gliders. CA activities in MT and other cytoskeletal lattices may have important biological regulatory functions. 23 references, 6 figures, 1 table.

  4. Fuzzy automata and pattern matching

    Science.gov (United States)

    Setzer, C. B.; Warsi, N. A.

    1986-01-01

    A wide-ranging search for articles and books concerned with fuzzy automata and syntactic pattern recognition is presented. A number of survey articles on image processing and feature detection were included. Hough's algorithm is presented to illustrate the way in which knowledge about an image can be used to interpret the details of the image. It was found that in hand generated pictures, the algorithm worked well on following the straight lines, but had great difficulty turning corners. An algorithm was developed which produces a minimal finite automaton recognizing a given finite set of strings. One difficulty of the construction is that, in some cases, this minimal automaton is not unique for a given set of strings and a given maximum length. This algorithm compares favorably with other inference algorithms. More importantly, the algorithm produces an automaton with a rigorously described relationship to the original set of strings that does not depend on the algorithm itself.

  5. Non deterministic finite automata for power systems fault diagnostics

    Directory of Open Access Journals (Sweden)

    LINDEN, R.

    2009-06-01

    Full Text Available This paper introduces an application based on finite non-deterministic automata for power systems diagnosis. Automata for the simpler faults are presented and the proposed system is compared with an established expert system.

  6. Iterons, fractals and computations of automata

    Science.gov (United States)

    Siwak, Paweł

    1999-03-01

    Processing of strings by some automata, when viewed on space-time (ST) diagrams, reveals characteristic soliton-like coherent periodic objects. They are inherently associated with iterations of automata mappings thus we call them the iterons. In the paper we present two classes of one-dimensional iterons: particles and filtrons. The particles are typical for parallel (cellular) processing, while filtrons, introduced in (32) are specific for serial processing of strings. In general, the images of iterated automata mappings exhibit not only coherent entities but also the fractals, and quasi-periodic and chaotic dynamics. We show typical images of such computations: fractals, multiplication by a number, and addition of binary numbers defined by a Turing machine. Then, the particles are presented as iterons generated by cellular automata in three computations: B/U code conversion (13, 29), majority classification (9), and in discrete version of the FPU (Fermi-Pasta-Ulam) dynamics (7, 23). We disclose particles by a technique of combinational recoding of ST diagrams (as opposed to sequential recoding). Subsequently, we recall the recursive filters based on FCA (filter cellular automata) window operators, and considered by Park (26), Ablowitz (1), Fokas (11), Fuchssteiner (12), Bruschi (5) and Jiang (20). We present the automata equivalents to these filters (33). Some of them belong to the class of filter automata introduced in (30). We also define and illustrate some properties of filtrons. Contrary to particles, the filtrons interact nonlocally in the sense that distant symbols may influence one another. Thus their interactions are very unusual. Some examples have been given in (32). Here we show new examples of filtron phenomena: multifiltron solitonic collisions, attracting and repelling filtrons, trapped bouncing filtrons (which behave like a resonance cavity) and quasi filtrons.

  7. An algorithm for learning real-time automata

    NARCIS (Netherlands)

    Verwer, S.E.; De Weerdt, M.M.; Witteveen, C.

    2007-01-01

    We describe an algorithm for learning simple timed automata, known as real-time automata. The transitions of real-time automata can have a temporal constraint on the time of occurrence of the current symbol relative to the previous symbol. The learning algorithm is similar to the redblue fringe

  8. Surface Dynamic Process Simulation with the Use of Cellular Automata

    International Nuclear Information System (INIS)

    Adamska-Szatko, M.; Bala, J.

    2010-01-01

    Cellular automata are known for many applications, especially for physical and biological simulations. Universal cellular automata can be used for modelling complex natural phenomena. The paper presents simulation of surface dynamic process. Simulation uses 2-dimensional cellular automata algorithm. Modelling and visualisation were created by in-house developed software with standard OpenGL graphic library. (authors)

  9. A cryptosystem based on elementary cellular automata

    Science.gov (United States)

    Abdo, A. A.; Lian, Shiguo; Ismail, I. A.; Amin, M.; Diab, H.

    2013-01-01

    Based on elementary cellular automata, a new image encryption algorithm is proposed in this paper. In this algorithm, a special kind of periodic boundary cellular automata with unity attractors is used. From the viewpoint of security, the number of cellular automata attractor states are changed with respect to the encrypted image, and different key streams are used to encrypt different plain images. The cellular neural network with chaotic properties is used as the generator of a pseudo-random key stream. Theoretical analysis and experimental results have both confirmed that the proposed algorithm possesses high security level and good performances against differential and statistical attacks. The comparison with other existing schemes is given, which shows the superiority of the proposal scheme.

  10. Cellular-automata method for phase unwrapping

    International Nuclear Information System (INIS)

    Ghiglia, D.C.; Mastin, G.A.; Romero, L.A.

    1987-01-01

    Research into two-dimensional phase unwrapping has uncovered interesting and troublesome inconsistencies that cause path-dependent results. Cellular automata, which are simple, discrete mathematical systems, offered promise of computation in nondirectional, parallel manner. A cellular automaton was discovered that can unwrap consistent phase data in n dimensions in a path-independent manner and can automatically accommodate noise-induced (pointlike) inconsistencies and arbitrary boundary conditions (region partitioning). For data with regional (nonpointlike) inconsistencies, no phase-unwrapping algorithm will converge, including the cellular-automata approach. However, the automata method permits more simple visualization of the regional inconsistencies. Examples of its behavior on one- and two-dimensional data are presented

  11. Cyclic cellular automata in 3D

    International Nuclear Information System (INIS)

    Reiter, Clifford A.

    2011-01-01

    Highlights: → We explore the self-organization of cyclic cellular automata in 3D. → Von Neumann, Moore and two types of intermediate neighborhoods are investigated. → Random neighborhoods self organize through phases into complex nested structures. → Demons are seen to have many alternatives in 3D. - Abstract: Cyclic cellular automata in two dimensions have long been intriguing because they self organize into spirals and that behavior can be analyzed. The form for the patterns that develop is highly dependent upon the form of the neighborhood. We extend this work to three dimensional cyclic cellular automata and observe self organization dependent upon the neighborhood type. This includes neighborhood types intermediate between Von Neumann and Moore neighborhoods. We also observe that the patterns include nested shells with the appropriate forms but that the nesting is far more complex than the spirals that occur in two dimensions.

  12. Automata Techniques for Epistemic Protocol Synthesis

    Directory of Open Access Journals (Sweden)

    Guillaume Aucher

    2014-04-01

    Full Text Available In this work we aim at applying automata techniques to problems studied in Dynamic Epistemic Logic, such as epistemic planning. To do so, we first remark that repeatedly executing ad infinitum a propositional event model from an initial epistemic model yields a relational structure that can be finitely represented with automata. This correspondence, together with recent results on uniform strategies, allows us to give an alternative decidability proof of the epistemic planning problem for propositional events, with as by-products accurate upper-bounds on its time complexity, and the possibility to synthesize a finite word automaton that describes the set of all solution plans. In fact, using automata techniques enables us to solve a much more general problem, that we introduce and call epistemic protocol synthesis.

  13. Geometrical automata for two phase flow simulation

    International Nuclear Information System (INIS)

    Herrero, V.; Guido-Lavalle, G.; Clausse, A.

    1996-01-01

    An automaton is an entity defined by a mathematical state which changes following iterative rules representing the interaction with the neighborhood. A model of automata for two-phase flow simulation consisting in a field of disks which are allowed to change their radii and move in a plane is presented. The model is more general than the classical cellular automata in two respects: (1) the grid of cellular automata is dismissed in favor of a trajectory generator; and (2) the rules of interaction involve parameters intended to represent some of the most relevant variables governing the actual physical interactions between phases. Computational experiments show that the algorithm captures the essential physics underlying two-phase flow problems such as bubbly-slug pattern transition and void fraction development along tubes. A comparison with experimental data of void fraction profiles is presented, showing excellent agreement. (orig.)

  14. Computing Distances between Probabilistic Automata

    Directory of Open Access Journals (Sweden)

    Mathieu Tracol

    2011-07-01

    Full Text Available We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA, that allow some error epsilon. When epsilon is zero we retrieve the usual notions of bisimulation and simulation on PAs. We give logical characterisations of these notions by choosing suitable logics which differ from the elementary ones, L with negation and L without negation, by the modal operator. Using flow networks, we show how to compute the relations in PTIME. This allows the definition of an efficiently computable non-discounted distance between the states of a PA. A natural modification of this distance is introduced, to obtain a discounted distance, which weakens the influence of long term transitions. We compare our notions of distance to others previously defined and illustrate our approach on various examples. We also show that our distance is not expansive with respect to process algebra operators. Although L without negation is a suitable logic to characterise epsilon-(bisimulation on deterministic PAs, it is not for general PAs; interestingly, we prove that it does characterise weaker notions, called a priori epsilon-(bisimulation, which we prove to be NP-difficult to decide.

  15. Importance Sampling for Stochastic Timed Automata

    DEFF Research Database (Denmark)

    Jegourel, Cyrille; Larsen, Kim Guldstrand; Legay, Axel

    2016-01-01

    We present an importance sampling framework that combines symbolic analysis and simulation to estimate the probability of rare reachability properties in stochastic timed automata. By means of symbolic exploration, our framework first identifies states that cannot reach the goal. A state-wise cha......We present an importance sampling framework that combines symbolic analysis and simulation to estimate the probability of rare reachability properties in stochastic timed automata. By means of symbolic exploration, our framework first identifies states that cannot reach the goal. A state...

  16. Optimal scheduling using priced timed automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

    2005-01-01

    This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European...... projects VHS [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata....

  17. Execution spaces for simple higher dimensional automata

    DEFF Research Database (Denmark)

    Raussen, Martin

    2012-01-01

    Higher dimensional automata (HDA) are highly expressive models for concurrency in Computer Science, cf van Glabbeek (Theor Comput Sci 368(1–2): 168–194, 2006). For a topologist, they are attractive since they can be modeled as cubical complexes—with an inbuilt restriction for directions of allowa......Higher dimensional automata (HDA) are highly expressive models for concurrency in Computer Science, cf van Glabbeek (Theor Comput Sci 368(1–2): 168–194, 2006). For a topologist, they are attractive since they can be modeled as cubical complexes—with an inbuilt restriction for directions...

  18. From Orchestration to Choreography through Contract Automata

    Directory of Open Access Journals (Sweden)

    Davide Basile

    2014-10-01

    Full Text Available We study the relations between a contract automata and an interaction model. In the former model, distributed services are abstracted away as automata - oblivious of their partners - that coordinate with each other through an orchestrator. The interaction model relies on channel-based asynchronous communication and choreography to coordinate distributed services. We define a notion of strong agreement on the contract model, exhibit a natural mapping from the contract model to the interaction model, and give conditions to ensure that strong agreement corresponds to well-formed choreography.

  19. Cellular Automata Simulation for Wealth Distribution

    Science.gov (United States)

    Lo, Shih-Ching

    2009-08-01

    Wealth distribution of a country is a complicate system. A model, which is based on the Epstein & Axtell's "Sugars cape" model, is presented in Netlogo. The model considers the income, age, working opportunity and salary as control variables. There are still other variables should be considered while an artificial society is established. In this study, a more complicate cellular automata model for wealth distribution model is proposed. The effects of social welfare, tax, economical investment and inheritance are considered and simulated. According to the cellular automata simulation for wealth distribution, we will have a deep insight of financial policy of the government.

  20. From equilibrium spin models to probabilistic cellular automata

    International Nuclear Information System (INIS)

    Georges, A.; Le Doussal, P.

    1989-01-01

    The general equivalence between D-dimensional probabilistic cellular automata (PCA) and (D + 1)-dimensional equilibrium spin models satisfying a disorder condition is first described in a pedagogical way and then used to analyze the phase diagrams, the critical behavior, and the universality classes of some automato. Diagrammatic representations of time-dependent correlation functions PCA are introduced. Two important classes of PCA are singled out for which these correlation functions simplify: (1) Quasi-Hamiltonian automata, which have a current-carrying steady state, and for which some correlation functions are those of a D-dimensional static model PCA satisfying the detailed balance condition appear as a particular case of these rules for which the current vanishes. (2) Linear (and more generally affine) PCA for which the diagrammatics reduces to a random walk problem closely related to (D + 1)-dimensional directed SAWs: both problems display a critical behavior with mean-field exponents in any dimension. The correlation length and effective velocity of propagation of excitations can be calculated for affine PCA, as is shown on an explicit D = 1 example. The authors conclude with some remarks on nonlinear PCA, for which the diagrammatics is related to reaction-diffusion processes, and which belong in some cases to the universality class of Reggeon field theory

  1. Complexity Theory

    Science.gov (United States)

    Lee, William H K.

    2016-01-01

    A complex system consists of many interacting parts, generates new collective behavior through self organization, and adaptively evolves through time. Many theories have been developed to study complex systems, including chaos, fractals, cellular automata, self organization, stochastic processes, turbulence, and genetic algorithms.

  2. A cellular automata model for ant trails

    Indian Academy of Sciences (India)

    In this study, the unidirectional ant traffic flow with U-turn in an ant trail was investigated using one-dimensional cellular automata model. It is known that ants communicate with each other by dropping a chemical, called pheromone, on the substrate. Apart from the studies in the literature, it was considered in the model that ...

  3. Additive Cellular Automata and Volume Growth

    Directory of Open Access Journals (Sweden)

    Thomas B. Ward

    2000-08-01

    Full Text Available Abstract: A class of dynamical systems associated to rings of S-integers in rational function fields is described. General results about these systems give a rather complete description of the well-known dynamics in one-dimensional additive cellular automata with prime alphabet, including simple formulæ for the topological entropy and the number of periodic configurations. For these systems the periodic points are uniformly distributed along some subsequence with respect to the maximal measure, and in particular are dense. Periodic points may be constructed arbitrarily close to a given configuration, and rationality of the dynamical zeta function is characterized. Throughout the emphasis is to place this particular family of cellular automata into the wider context of S-integer dynamical systems, and to show how the arithmetic of rational function fields determines their behaviour. Using a covering space the dynamics of additive cellular automata are related to a form of hyperbolicity in completions of rational function fields. This expresses the topological entropy of the automata directly in terms of volume growth in the covering space.

  4. Weak MSO: automata and expressiveness modulo bisimilarity

    NARCIS (Netherlands)

    Carreiro, F.; Facchini, A.; Venema, Y.; Zanasi, F.

    2014-01-01

    We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal μ-calculus where the application of the least fixpoint operator μp.φ is restricted to formulas φ that are continuous in p. Our proof is automata-theoretic in nature;

  5. Blackhole State-Controlled Regulated Pushdown Automata

    NARCIS (Netherlands)

    E. Csuhaj-Varju; T. Masopust (Tomas); G. Vaszil (György); H. Bordihn; R. Freund; T. Hinze; M. Holzer; M. Kutrib; F. Otto

    2010-01-01

    textabstractIn this paper, we introduce and study a variant of regulated pushdown automata, called blackhole state-controlled R-PDA where a symbol can always be pushed to the pushdown, but only a given depth of the pushdown contents is remembered; the rest of the pushdown contents is lost. In

  6. Random complex automata: Analogy with spin glasses

    International Nuclear Information System (INIS)

    Flyvbjerg, H.

    1986-12-01

    Ab initio properties of random networks of automata have been studied statistically. A strikingly high degree of similarity is demonstrated between the multivalley structure of the basins of attraction of Kauffman's model and that of infinite range spin glasses. Results from simulations as well as exact analytical results are presented. (orig.)

  7. Building finite automata from DI specifications

    NARCIS (Netherlands)

    Udding, J.T

    1998-01-01

    Numerous formalisms exist to specify delay-insensitive computations and their implementations. It is not always straightforward to compare specifications in the different formalisms. One way of comparing specifications is transforming them to automata in which nodes are annotated with progress

  8. Stretching and jamming of finite automata

    NARCIS (Netherlands)

    Beijer, de N.; Kourie, D.G.; Watson, B.W.; Cleophas, L.G.W.A.; Watson, B.W.

    2004-01-01

    In this paper we present two transformations on automata, called stretching and jamming. These transformations will, under certain conditions, reduce the size of the transition table, and under other conditions reduce the string processing time. Given a finite automaton, we can stretch it by

  9. Cellular automata machines as physics emulators

    International Nuclear Information System (INIS)

    Toffoli, T.

    1988-01-01

    Can one design a computer optimized to be a physics emulator rather than a software interpreter? Cellular automata are discrete dynamical systems whose behavior is completely specified in terms of a local relation, much as is the case for a large class of continuous dynamical systems defined by partial differential equations. 31 refs, 3 figs

  10. On Probabilistic Automata in Continuous Time

    DEFF Research Database (Denmark)

    Eisentraut, Christian; Hermanns, Holger; Zhang, Lijun

    2010-01-01

    We develop a compositional behavioural model that integrates a variation of probabilistic automata into a conservative extension of interactive Markov chains. The model is rich enough to embody the semantics of generalised stochastic Petri nets. We define strong and weak bisimulations and discuss...

  11. Bisimulations Meet PCTL Equivalences for Probabilistic Automata

    DEFF Research Database (Denmark)

    Song, Lei; Zhang, Lijun; Godskesen, Jens Chr.

    2011-01-01

    Probabilistic automata (PA) [20] have been successfully applied in the formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on PCTL [11] and its extension PCTL∗ [4...

  12. Fuzzy cellular automata models in immunology

    International Nuclear Information System (INIS)

    Ahmed, E.

    1996-01-01

    The self-nonself character of antigens is considered to be fuzzy. The Chowdhury et al. cellular automata model is generalized accordingly. New steady states are found. The first corresponds to a below-normal help and suppression and is proposed to be related to autoimmune diseases. The second corresponds to a below-normal B-cell level

  13. Maximizing the Adjacent Possible in Automata Chemistries.

    Science.gov (United States)

    Hickinbotham, Simon; Clark, Edward; Nellis, Adam; Stepney, Susan; Clarke, Tim; Young, Peter

    2016-01-01

    Automata chemistries are good vehicles for experimentation in open-ended evolution, but they are by necessity complex systems whose low-level properties require careful design. To aid the process of designing automata chemistries, we develop an abstract model that classifies the features of a chemistry from a physical (bottom up) perspective and from a biological (top down) perspective. There are two levels: things that can evolve, and things that cannot. We equate the evolving level with biology and the non-evolving level with physics. We design our initial organisms in the biology, so they can evolve. We design the physics to facilitate evolvable biologies. This architecture leads to a set of design principles that should be observed when creating an instantiation of the architecture. These principles are Everything Evolves, Everything's Soft, and Everything Dies. To evaluate these ideas, we present experiments in the recently developed Stringmol automata chemistry. We examine the properties of Stringmol with respect to the principles, and so demonstrate the usefulness of the principles in designing automata chemistries.

  14. Execution spaces for simple higher dimensional automata

    DEFF Research Database (Denmark)

    Raussen, Martin

    Higher Dimensional Automata (HDA) are highly expressive models for concurrency in Computer Science, cf van Glabbeek [26]. For a topologist, they are attractive since they can be modeled as cubical complexes - with an inbuilt restriction for directions´of allowable (d-)paths. In Raussen [25], we...

  15. Bisimulations meet PCTL equivalences for probabilistic automata

    DEFF Research Database (Denmark)

    Song, Lei; Zhang, Lijun; Godskesen, Jens Chr.

    2013-01-01

    Probabilistic automata (PAs) have been successfully applied in formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on probabilistic computation tree logic (PCTL) and its...

  16. Fuzzy tree automata and syntactic pattern recognition.

    Science.gov (United States)

    Lee, E T

    1982-04-01

    An approach of representing patterns by trees and processing these trees by fuzzy tree automata is described. Fuzzy tree automata are defined and investigated. The results include that the class of fuzzy root-to-frontier recognizable ¿-trees is closed under intersection, union, and complementation. Thus, the class of fuzzy root-to-frontier recognizable ¿-trees forms a Boolean algebra. Fuzzy tree automata are applied to processing fuzzy tree representation of patterns based on syntactic pattern recognition. The grade of acceptance is defined and investigated. Quantitative measures of ``approximate isosceles triangle,'' ``approximate elongated isosceles triangle,'' ``approximate rectangle,'' and ``approximate cross'' are defined and used in the illustrative examples of this approach. By using these quantitative measures, a house, a house with high roof, and a church are also presented as illustrative examples. In addition, three fuzzy tree automata are constructed which have the capability of processing the fuzzy tree representations of ``fuzzy houses,'' ``houses with high roofs,'' and ``fuzzy churches,'' respectively. The results may have useful applications in pattern recognition, image processing, artificial intelligence, pattern database design and processing, image science, and pictorial information systems.

  17. Efficient Modelling and Generation of Markov Automata

    NARCIS (Netherlands)

    Koutny, M.; Timmer, Mark; Ulidowski, I.; Katoen, Joost P.; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette

    This paper introduces a framework for the efficient modelling and generation of Markov automata. It consists of (1) the data-rich process-algebraic language MAPA, allowing concise modelling of systems with nondeterminism, probability and Markovian timing; (2) a restricted form of the language, the

  18. Two Phase Flow Simulation Using Cellular Automata

    International Nuclear Information System (INIS)

    Marcel, C.P.

    2002-01-01

    The classical mathematical treatment of two-phase flows is based on the average of the conservation equations for each phase.In this work, a complementary approach to the modeling of these systems based on statistical population balances of aut omata sets is presented.Automata are entities defined by mathematical states that change following iterative rules representing interactions with the neighborhood.A model of automata for two-phase flow simulation is presented.This model consists of fie lds of virtual spheres that change their volumes and move around a certain environment.The model is more general than the classical cellular automata in two respects: the grid of cellular automata is dismissed in favor of a trajectory generator, and the rules of interaction involve parameters representing the actual physical interactions between phases.Automata simulation was used to study unsolved two-phase flow problems involving high heat flux rates. One system described in this work consists of a vertical channel with saturated water at normal pressure heated from the lower surface.The heater causes water to boil and starts the bubble production.We used cellular automata to describe two-phase flows and the interaction with the heater.General rule s for such cellular automata representing bubbles moving in stagnant liquid were used, with special attention to correct modeling of different mechanisms of heat transfer.The results of the model were compared to previous experiments and correlations finding good agreement.One of the most important findings is the confirmation of Kutateladze's idea about a close relation between the start of critical heat flux and a change in the flow's topology.This was analyzed using a control volume located in the upper surface of the heater.A strong decrease in the interfacial surface just before the CHF start was encountered.The automata describe quite well some characteristic parameters such as the shape of the local void fraction in the

  19. Finding and defining the natural automata acting in living plants: Toward the synthetic biology for robotics and informatics in vivo.

    Science.gov (United States)

    Kawano, Tomonori; Bouteau, François; Mancuso, Stefano

    2012-11-01

    The automata theory is the mathematical study of abstract machines commonly studied in the theoretical computer science and highly interdisciplinary fields that combine the natural sciences and the theoretical computer science. In the present review article, as the chemical and biological basis for natural computing or informatics, some plants, plant cells or plant-derived molecules involved in signaling are listed and classified as natural sequential machines (namely, the Mealy machines or Moore machines) or finite state automata. By defining the actions (states and transition functions) of these natural automata, the similarity between the computational data processing and plant decision-making processes became obvious. Finally, their putative roles as the parts for plant-based computing or robotic systems are discussed.

  20. Solving multiconstraint assignment problems using learning automata.

    Science.gov (United States)

    Horn, Geir; Oommen, B John

    2010-02-01

    This paper considers the NP-hard problem of object assignment with respect to multiple constraints: assigning a set of elements (or objects) into mutually exclusive classes (or groups), where the elements which are "similar" to each other are hopefully located in the same class. The literature reports solutions in which the similarity constraint consists of a single index that is inappropriate for the type of multiconstraint problems considered here and where the constraints could simultaneously be contradictory. This feature, where we permit possibly contradictory constraints, distinguishes this paper from the state of the art. Indeed, we are aware of no learning automata (or other heuristic) solutions which solve this problem in its most general setting. Such a scenario is illustrated with the static mapping problem, which consists of distributing the processes of a parallel application onto a set of computing nodes. This is a classical and yet very important problem within the areas of parallel computing, grid computing, and cloud computing. We have developed four learning-automata (LA)-based algorithms to solve this problem: First, a fixed-structure stochastic automata algorithm is presented, where the processes try to form pairs to go onto the same node. This algorithm solves the problem, although it requires some centralized coordination. As it is desirable to avoid centralized control, we subsequently present three different variable-structure stochastic automata (VSSA) algorithms, which have superior partitioning properties in certain settings, although they forfeit some of the scalability features of the fixed-structure algorithm. All three VSSA algorithms model the processes as automata having first the hosting nodes as possible actions; second, the processes as possible actions; and, third, attempting to estimate the process communication digraph prior to probabilistically mapping the processes. This paper, which, we believe, comprehensively reports the

  1. Jahn-Teller effect in molecular electronics: quantum cellular automata

    Science.gov (United States)

    Tsukerblat, B.; Palii, A.; Clemente-Juan, J. M.; Coronado, E.

    2017-05-01

    The article summarizes the main results of application of the theory of the Jahn-Teller (JT) and pseudo JT effects to the description of molecular quantum dot cellular automata (QCA), a new paradigm of quantum computing. The following issues are discussed: 1) QCA as a new paradigm of quantum computing, principles and advantages; 2) molecular implementation of QCA; 3) role of the JT effect in charge trapping, encoding of binary information in the quantum cell and non-linear cell-cell response; 4) spin-switching in molecular QCA based on mixed-valence cell; 5) intervalence optical absorption in tetrameric molecular mixed-valence cell through the symmetry assisted approach to the multimode/multilevel JT and pseudo JT problems.

  2. Restarting Automata with Auxiliary Symbols and Small Lookahead

    DEFF Research Database (Denmark)

    Schluter, Natalie Elaine

    2012-01-01

    We present a study on lookahead hierarchies for restarting automata with auxiliary symbols and small lookahead. In particular, we show that there are just two different classes of languages recognised by RRWW automata, through the restriction of lookahead size. We also show that the respective...... (left-) monotone restarting automaton models characterise the context-free languages and that the respective right-left-monotone restarting automata characterise the linear languages both with just lookahead length 2....

  3. Cellular-automata supercomputers for fluid-dynamics modeling

    International Nuclear Information System (INIS)

    Margolus, N.; Toffoli, T.; Vichniac, G.

    1986-01-01

    We report recent developments in the modeling of fluid dynamics, and give experimental results (including dynamical exponents) obtained using cellular automata machines. Because of their locality and uniformity, cellular automata lend themselves to an extremely efficient physical realization; with a suitable architecture, an amount of hardware resources comparable to that of a home computer can achieve (in the simulation of cellular automata) the performance of a conventional supercomputer

  4. Observability of Automata Networks: Fixed and Switching Cases.

    Science.gov (United States)

    Li, Rui; Hong, Yiguang; Wang, Xingyuan

    2018-04-01

    Automata networks are a class of fully discrete dynamical systems, which have received considerable interest in various different areas. This brief addresses the observability of automata networks and switched automata networks in a unified framework, and proposes simple necessary and sufficient conditions for observability. The results are achieved by employing methods from symbolic computation, and are suited for implementation using computer algebra systems. Several examples are presented to demonstrate the application of the results.

  5. On Determinism and Unambiguity of Weighted Two-way Automata

    Directory of Open Access Journals (Sweden)

    Vincent Carnino

    2014-05-01

    Full Text Available In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism. Yet, we prove that the conversion of an unambiguous weighted one-way automaton into a two-way automaton leads to a deterministic two-way automaton. As a consequence, we prove that unambiguous weighted two-way automata are equivalent to deterministic weighted two-way automata in commutative semirings.

  6. Nonsynchronous updating in the multiverse of cellular automata

    Science.gov (United States)

    Reia, Sandro M.; Kinouchi, Osame

    2015-04-01

    In this paper we study updating effects on cellular automata rule space. We consider a subset of 6144 order-3 automata from the space of 262144 bidimensional outer-totalistic rules. We compare synchronous to asynchronous and sequential updatings. Focusing on two automata, we discuss how update changes destroy typical structures of these rules. Besides, we show that the first-order phase transition in the multiverse of synchronous cellular automata, revealed with the use of a recently introduced control parameter, seems to be robust not only to changes in update schema but also to different initial densities.

  7. Nonsynchronous updating in the multiverse of cellular automata.

    Science.gov (United States)

    Reia, Sandro M; Kinouchi, Osame

    2015-04-01

    In this paper we study updating effects on cellular automata rule space. We consider a subset of 6144 order-3 automata from the space of 262144 bidimensional outer-totalistic rules. We compare synchronous to asynchronous and sequential updatings. Focusing on two automata, we discuss how update changes destroy typical structures of these rules. Besides, we show that the first-order phase transition in the multiverse of synchronous cellular automata, revealed with the use of a recently introduced control parameter, seems to be robust not only to changes in update schema but also to different initial densities.

  8. Recursive definition of global cellular-automata mappings

    International Nuclear Information System (INIS)

    Feldberg, R.; Knudsen, C.; Rasmussen, S.

    1994-01-01

    A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set of fixed points of cellular automata on an infinite lattice

  9. Optimised determinisation and completion of finite tree automata

    DEFF Research Database (Denmark)

    Gallagher, John Patrick; Ajspur, Mai; Kafle, Bishoksan

    2018-01-01

    Determinisation and completion of finite tree automata are important operations with applications in program analysis and verification. However, the complexity of the classical procedures for determinisation and completion is high. They are not practical procedures for manipulating tree automata...... beyond very small ones. In this paper we develop an algorithm for determinisation and completion of finite tree automata, whose worst-case complexity remains unchanged, but which performs far better than existing algorithms in practice. The critical aspect of the algorithm is that the transitions...... an experimental evaluation of the algorithm on a large set of tree automata examples....

  10. Automata Learning through Counterexample Guided Abstraction Refinement

    DEFF Research Database (Denmark)

    Aarts, Fides; Heidarian, Faranak; Kuppens, Harco

    2012-01-01

    to a small set of abstract events that can be handled by automata learning tools. In this article, we show how such abstractions can be constructed fully automatically for a restricted class of extended finite state machines in which one can test for equality of data parameters, but no operations on data...... are allowed. Our approach uses counterexample-guided abstraction refinement: whenever the current abstraction is too coarse and induces nondeterministic behavior, the abstraction is refined automatically. Using Tomte, a prototype tool implementing our algorithm, we have succeeded to learn – fully......Abstraction is the key when learning behavioral models of realistic systems. Hence, in most practical applications where automata learning is used to construct models of software components, researchers manually define abstractions which, depending on the history, map a large set of concrete events...

  11. Simulation of earthquakes with cellular automata

    Directory of Open Access Journals (Sweden)

    P. G. Akishin

    1998-01-01

    Full Text Available The relation between cellular automata (CA models of earthquakes and the Burridge–Knopoff (BK model is studied. It is shown that the CA proposed by P. Bak and C. Tang,although they have rather realistic power spectra, do not correspond to the BK model. We present a modification of the CA which establishes the correspondence with the BK model.An analytical method of studying the evolution of the BK-like CA is proposed. By this method a functional quadratic in stress release, which can be regarded as an analog of the event energy, is constructed. The distribution of seismic events with respect to this “energy” shows rather realistic behavior, even in two dimensions. Special attention is paid to two-dimensional automata; the physical restrictions on compression and shear stiffnesses are imposed.

  12. Secure information release in timed automata

    DEFF Research Database (Denmark)

    Vasilikos, Panagiotis; Nielson, Flemming; Nielson, Hanne Riis

    2018-01-01

    . In this paper, we develop a formal approach of information flow for timed automata that allows intentional information leaks. The security of a timed automaton is then defined using a bisimulation relation that takes account of the non-determinism and the clocks of timed automata. Finally, we define...... of security goals for confidentiality and integrity. Notions of security based on Information flow control, such as non-interference, provide strong guarantees that no information is leaked; however, many cyberphysical systems leak intentionally some information in order to achieve their purposes...... an algorithm that traverses a timed automaton and imposes information flow constraints on it and we prove that our algorithm is sound with respect to our security notion....

  13. The linearity of quantum mechanics from the perspective of Hamiltonian cellular automata

    International Nuclear Information System (INIS)

    Enrico Fermi, Università di Pisa, Largo Pontecorvo 3, I-56127 Pisa (Italy))" data-affiliation=" (Dipartimento di Fisica Enrico Fermi, Università di Pisa, Largo Pontecorvo 3, I-56127 Pisa (Italy))" >Elze, Hans-Thomas

    2014-01-01

    We discuss the action principle and resulting Hamiltonian equations of motion for a class of integer-valued cellular automata introduced recently [1]. Employing sampling theory, these deterministic finite-difference equations are mapped reversibly on continuum equations describing a set of bandwidth limited harmonic oscillators. They represent the Schrödinger equation. However, modifications reflecting the bandwidth limit are incorporated, i.e., the presence of a time (or length) scale. When this discreteness scale is taken to zero, the usual results are obtained. Thus, the linearity of quantum mechanics can be traced to the postulated action principle of such cellular automata and its conservation laws to discrete ones. The cellular automaton conservation laws are in one-to-one correspondence with those of the related quantum mechanical model, while admissible symmetries are not.

  14. Cellular automata in photonic cavity arrays.

    Science.gov (United States)

    Li, Jing; Liew, T C H

    2016-10-31

    We propose theoretically a photonic Turing machine based on cellular automata in arrays of nonlinear cavities coupled with artificial gauge fields. The state of the system is recorded making use of the bistability of driven cavities, in which losses are fully compensated by an external continuous drive. The sequential update of the automaton layers is achieved automatically, by the local switching of bistable states, without requiring any additional synchronization or temporal control.

  15. How to detect integrability in cellular automata

    International Nuclear Information System (INIS)

    Joshi, N; Lafortune, S

    2005-01-01

    Ultra-discrete equations are generalized cellular automata in the sense that the dependent (and independent) variables take only integer values. We present a new method for identifying integrable ultra-discrete equations which is the equivalent of the singularity confinement property for difference equations and the Painleve property for differential equations. Using this criterion, we find integrable ultra-discrete equations which include the ultra-discrete Painleve equations. (letter to the editor)

  16. Probabilistic cellular automata: Some statistical mechanical considerations

    International Nuclear Information System (INIS)

    Lebowitz, J.L.; Maes, C.; Speer, E.R.

    1990-01-01

    Spin systems evolving in continuous or discrete time under the action of stochastic dynamics are used to model phenomena as diverse as the structure of alloys and the functioning of neural networks. While in some cases the dynamics are secondary, designed to produce a specific stationary measure whose properties one is interested in studying, there are other cases in which the only available information is the dynamical rule. Prime examples of the former are computer simulations, via Glauber dynamics, of equilibrium Gibbs measures with a specified interaction potential. Examples of the latter include various types of majority rule dynamics used as models for pattern recognition and for error-tolerant computations. The present note discusses ways in which techniques found useful in equilibrium statistical mechanics can be applied to a particular class of models of the latter types. These are cellular automata with noise: systems in which the spins are updated stochastically at integer times, simultaneously at all sites of some regular lattice. These models were first investigated in detail in the Soviet literature of the late sixties and early seventies. They are now generally referred to as Stochastic or Probabilistic Cellular Automata (PCA), and may be considered to include deterministic automata (CA) as special limits. 16 refs., 3 figs

  17. Modeling biological pathway dynamics with timed automata.

    Science.gov (United States)

    Schivo, Stefano; Scholma, Jetse; Wanders, Brend; Urquidi Camacho, Ricardo A; van der Vet, Paul E; Karperien, Marcel; Langerak, Rom; van de Pol, Jaco; Post, Janine N

    2014-05-01

    Living cells are constantly subjected to a plethora of environmental stimuli that require integration into an appropriate cellular response. This integration takes place through signal transduction events that form tightly interconnected networks. The understanding of these networks requires capturing their dynamics through computational support and models. ANIMO (analysis of Networks with Interactive Modeling) is a tool that enables the construction and exploration of executable models of biological networks, helping to derive hypotheses and to plan wet-lab experiments. The tool is based on the formalism of Timed Automata, which can be analyzed via the UPPAAL model checker. Thanks to Timed Automata, we can provide a formal semantics for the domain-specific language used to represent signaling networks. This enforces precision and uniformity in the definition of signaling pathways, contributing to the integration of isolated signaling events into complex network models. We propose an approach to discretization of reaction kinetics that allows us to efficiently use UPPAAL as the computational engine to explore the dynamic behavior of the network of interest. A user-friendly interface hides the use of Timed Automata from the user, while keeping the expressive power intact. Abstraction to single-parameter kinetics speeds up construction of models that remain faithful enough to provide meaningful insight. The resulting dynamic behavior of the network components is displayed graphically, allowing for an intuitive and interactive modeling experience.

  18. Decentralized indirect methods for learning automata games.

    Science.gov (United States)

    Tilak, Omkar; Martin, Ryan; Mukhopadhyay, Snehasis

    2011-10-01

    We discuss the application of indirect learning methods in zero-sum and identical payoff learning automata games. We propose a novel decentralized version of the well-known pursuit learning algorithm. Such a decentralized algorithm has significant computational advantages over its centralized counterpart. The theoretical study of such a decentralized algorithm requires the analysis to be carried out in a nonstationary environment. We use a novel bootstrapping argument to prove the convergence of the algorithm. To our knowledge, this is the first time that such analysis has been carried out for zero-sum and identical payoff games. Extensive simulation studies are reported, which demonstrate the proposed algorithm's fast and accurate convergence in a variety of game scenarios. We also introduce the framework of partial communication in the context of identical payoff games of learning automata. In such games, the automata may not communicate with each other or may communicate selectively. This comprehensive framework has the capability to model both centralized and decentralized games discussed in this paper.

  19. Entropies of the automata networks with additive rule

    Institute of Scientific and Technical Information of China (English)

    Guo-qingGU; GeCHEN; 等

    1996-01-01

    The matrix presentation for automata networks with additive rule are described.A set of entropy theorems of additive automata network are proved and an analytic formula of its entropy is built.For example,we proved that the topological entropy is identically equal to metric entropy for an additive antomata network.

  20. A Deterministic Approach to the Synchronization of Cellular Automata

    OpenAIRE

    Garcia, J.; Garcia, P.

    2011-01-01

    In this work we introduce a deterministic scheme of synchronization of linear and nonlinear cellular automata (CA) with complex behavior, connected through a master-slave coupling. By using a definition of Boolean derivative, we use the linear approximation of the automata to determine a function of coupling that promotes synchronization without perturbing all the sites of the slave system.

  1. Autopoietic Automata: Complexity Issues in Offspring-Producing Evolving Processes

    Czech Academy of Sciences Publication Activity Database

    Wiedermann, Jiří

    2007-01-01

    Roč. 383, č. 2-3 (2007), s. 260-269 ISSN 0304-3975 R&D Projects: GA AV ČR 1ET100300517 Institutional research plan: CEZ:AV0Z10300504 Keywords : autopoietic automata * self-reproducing automata * interactive Turing machine * simulation * computational complexity Subject RIV: IN - Informatics, Computer Science Impact factor: 0.735, year: 2007

  2. Optimal Conditional Reachability for Multi-Priced Timed Automata

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

    2005-01-01

    In this paper, we prove decidability of the optimal conditional reachability problem for multi-priced timed automata, an extension of timed automata with multiple cost variables evolving according to given rates for each location. More precisely, we consider the problem of determining the minimal...

  3. Basic Ideas to Approach Metastability in Probabilistic Cellular Automata

    NARCIS (Netherlands)

    Cirillo, Emilio N. M.; Nardi, Francesca R.; Spitoni, Cristian

    2016-01-01

    Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete time Markov chains on lattice with finite single--cell

  4. On using priced timed automata to achieve optimal scheduling

    DEFF Research Database (Denmark)

    Rasmussen, Jacob Illum; Larsen, Kim Guldstrand; Subramani, K.

    2006-01-01

    This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European proj...... of so-called priced timed automata....

  5. Lattice Automata for Control of Self-Reconfigurable Robots

    DEFF Research Database (Denmark)

    Støy, Kasper

    2015-01-01

    are extreme versatility and robustness. The organisation of self-reconfigurable robots in a lattice structure and the emphasis on local communication between modules mean that lattice automata are a useful basis for control of self-reconfigurable robots. However, there are significant differences which arise...... mainly from the physical nature of self-reconfigurable robots as opposed to the virtual nature of lattice automata. The problems resulting from these differences are mutual exclusion, handling motion constraints of modules, and unrealistic assumption about global, spatial orientation. Despite...... these problems the self-reconfigurable robot community has successfully applied lattice automata to simple control problems. However, for more complex problems hybrid solutions based on lattice automata and distributed algorithms are used. Hence, lattice automata have shown to have potential for the control...

  6. Language Emptiness of Continuous-Time Parametric Timed Automata

    DEFF Research Database (Denmark)

    Benes, Nikola; Bezdek, Peter; Larsen, Kim Guldstrand

    2015-01-01

    Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various restricted subclasses. We thus focus on the case...... where parameters are assumed to be integer-valued, while the time still remains continuous. On the one hand, we show that the problem remains undecidable for parametric timed automata with three clocks and one parameter. On the other hand, for the case with arbitrary many clocks where only one......-time semantics only. To the best of our knowledge, this is the first positive result in the case of continuous-time and unbounded integer parameters, except for the rather simple case of single-clock automata....

  7. HYPERCOMPOSITIONAL STRUCTURES FROM THE COMPUTER THEORY

    Directory of Open Access Journals (Sweden)

    Geronimos G. Massouros

    1999-02-01

    Full Text Available Abstract This paper presents the several types of hypercompositional structures that have been introduced and used for the approach and solution of problems in the theory of languages and automata.

  8. Two Phase Flow Simulation Using Cellular Automata; Simulacion de Flujos de dos Fases con Automatas Celulares

    Energy Technology Data Exchange (ETDEWEB)

    Marcel, C P [Instituto Balseiro, Universidad Nacional de Cuyo, Centro Atomico Bariloche (Argentina)

    2002-07-01

    The classical mathematical treatment of two-phase flows is based on the average of the conservation equations for each phase.In this work, a complementary approach to the modeling of these systems based on statistical population balances of aut omata sets is presented.Automata are entities defined by mathematical states that change following iterative rules representing interactions with the neighborhood.A model of automata for two-phase flow simulation is presented.This model consists of fie lds of virtual spheres that change their volumes and move around a certain environment.The model is more general than the classical cellular automata in two respects: the grid of cellular automata is dismissed in favor of a trajectory generator, and the rules of interaction involve parameters representing the actual physical interactions between phases.Automata simulation was used to study unsolved two-phase flow problems involving high heat flux rates. One system described in this work consists of a vertical channel with saturated water at normal pressure heated from the lower surface.The heater causes water to boil and starts the bubble production.We used cellular automata to describe two-phase flows and the interaction with the heater.General rule s for such cellular automata representing bubbles moving in stagnant liquid were used, with special attention to correct modeling of different mechanisms of heat transfer.The results of the model were compared to previous experiments and correlations finding good agreement.One of the most important findings is the confirmation of Kutateladze's idea about a close relation between the start of critical heat flux and a change in the flow's topology.This was analyzed using a control volume located in the upper surface of the heater.A strong decrease in the interfacial surface just before the CHF start was encountered.The automata describe quite well some characteristic parameters such as the shape of the local void fraction in the

  9. Cellular automata model for human articular chondrocytes migration, proliferation and cell death: An in vitro validation.

    Science.gov (United States)

    Vaca-González, J J; Gutiérrez, M L; Guevara, J M; Garzón-Alvarado, D A

    2017-01-01

    Articular cartilage is characterized by low cell density of only one cell type, chondrocytes, and has limited self-healing properties. When articular cartilage is affected by traumatic injuries, a therapeutic strategy such as autologous chondrocyte implantation is usually proposed for its treatment. This approach requires in vitro chondrocyte expansion to yield high cell number for cell transplantation. To improve the efficiency of this procedure, it is necessary to assess cell dynamics such as migration, proliferation and cell death during culture. Computational models such as cellular automata can be used to simulate cell dynamics in order to enhance the result of cell culture procedures. This methodology has been implemented for several cell types; however, an experimental validation is required for each one. For this reason, in this research a cellular automata model, based on random-walk theory, was devised in order to predict articular chondrocyte behavior in monolayer culture during cell expansion. Results demonstrated that the cellular automata model corresponded to cell dynamics and computed-accurate quantitative results. Moreover, it was possible to observe that cell dynamics depend on weighted probabilities derived from experimental data and cell behavior varies according to the cell culture period. Thus, depending on whether cells were just seeded or proliferated exponentially, culture time probabilities differed in percentages in the CA model. Furthermore, in the experimental assessment a decreased chondrocyte proliferation was observed along with increased passage number. This approach is expected to having other uses as in enhancing articular cartilage therapies based on tissue engineering and regenerative medicine.

  10. Unary self-verifying symmetric difference automata

    CSIR Research Space (South Africa)

    Marais, Laurette

    2016-07-01

    Full Text Available stream_source_info Marais_2016_ABSTRACT.pdf.txt stream_content_type text/plain stream_size 796 Content-Encoding ISO-8859-1 stream_name Marais_2016_ABSTRACT.pdf.txt Content-Type text/plain; charset=ISO-8859-1 18th... International Workshop on Descriptional Complexity of Formal Systems, 5 - 8 July 2016, Bucharest, Romania Unary self-verifying symmetric difference automata Laurette Marais1,2 and Lynette van Zijl1(B) 1 Department of Computer Science, Stellenbosch...

  11. Recent results for random networks of automata

    International Nuclear Information System (INIS)

    Flyvbjerg, H.

    1987-05-01

    After a very brief historical and contextual introduction to random networks of automata we review recent numerical and analytical results. Open questions and unsolved problems are pointed out and discussed. One such question is also answered: it is shown that the size of the stable core can be used as order parameter for a transition between phases of frozen and chaotic network behavior. A mean-field-like but exact selfconsistency equation for the size of the stable core is given. A new derivation of critical parameter values follows from it. (orig.)

  12. Soliton cellular automata associated with crystal bases

    International Nuclear Information System (INIS)

    Hatayama, Goro; Kuniba, Atsuo; Takagi, Taichiro

    2000-01-01

    We introduce a class of cellular automata associated with crystals of irreducible finite dimensional representations of quantum affine algebras U' q (g-circumflex n ). They have solitons labeled by crystals of the smaller algebra U' q (g-circumflex n-1 ). We prove stable propagation of one soliton for g-circumflex n =A (2) 2n-1 ,A (2) 2n ,B (1) n ,C (1) n ,D (1) n and D (2) n+1 . For g-circumflex n =C (1) n , we also prove that the scattering matrices of two solitons coincide with the combinatorial R matrices of U' q (C (1) n-1 )-crystals

  13. Measuring Communication in Parallel Communicating Finite Automata

    Directory of Open Access Journals (Sweden)

    Henning Bordihn

    2014-05-01

    Full Text Available Systems of deterministic finite automata communicating by sending their states upon request are investigated, when the amount of communication is restricted. The computational power and decidability properties are studied for the case of returning centralized systems, when the number of necessary communications during the computations of the system is bounded by a function depending on the length of the input. It is proved that an infinite hierarchy of language families exists, depending on the number of messages sent during their most economical recognitions. Moreover, several properties are shown to be not semi-decidable for the systems under consideration.

  14. Modelling robot's behaviour using finite automata

    Science.gov (United States)

    Janošek, Michal; Žáček, Jaroslav

    2017-07-01

    This paper proposes a model of a robot's behaviour described by finite automata. We split robot's knowledge into several knowledge bases which are used by the inference mechanism of the robot's expert system to make a logic deduction. Each knowledgebase is dedicated to the particular behaviour domain and the finite automaton helps us switching among these knowledge bases with the respect of actual situation. Our goal is to simplify and reduce complexity of one big knowledgebase splitting it into several pieces. The advantage of this model is that we can easily add new behaviour by adding new knowledgebase and add this behaviour into the finite automaton and define necessary states and transitions.

  15. Learn with SAT to Minimize Büchi Automata

    Directory of Open Access Journals (Sweden)

    Stephan Barth

    2012-10-01

    Full Text Available We describe a minimization procedure for nondeterministic Büchi automata (NBA. For an automaton A another automaton A_min with the minimal number of states is learned with the help of a SAT-solver. This is done by successively computing automata A' that approximate A in the sense that they accept a given finite set of positive examples and reject a given finite set of negative examples. In the course of the procedure these example sets are successively increased. Thus, our method can be seen as an instance of a generic learning algorithm based on a "minimally adequate teacher'' in the sense of Angluin. We use a SAT solver to find an NBA for given sets of positive and negative examples. We use complementation via construction of deterministic parity automata to check candidates computed in this manner for equivalence with A. Failure of equivalence yields new positive or negative examples. Our method proved successful on complete samplings of small automata and of quite some examples of bigger automata. We successfully ran the minimization on over ten thousand automata with mostly up to ten states, including the complements of all possible automata with two states and alphabet size three and discuss results and runtimes; single examples had over 100 states.

  16. Functional Automata - Formal Languages for Computer Science Students

    Directory of Open Access Journals (Sweden)

    Marco T. Morazán

    2014-12-01

    Full Text Available An introductory formal languages course exposes advanced undergraduate and early graduate students to automata theory, grammars, constructive proofs, computability, and decidability. Programming students find these topics to be challenging or, in many cases, overwhelming and on the fringe of Computer Science. The existence of this perception is not completely absurd since students are asked to design and prove correct machines and grammars without being able to experiment nor get immediate feedback, which is essential in a learning context. This article puts forth the thesis that the theory of computation ought to be taught using tools for actually building computations. It describes the implementation and the classroom use of a library, FSM, designed to provide students with the opportunity to experiment and test their designs using state machines, grammars, and regular expressions. Students are able to perform random testing before proceeding with a formal proof of correctness. That is, students can test their designs much like they do in a programming course. In addition, the library easily allows students to implement the algorithms they develop as part of the constructive proofs they write. Providing students with this ability ought to be a new trend in the formal languages classroom.

  17. Recursive definition of global cellular-automata mappings

    DEFF Research Database (Denmark)

    Feldberg, Rasmus; Knudsen, Carsten; Rasmussen, Steen

    1994-01-01

    A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping...... as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set...

  18. Automata-Based Verification of Temporal Properties on Running Programs

    Science.gov (United States)

    Giannakopoulou, Dimitra; Havelund, Klaus; Lan, Sonie (Technical Monitor)

    2001-01-01

    This paper presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finite-state automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL to Buchi automata conversion techniques to generate automata that check finite program traces. The algorithm has been implemented in a tool, which has been integrated with the generic JPaX framework for runtime analysis of Java programs.

  19. Minimum-Cost Reachability for Priced Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Fehnker, Ansgar; Hune, Thomas Seidelin

    2001-01-01

    This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine...... the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques...

  20. Operational State Complexity of Deterministic Unranked Tree Automata

    Directory of Open Access Journals (Sweden)

    Xiaoxue Piao

    2010-08-01

    Full Text Available We consider the state complexity of basic operations on tree languages recognized by deterministic unranked tree automata. For the operations of union and intersection the upper and lower bounds of both weakly and strongly deterministic tree automata are obtained. For tree concatenation we establish a tight upper bound that is of a different order than the known state complexity of concatenation of regular string languages. We show that (n+1 ( (m+12^n-2^(n-1 -1 vertical states are sufficient, and necessary in the worst case, to recognize the concatenation of tree languages recognized by (strongly or weakly deterministic automata with, respectively, m and n vertical states.

  1. On the spatial dynamics and oscillatory behavior of a predator-prey model based on cellular automata and local particle swarm optimization.

    Science.gov (United States)

    Molina, Mario Martínez; Moreno-Armendáriz, Marco A; Carlos Seck Tuoh Mora, Juan

    2013-11-07

    A two-dimensional lattice model based on Cellular Automata theory and swarm intelligence is used to study the spatial and population dynamics of a theoretical ecosystem. It is found that the social interactions among predators provoke the formation of clusters, and that by increasing the mobility of predators the model enters into an oscillatory behavior. © 2013 Elsevier Ltd. All rights reserved.

  2. A new model for anaerobic processes of up-flow anaerobic sludge blanket reactors based on cellular automata

    DEFF Research Database (Denmark)

    Skiadas, Ioannis V.; Ahring, Birgitte Kiær

    2002-01-01

    characteristics and lead to different reactor behaviour. A dynamic mathematical model has been developed for the anaerobic digestion of a glucose based synthetic wastewater in UASB reactors. Cellular automata (CA) theory has been applied to simulate the granule development process. The model takes...... into consideration that granule diameter and granule microbial composition are functions of the reactor operational parameters and is capable of predicting the UASB performance and the layer structure of the granules....

  3. Finite automata over magmas: models and some applications in Cryptography

    Directory of Open Access Journals (Sweden)

    Volodymyr V. Skobelev

    2018-05-01

    Full Text Available In the paper the families of finite semi-automata and reversible finite Mealy and Moore automata over finite magmas are defined and analyzed in detail. On the base of these models it is established that the set of finite quasigroups is the most acceptable subset of the set of finite magmas at resolving model problems in Cryptography, such as design of iterated hash functions and stream ciphers. Defined families of finite semi-automata and reversible finite automata over finite $T$-quasigroups are investigated in detail. It is established that in this case models time and space complexity for simulation of the functioning during one instant of automaton time can be much lower than in general case.

  4. A generalized cellular automata approach to modeling first order ...

    Indian Academy of Sciences (India)

    ... inhibitors deforming the allosteric site or inhibitors changing the structure of active ... Cell-based models with discrete state variables, such as Cellular Automata ... capture the essential features of a discrete real system, consisting of space, ...

  5. Mode automata and their compilation into fault trees

    International Nuclear Information System (INIS)

    Rauzy, Antoine

    2002-01-01

    In this article, we advocate the use of mode automata as a high level representation language for reliability studies. Mode automata are states/transitions based representations with the additional notion of flow. They can be seen as a generalization of both finite capacity Petri nets and block diagrams. They can be assembled into hierarchies by means of composition operations. The contribution of this article is twofold. First, we introduce mode automata and we discuss their relationship with other formalisms. Second, we propose an algorithm to compile mode automata into Boolean equations (fault trees). Such a compilation is of interest for two reasons. First, assessment tools for Boolean models are much more efficient than those for states/transitions models. Second, the automated generation of fault trees from higher level representations makes easier their maintenance through the life cycle of systems under study

  6. A generalized cellular automata approach to modeling first order ...

    Indian Academy of Sciences (India)

    system, consisting of space, time and state, structured with simple local rules without ... Sensitivity analysis of a stochastic cellular automata model. 413 ..... Baetens J M and De Baets B 2011 Design and parameterization of a stochastic cellular.

  7. Multi-Robot Motion Planning: A Timed Automata Approach

    OpenAIRE

    Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh

    2004-01-01

    This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar grid. The automata formalism merely presents a high-level model of environment, robots and control, but allows composition and formal symbolic reasoning about coordinated solutions. Composition is achi...

  8. Dual decomposition for parsing with non-projective head automata

    OpenAIRE

    Koo, Terry; Rush, Alexander Matthew; Collins, Michael; Jaakkola, Tommi S.; Sontag, David Alexander

    2010-01-01

    This paper introduces algorithms for non-projective parsing based on dual decomposition. We focus on parsing algorithms for non-projective head automata, a generalization of head-automata models to non-projective structures. The dual decomposition algorithms are simple and efficient, relying on standard dynamic programming and minimum spanning tree algorithms. They provably solve an LP relaxation of the non-projective parsing problem. Empirically the LP relaxation is very often tight: for man...

  9. Analysis for Embedded Systems: Experiments with Priced Timed Automata

    DEFF Research Database (Denmark)

    Ovatman, Tolga; Brekling, Aske Wiid; Hansen, Michael Reichhardt

    2010-01-01

    costs of those models. In order to achieve this, a basic model is built using priced timed automata and some resource consumption scenarios are verified. Even though the experiments are performed on small and basic models, we believe we have taken a basis step in showing that it is promising to use...... priced timed automata and Uppaal Cora as a model checking tool in reasoning about resource consumption of embedded systems....

  10. Resource-Optimal Scheduling Using Priced Timed Automata

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand; Rasmussen, Jacob Illum; Subramani, K.

    2004-01-01

    In this paper, we show how the simple structure of the linear programs encountered during symbolic minimum-cost reachability analysis of priced timed automata can be exploited in order to substantially improve the performance of the current algorithm. The idea is rooted in duality of linear......-80 percent performance gain. As a main application area, we show how to solve energy-optimal task graph scheduling problems using the framework of priced timed automata....

  11. Unary probabilistic and quantum automata on promise problems

    OpenAIRE

    Gainutdinova, Aida; Yakaryilmaz, Abuzer

    2015-01-01

    We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs ...

  12. Nonlinear threshold Boolean automata networks and phase transitions

    OpenAIRE

    Demongeot, Jacques; Sené, Sylvain

    2010-01-01

    In this report, we present a formal approach that addresses the problem of emergence of phase transitions in stochastic and attractive nonlinear threshold Boolean automata networks. Nonlinear networks considered are informally defined on the basis of classical stochastic threshold Boolean automata networks in which specific interaction potentials of neighbourhood coalition are taken into account. More precisely, specific nonlinear terms compose local transition functions that define locally t...

  13. Authorship attribution based on Life-Like Network Automata

    Science.gov (United States)

    Machicao, Jeaneth; Corrêa, Edilson A.; Miranda, Gisele H. B.; Amancio, Diego R.

    2018-01-01

    The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks. PMID:29566100

  14. Authorship attribution based on Life-Like Network Automata.

    Science.gov (United States)

    Machicao, Jeaneth; Corrêa, Edilson A; Miranda, Gisele H B; Amancio, Diego R; Bruno, Odemir M

    2018-01-01

    The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks.

  15. Buffered Simulation Games for Büchi Automata

    Directory of Open Access Journals (Sweden)

    Milka Hutagalung

    2014-05-01

    Full Text Available Simulation relations are an important tool in automata theory because they provide efficiently computable approximations to language inclusion. In recent years, extensions of ordinary simulations have been studied, for instance multi-pebble and multi-letter simulations which yield better approximations and are still polynomial-time computable. In this paper we study the limitations of approximating language inclusion in this way: we introduce a natural extension of multi-letter simulations called buffered simulations. They are based on a simulation game in which the two players share a FIFO buffer of unbounded size. We consider two variants of these buffered games called continuous and look-ahead simulation which differ in how elements can be removed from the FIFO buffer. We show that look-ahead simulation, the simpler one, is already PSPACE-hard, i.e. computationally as hard as language inclusion itself. Continuous simulation is even EXPTIME-hard. We also provide matching upper bounds for solving these games with infinite state spaces.

  16. Authorship attribution based on Life-Like Network Automata.

    Directory of Open Access Journals (Sweden)

    Jeaneth Machicao

    Full Text Available The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks.

  17. Representation theory of finite monoids

    CERN Document Server

    Steinberg, Benjamin

    2016-01-01

    This first text on the subject provides a comprehensive introduction to the representation theory of finite monoids. Carefully worked examples and exercises provide the bells and whistles for graduate accessibility, bringing a broad range of advanced readers to the forefront of research in the area. Highlights of the text include applications to probability theory, symbolic dynamics, and automata theory. Comfort with module theory, a familiarity with ordinary group representation theory, and the basics of Wedderburn theory, are prerequisites for advanced graduate level study. Researchers in algebra, algebraic combinatorics, automata theory, and probability theory, will find this text enriching with its thorough presentation of applications of the theory to these fields. Prior knowledge of semigroup theory is not expected for the diverse readership that may benefit from this exposition. The approach taken in this book is highly module-theoretic and follows the modern flavor of the theory of finite dimensional ...

  18. On Tree Pattern Matching by Pushdown Automata

    Directory of Open Access Journals (Sweden)

    T. Flouri

    2009-01-01

    Full Text Available Tree pattern matching is an important operation in Computer Science on which a number of tasks such as mechanical theorem proving, term-rewriting, symbolic computation and non-procedural programming languages are based on. Work has begun on a systematic approach to the construction of tree pattern matchers by deterministic pushdown automata which read subject trees in prefix notation. The method is analogous to the construction of string pattern matchers: for given patterns, a non-deterministic pushdown automaton is created and then it is determinised. In this first paper, we present the proposed non-deterministic pushdown automaton which will serve as a basis for the determinisation process, and prove its correctness. 

  19. Modelling Cow Behaviour Using Stochastic Automata

    DEFF Research Database (Denmark)

    Jónsson, Ragnar Ingi

    This report covers an initial study on the modelling of cow behaviour using stochastic automata with the aim of detecting lameness. Lameness in cows is a serious problem that needs to be dealt with because it results in less profitable production units and in reduced quality of life...... for the affected livestock. By featuring training data consisting of measurements of cow activity, three different models are obtained, namely an autonomous stochastic automaton, a stochastic automaton with coinciding state and output and an autonomous stochastic automaton with coinciding state and output, all...... of which describe the cows' activity in the two regarded behavioural scenarios, non-lame and lame. Using the experimental measurement data the different behavioural relations for the two regarded behavioural scenarios are assessed. The three models comprise activity within last hour, activity within last...

  20. Computing by Temporal Order: Asynchronous Cellular Automata

    Directory of Open Access Journals (Sweden)

    Michael Vielhaber

    2012-08-01

    Full Text Available Our concern is the behaviour of the elementary cellular automata with state set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case, under all possible update rules (asynchronicity. Over the torus Z/nZ (n<= 11,we will see that the ECA with Wolfram rule 57 maps any v in F_2^n to any w in F_2^n, varying the update rule. We furthermore show that all even (element of the alternating group bijective functions on the set F_2^n = 0,...,2^n-1, can be computed by ECA57, by iterating it a sufficient number of times with varying update rules, at least for n <= 10. We characterize the non-bijective functions computable by asynchronous rules.

  1. Particles and Patterns in Cellular Automata

    International Nuclear Information System (INIS)

    Jen, E.; Das, R.; Beasley, C.E.

    1999-01-01

    This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Our objective has been to develop tools for studying particle interactions in a class of dynamical systems characterized by discreteness, determinism, local interaction, and an inherently parallel form of evolution. These systems can be described by cellular automata (CA) and the behavior we studied has improved our understanding of the nature of patterns generated by CAs, their ability to perform global computations, and their relationship to continuous dynamical systems. We have also developed a rule-table mathematics that enables one to custom-design CA rule tables to generate patterns of specified types, or to perform specified computational tasks

  2. Simulating Complex Systems by Cellular Automata

    CERN Document Server

    Kroc, Jiri; Hoekstra, Alfons G

    2010-01-01

    Deeply rooted in fundamental research in Mathematics and Computer Science, Cellular Automata (CA) are recognized as an intuitive modeling paradigm for Complex Systems. Already very basic CA, with extremely simple micro dynamics such as the Game of Life, show an almost endless display of complex emergent behavior. Conversely, CA can also be designed to produce a desired emergent behavior, using either theoretical methodologies or evolutionary techniques. Meanwhile, beyond the original realm of applications - Physics, Computer Science, and Mathematics – CA have also become work horses in very different disciplines such as epidemiology, immunology, sociology, and finance. In this context of fast and impressive progress, spurred further by the enormous attraction these topics have on students, this book emerges as a welcome overview of the field for its practitioners, as well as a good starting point for detailed study on the graduate and post-graduate level. The book contains three parts, two major parts on th...

  3. A cellular automata model of bone formation.

    Science.gov (United States)

    Van Scoy, Gabrielle K; George, Estee L; Opoku Asantewaa, Flora; Kerns, Lucy; Saunders, Marnie M; Prieto-Langarica, Alicia

    2017-04-01

    Bone remodeling is an elegantly orchestrated process by which osteocytes, osteoblasts and osteoclasts function as a syncytium to maintain or modify bone. On the microscopic level, bone consists of cells that create, destroy and monitor the bone matrix. These cells interact in a coordinated manner to maintain a tightly regulated homeostasis. It is this regulation that is responsible for the observed increase in bone gain in the dominant arm of a tennis player and the observed increase in bone loss associated with spaceflight and osteoporosis. The manner in which these cells interact to bring about a change in bone quality and quantity has yet to be fully elucidated. But efforts to understand the multicellular complexity can ultimately lead to eradication of metabolic bone diseases such as osteoporosis and improved implant longevity. Experimentally validated mathematical models that simulate functional activity and offer eventual predictive capabilities offer tremendous potential in understanding multicellular bone remodeling. Here we undertake the initial challenge to develop a mathematical model of bone formation validated with in vitro data obtained from osteoblastic bone cells induced to mineralize and quantified at 26 days of culture. A cellular automata model was constructed to simulate the in vitro characterization. Permutation tests were performed to compare the distribution of the mineralization in the cultures and the distribution of the mineralization in the mathematical models. The results of the permutation test show the distribution of mineralization from the characterization and mathematical model come from the same probability distribution, therefore validating the cellular automata model. Copyright © 2017 Elsevier Inc. All rights reserved.

  4. Density-conserving affine continuous cellular automata solving the relaxed density classification problem

    International Nuclear Information System (INIS)

    Wolnik, Barbara; Dembowski, Marcin; Bołt, Witold; Baetens, Jan M; De Baets, Bernard

    2017-01-01

    The focus of this paper is on the density classification problem in the context of affine continuous cellular automata. Although such cellular automata cannot solve this problem in the classical sense, most density-conserving affine continuous cellular automata with a unit neighborhood radius are valid solutions of a slightly relaxed version of this problem. This result follows from a detailed study of the dynamics of the density-conserving affine continuous cellular automata that we introduce. (paper)

  5. Sequences, groups, and number theory

    CERN Document Server

    Rigo, Michel

    2018-01-01

    This collaborative book presents recent trends on the study of sequences, including combinatorics on words and symbolic dynamics, and new interdisciplinary links to group theory and number theory. Other chapters branch out from those areas into subfields of theoretical computer science, such as complexity theory and theory of automata. The book is built around four general themes: number theory and sequences, word combinatorics, normal numbers, and group theory. Those topics are rounded out by investigations into automatic and regular sequences, tilings and theory of computation, discrete dynamical systems, ergodic theory, numeration systems, automaton semigroups, and amenable groups.  This volume is intended for use by graduate students or research mathematicians, as well as computer scientists who are working in automata theory and formal language theory. With its organization around unified themes, it would also be appropriate as a supplemental text for graduate level courses.

  6. Tree automata-based refinement with application to Horn clause verification

    DEFF Research Database (Denmark)

    Kafle, Bishoksan; Gallagher, John Patrick

    2015-01-01

    In this paper we apply tree-automata techniques to refinement of abstract interpretation in Horn clause verification. We go beyond previous work on refining trace abstractions; firstly we handle tree automata rather than string automata and thereby can capture traces in any Horn clause derivation...... compare the results with other state of the art Horn clause verification tools....

  7. What will be eventually true of polymomial hybrid automata

    DEFF Research Database (Denmark)

    Fränzle, Martin

    2001-01-01

    Hybrid automata have been introduced in both control engineering and computer science as a formal model for the dynamics of hybrid discrete-continuous systems. While computability issues concerning safety properties have been extensively studied, liveness properties have remained largely uninvest......Hybrid automata have been introduced in both control engineering and computer science as a formal model for the dynamics of hybrid discrete-continuous systems. While computability issues concerning safety properties have been extensively studied, liveness properties have remained largely...... uninvestigated. In this article, we investigate decidability of state recurrence and of progress properties. First, we show that state recurrence and progress are in general undecidable for polynomial hybrid automata. Then, we demonstrate that they are closely related for hybrid automata subject to a simple...... model of noise, even though these automata are infinite-state systems. Based on this, we augment a semi-decision procedure for recurrence with a semi-decision method for length-boundedness of paths in such a way that we obtain an automatic verification method for progress properties of linear...

  8. Simulation of Two-Way Pushdown Automata Revisited

    Directory of Open Access Journals (Sweden)

    Robert Glück

    2013-09-01

    Full Text Available The linear-time simulation of 2-way deterministic pushdown automata (2DPDA by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access memory, performs a linear-time simulation of 2DPDA. The recursive interpreter works without the dump list of the original constructions, which makes Cook's insight into linear-time simulation of exponential-time automata more intuitive and the complexity argument clearer. The simulation is then extended to 2-way nondeterministic pushdown automata (2NPDA to provide for a cubic-time recognition of context-free languages. The time required to run the final construction depends on the degree of nondeterminism. The key mechanism that enables the polynomial-time simulations is the sharing of computations by memoization.

  9. Model Checking Timed Automata with Priorities using DBM Subtraction

    DEFF Research Database (Denmark)

    David, Alexandre; Larsen, Kim Guldstrand; Pettersson, Paul

    2006-01-01

    In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic model-checking of timed automata with priorities. The subtraction is one of the few operations on DBMs that result...... in a non-convex set needing sets of DBMs for representation. Our subtraction algorithms are efficient in the sense that the number of generated DBMs is significantly reduced compared to a naive algorithm. The overhead in time is compensated by the gain from reducing the number of resulting DBMs since...... this number affects the performance of symbolic model-checking. The uses of the DBM subtraction operation extend beyond timed automata with priorities. It is also useful for allowing guards on transitions with urgent actions, deadlock checking, and timed games....

  10. Irreversibility and dissipation in finite-state automata

    International Nuclear Information System (INIS)

    Ganesh, Natesh; Anderson, Neal G.

    2013-01-01

    Irreversibility and dissipation in finite-state automata (FSA) are considered from a physical-information-theoretic perspective. A quantitative measure for the computational irreversibility of finite automata is introduced, and a fundamental lower bound on the average energy dissipated per state transition is obtained and expressed in terms of FSA irreversibility. The irreversibility measure and energy bound are germane to any realization of a deterministic automaton that faithfully registers abstract FSA states in distinguishable states of a physical system coupled to a thermal environment, and that evolves via a sequence of interactions with an external system holding a physical instantiation of a random input string. The central result, which is shown to follow from quantum dynamics and entropic inequalities alone, can be regarded as a generalization of Landauer's Principle applicable to FSAs and tailorable to specified automata. Application to a simple FSA is illustrated.

  11. Efficient Translation of LTL Formulae into Buchi Automata

    Science.gov (United States)

    Giannakopoulou, Dimitra; Lerda, Flavio

    2001-01-01

    Model checking is a fully automated technique for checking that a system satisfies a set of required properties. With explicit-state model checkers, properties are typically defined in linear-time temporal logic (LTL), and are translated into B chi automata in order to be checked. This report presents how we have combined and improved existing techniques to obtain an efficient LTL to B chi automata translator. In particular, we optimize the core of existing tableau-based approaches to generate significantly smaller automata. Our approach has been implemented and is being released as part of the Java PathFinder software (JPF), an explicit state model checker under development at the NASA Ames Research Center.

  12. Multi-Robot Motion Planning: A Timed Automata Approach

    DEFF Research Database (Denmark)

    Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh

    2004-01-01

    This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar...... grid. The automata formalism merely presents a high-level model of environment, robots and control, but allows composition and formal symbolic reasoning about coordinated solutions. Composition is achieved through synchronization, and the verification software UPPAAL is used for a symbolic verification...... then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research....

  13. Multi-Robot Motion Planning: A Timed Automata Approach

    DEFF Research Database (Denmark)

    Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh

    This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar...... grid. The automata formalism merely presents a high-level model of environment, robots and control, but allows composition and formal symbolic reasoning about coordinated solutions. Composition is achieved through synchronization, and the verification software UPPAAL is used for a symbolic verification...... then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research....

  14. Timed-Arc Petri Nets vs. Networks of Timed Automata

    DEFF Research Database (Denmark)

    Srba, Jiri

    We establish mutual translations between the classes of 1-safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass where every clock used in the guard has to be reset). The presented translations are very tight (up to isomorphism of labelled...... transition systems with time). This provides a convenient characterization from the theoretical point of view but is not always satisfactory from the practical point of view because of the possible non-polynomial blow up in the size (in the direction from automata to nets). Hence we relax the isomorphism...... requirement and provide efficient (polynomial time) reductions between networks of timed automata and 1-safe timed-arc Petri nets preserving the answer to the reachability question. This makes our techniques suitable for automatic translation into a format required by tools like UPPAAL and KRONOS. A direct...

  15. Lempel-Ziv complexity analysis of one dimensional cellular automata.

    Science.gov (United States)

    Estevez-Rams, E; Lora-Serrano, R; Nunes, C A J; Aragón-Fernández, B

    2015-12-01

    Lempel-Ziv complexity measure has been used to estimate the entropy density of a string. It is defined as the number of factors in a production factorization of a string. In this contribution, we show that its use can be extended, by using the normalized information distance, to study the spatiotemporal evolution of random initial configurations under cellular automata rules. In particular, the transfer information from time consecutive configurations is studied, as well as the sensitivity to perturbed initial conditions. The behavior of the cellular automata rules can be grouped in different classes, but no single grouping captures the whole nature of the involved rules. The analysis carried out is particularly appropriate for studying the computational processing capabilities of cellular automata rules.

  16. Minimum-Cost Reachability for Priced Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Fehnker, Ansgar; Hune, Thomas Seidelin

    2001-01-01

    This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine...... the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques...... and a new notion of priced regions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them....

  17. Communicative automata based programming. Society Framework

    Directory of Open Access Journals (Sweden)

    Andrei Micu

    2015-10-01

    Full Text Available One of the aims of this paper is to present a new programming paradigm based on the new paradigms intensively used in IT industry. Implementation of these techniques can improve the quality of code through modularization, not only in terms of entities used by a program, but also in terms of states in which they pass. Another aspect followed in this paper takes into account that in the development of software applications, the transition from the design to the source code is a very expensive step in terms of effort and time spent. Diagrams can hide very important details for simplicity of understanding, which can lead to incorrect or incomplete implementations. To improve this process communicative automaton based programming comes with an intermediate step. We will see how it goes after creating modeling diagrams to communicative automata and then to writing code for each of them. We show how the transition from one step to another is much easier and intuitive.

  18. Design of Efficient Mirror Adder in Quantum- Dot Cellular Automata

    Science.gov (United States)

    Mishra, Prashant Kumar; Chattopadhyay, Manju K.

    2018-03-01

    Lower power consumption is an essential demand for portable multimedia system using digital signal processing algorithms and architectures. Quantum dot cellular automata (QCA) is a rising nano technology for the development of high performance ultra-dense low power digital circuits. QCA based several efficient binary and decimal arithmetic circuits are implemented, however important improvements are still possible. This paper demonstrate Mirror Adder circuit design in QCA. We present comparative study of mirror adder cells designed using conventional CMOS technique and mirror adder cells designed using quantum-dot cellular automata. QCA based mirror adders are better in terms of area by order of three.

  19. Lattice gas cellular automata and lattice Boltzmann models an introduction

    CERN Document Server

    Wolf-Gladrow, Dieter A

    2000-01-01

    Lattice-gas cellular automata (LGCA) and lattice Boltzmann models (LBM) are relatively new and promising methods for the numerical solution of nonlinear partial differential equations. The book provides an introduction for graduate students and researchers. Working knowledge of calculus is required and experience in PDEs and fluid dynamics is recommended. Some peculiarities of cellular automata are outlined in Chapter 2. The properties of various LGCA and special coding techniques are discussed in Chapter 3. Concepts from statistical mechanics (Chapter 4) provide the necessary theoretical background for LGCA and LBM. The properties of lattice Boltzmann models and a method for their construction are presented in Chapter 5.

  20. Automata for the People: Machine Noise and Attention

    OpenAIRE

    Ellison, David

    2012-01-01

    This article examines the production and reception of incidental machine noise, specifically the variably registered sounds emanating from automata in the eighteenth and nineteenth centuries. The argument proposed here is that the audience for automata performances demonstrated a capacity to screen out mechanical noise that may have otherwise interfered with the narrative theatricality of their display. In this regard the audience may be said to resemble auditors at musical performances who l...

  1. Symmetry pattern transition in cellular automata with complex behavior

    International Nuclear Information System (INIS)

    Sanchez, Juan R.; Lopez-Ruiz, Ricardo

    2008-01-01

    A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is shown that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex symmetrical patterns by stochastically coupling a proportion p of pairs of sites located at equal distance from the center of the lattice. A nontrivial critical value of p must be surpassed in order to obtain symmetrical patterns during the evolution. This strategy is able to classify the cellular automata rules - with complex behavior - between those that support time-dependent symmetric patterns and those which do not support such kind of patterns

  2. Factorization, reduction and embedding in integrable cellular automata

    International Nuclear Information System (INIS)

    Kuniba, Atsuo; Takagi, Taichiro; Takenouchi, Akira

    2004-01-01

    Factorized dynamics in soliton cellular automata with quantum group symmetry is identified with a motion of particles and anti-particles exhibiting pair creation and annihilation. An embedding scheme is presented showing that the D (1) n -automaton contains, as certain subsectors, the box-ball systems and all the other automata associated with the crystal bases of non-exceptional affine Lie algebras. The results extend the earlier ones to higher representations by a certain reduction and to a wider class of boundary conditions

  3. Verification of Continuous Dynamical Systems by Timed Automata

    DEFF Research Database (Denmark)

    Sloth, Christoffer; Wisniewski, Rafael

    2011-01-01

    This paper presents a method for abstracting continuous dynamical systems by timed automata. The abstraction is based on partitioning the state space of a dynamical system using positive invariant sets, which form cells that represent locations of a timed automaton. The abstraction is intended......, which is generated utilizing sub-level sets of Lyapunov functions, as they are positive invariant sets. It is shown that this partition generates sound and complete abstractions. Furthermore, the complete abstractions can be composed of multiple timed automata, allowing parallelization...

  4. A new cellular automata model of traffic flow with negative exponential weighted look-ahead potential

    Science.gov (United States)

    Ma, Xiao; Zheng, Wei-Fan; Jiang, Bao-Shan; Zhang, Ji-Ye

    2016-10-01

    With the development of traffic systems, some issues such as traffic jams become more and more serious. Efficient traffic flow theory is needed to guide the overall controlling, organizing and management of traffic systems. On the basis of the cellular automata model and the traffic flow model with look-ahead potential, a new cellular automata traffic flow model with negative exponential weighted look-ahead potential is presented in this paper. By introducing the negative exponential weighting coefficient into the look-ahead potential and endowing the potential of vehicles closer to the driver with a greater coefficient, the modeling process is more suitable for the driver’s random decision-making process which is based on the traffic environment that the driver is facing. The fundamental diagrams for different weighting parameters are obtained by using numerical simulations which show that the negative exponential weighting coefficient has an obvious effect on high density traffic flux. The complex high density non-linear traffic behavior is also reproduced by numerical simulations. Project supported by the National Natural Science Foundation of China (Grant Nos. 11572264, 11172247, 11402214, and 61373009).

  5. Theory of computation, automata and languages | Akinyede | Ife ...

    African Journals Online (AJOL)

    Ife Journal of Science. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 10, No 1 (2008) >. Log in or Register to get access to full text downloads. Username, Password, Remember me, or Register · Download this PDF file. The PDF file you selected should load here ...

  6. Implementation of Automata Theory to Improve the Learning Disability

    OpenAIRE

    Ali, Syed Asif; Soomro, Safeeullah; Memon, Abdul Ghafoor; Baqi, Abdul

    2013-01-01

    There are various types of disability egress in world like blindness, deafness, and Physical disabilities. It is quite difficult to deal with people with disability. Learning disability (LD) is types of disability totally different from general disability. To deal children with learning disability is difficult for both parents and teacher. As parent deal with only single child so it bit easy. But teacher deals with different students at a time so its more difficult to deal with group of stude...

  7. Modelling and simulating in-stent restenosis with complex automata

    NARCIS (Netherlands)

    Hoekstra, A.G.; Lawford, P.; Hose, R.

    2010-01-01

    In-stent restenosis, the maladaptive response of a blood vessel to injury caused by the deployment of a stent, is a multiscale system involving a large number of biological and physical processes. We describe a Complex Automata Model for in-stent restenosis, coupling bulk flow, drug diffusion, and

  8. Stability Analysis for Hybrid Automata Using Conservative Gains

    NARCIS (Netherlands)

    Langerak, Romanus; Engell, S.; Guegen, H.; Polderman, Jan W.; Krilavicius, T.; Zaytoon, J.

    2003-01-01

    This paper presents a stability analysis approach for a class of hybrid automata. It is assumed that the dynamics in each location of the hybrid automaton is linear and asymptotically stable, and that the guards on the transitions are hyperplanes in the state space. For each pair of ingoing and

  9. Improving the Timed Automata Approach to Biological Pathway Dynamics

    NARCIS (Netherlands)

    Langerak, R.; Pol, Jaco van de; Post, Janine N.; Schivo, Stefano; Aceto, Luca; Bacci, Giorgio; Bacci, Giovanni; Ingólfsdóttir, Anna; Legay, Axel; Mardare, Radu

    2017-01-01

    Biological systems such as regulatory or gene networks can be seen as a particular type of distributed systems, and for this reason they can be modeled within the Timed Automata paradigm, which was developed in the computer science context. However, tools designed to model distributed systems often

  10. Complete Abstractions of Dynamical Systems by Timed Automata

    DEFF Research Database (Denmark)

    Sloth, Christoffer; Wisniewski, Rafael

    2013-01-01

    This paper addresses the generation of complete abstractions of polynomial dynamical systems by timed automata. For the proposed abstraction, the state space is divided into cells by sublevel sets of functions. We identify a relation between these functions and their directional derivatives along...... to approximate the dynamical system, in a subset of admissible subdivisioning functions....

  11. Automata for the People: Machine Noise and Attention

    Directory of Open Access Journals (Sweden)

    David Ellison

    2012-11-01

    Full Text Available This article examines the production and reception of incidental machine noise, specifically the variably registered sounds emanating from automata in the eighteenth and nineteenth centuries. The argument proposed here is that the audience for automata performances demonstrated a capacity to screen out mechanical noise that may have otherwise interfered with the narrative theatricality of their display. In this regard the audience may be said to resemble auditors at musical performances who learned to suppress the various noises associated with the physical mechanics of performance, and the faculty of attention itself. For William James among others, attention demands selection among competing stimuli. As the incidental noise associated with automata disappears from sensibility over time, its capacity to signify in other contexts emerges. In the examples traced here, such noise is a means of distinguishing a specifically etherealised human-machine interaction. This is in sharp distinction from other more degrading forms of relationship such as the sound of bodies labouring at machines. In this regard, the barely detected sound of the automata in operation may be seen as a precursor to the white noise associated with modern, corporate productivity.

  12. Using a satisfiability solver to identify deterministic finite state automata

    NARCIS (Netherlands)

    Heule, M.J.H.; Verwer, S.

    2009-01-01

    We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level SAT representation, our approach seems to be competitive with alternative techniques. Our contributions are threefold: First, we

  13. Reachability analysis for timed automata using max-plus algebra

    DEFF Research Database (Denmark)

    Lu, Qi; Madsen, Michael; Milata, Martin

    2012-01-01

    We show that max-plus polyhedra are usable as a data structure in reachability analysis of timed automata. Drawing inspiration from the extensive work that has been done on difference bound matrices, as well as previous work on max-plus polyhedra in other areas, we develop the algorithms needed...

  14. Some applications and prospects of cellular automata in traffic problems

    NARCIS (Netherlands)

    Goldengorin, Boris; Makarenko, Alexander; Smelyanec, Natalia; Yacoubi, SE; Chopard, B; Bandini, S

    2006-01-01

    In this paper we deal with mathematical modeling of participants' movement based on cellular automata (CA). We describe some improvements of CA models of pedestrian motion taking into account the real geometrical constraints induced by a specific restricted space. Also some presumable optimization

  15. Fractal dimension at the phase transition of inhomogeneous cellular automata

    International Nuclear Information System (INIS)

    da Silva, L.R.

    1988-01-01

    For random binary mixtures of cellular automata in the square lattice, calculations are made of the fractal dimensions associated with the damage spreading and the propagation time of damage at the transition to chaos. Two rules are mixed and universalities of these quantities are sought with respect to change of the rules

  16. Comprehensive bidding strategies with genetic programming/finite state automata

    International Nuclear Information System (INIS)

    Richter, C.W. Jr.; Sheble, G.B.; Ashlock, D.

    1999-01-01

    This research is an extension of the authors' previous work in double auctions aimed at developing bidding strategies for electric utilities which trade electricity competitively. The improvements detailed in this paper come from using data structures which combine genetic programming and finite state automata termed GP-Automata. The strategies developed by the method described here are adaptive--reacting to inputs--whereas the previously developed strategies were only suitable in the particular scenario for which they had been designed. The strategies encoded in the GP-Automata are tested in an auction simulator. The simulator pits them against other distribution companies (distcos) and generation companies (gencos), buying and selling power via double auctions implemented in regional commodity exchanges. The GP-Automata are evolved with a genetic algorithm so that they possess certain characteristics. In addition to designing successful bidding strategies (whose usage would result in higher profits) the resulting strategies can also be designed to imitate certain types of trading behaviors. The resulting strategies can be implemented directly in on-line trading, or can be used as realistic competitors in an off-line trading simulator

  17. Perturbations of dynamics of homogeneous two-dimensional cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Makowiec, D [Gdansk Univ. (Poland)

    1993-04-01

    The probabilistic approach provides a useful tool for understanding the nature of dynamics of cellular automata. It allows not only clarification of different results of the evolution but also gives explanation to the physical meaning of the rules. (author). 11 refs, 4 figs.

  18. Discount-Optimal Infinite Runs in Priced Timed Automata

    DEFF Research Database (Denmark)

    Fahrenberg, Uli; Larsen, Kim Guldstrand

    2009-01-01

    We introduce a new discounting semantics for priced timed automata. Discounting provides a way to model optimal-cost problems for infinite traces and has applications in optimal scheduling and other areas. In the discounting semantics, prices decrease exponentially, so that the contribution...

  19. Characterizations and computational complexity of systolic trellis automata

    Energy Technology Data Exchange (ETDEWEB)

    Ibarra, O H; Kim, S M

    1984-03-01

    Systolic trellis automata are simple models for VLSI. The authors characterize the computing power of these models in terms of turing machines. The characterizations are useful in proving new results as well as giving simpler proofs of known results. They also derive lower and upper bounds on the computational complexity of the models. 18 references.

  20. Supervisory control of (max,+) automata: extensions towards applications

    Czech Academy of Sciences Publication Activity Database

    Lahaye, S.; Komenda, Jan; Boimond, J.-L.

    2015-01-01

    Roč. 88, č. 12 (2015), s. 2523-2537 ISSN 0020-7179 Institutional support: RVO:67985840 Keywords : discrete event systems * logical and time d behaviors * (max,+) automata * supervisory control Subject RIV: BA - General Mathematics Impact factor: 1.880, year: 2015 http://www.tandfonline.com/doi/full/10.1080/00207179.2015.1048295

  1. Supervisory control of (max,+) automata: extensions towards applications

    Czech Academy of Sciences Publication Activity Database

    Lahaye, S.; Komenda, Jan; Boimond, J.-L.

    2015-01-01

    Roč. 88, č. 12 (2015), s. 2523-2537 ISSN 0020-7179 Institutional support: RVO:67985840 Keywords : discrete event systems * logical and timed behaviors * (max,+) automata * supervisory control Subject RIV: BA - General Mathematics Impact factor: 1.880, year: 2015 http://www.tandfonline.com/doi/full/10.1080/00207179.2015.1048295

  2. Car-following Behavior Model Learning Using Timed Automata

    NARCIS (Netherlands)

    Zhang, Yihuan; Lin, Q.; Wang, Jun; Verwer, S.E.; Dochain, D.; Henrion, D.; Peaucelle, D.

    Learning driving behavior is fundamental for autonomous vehicles to “understand” traffic situations. This paper proposes a novel method for learning a behavioral model of car-following using automata learning algorithms. The model is interpretable for car-following behavior analysis. Frequent common

  3. Cellular Automata in Topology Optimization of Continuum Structures ...

    African Journals Online (AJOL)

    In this paper, an optimization algorithm based on cellular automata (CA) is developed for topology optimization of continuum structures with shear and flexural behavior. The design domain is divided into small triangle elements and each cell is considered as a finite element. The stress analysis is performed by the Constant ...

  4. Supervisory Control of (max,+) automata: a behavioral approach

    Czech Academy of Sciences Publication Activity Database

    Komenda, Jan; Lahaye, S.; Boimond, J.-L.

    2009-01-01

    Roč. 19, č. 4 (2009), s. 525-549 ISSN 0924-6703 Grant - others:EU Projekt(XE) EU.ICT.DISC 224498 Institutional research plan: CEZ:AV0Z10190503 Keywords : timed discrete-event systems * supervisory control * formal power series * (max,+) * automata Subject RIV: BA - General Mathematics Impact factor: 0.921, year: 2009

  5. Efficient Modelling and Generation of Markov Automata (extended version)

    NARCIS (Netherlands)

    Timmer, Mark; Katoen, Joost P.; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette

    2012-01-01

    This paper introduces a framework for the efficient modelling and generation of Markov automata. It consists of (1) the data-rich process-algebraic language MAPA, allowing concise modelling of systems with nondeterminism, probability and Markovian timing; (2) a restricted form of the language, the

  6. Completely reproducible description of digital sound data with cellular automata

    International Nuclear Information System (INIS)

    Wada, Masato; Kuroiwa, Jousuke; Nara, Shigetoshi

    2002-01-01

    A novel method of compressive and completely reproducible description of digital sound data by means of rule dynamics of CA (cellular automata) is proposed. The digital data of spoken words and music recorded with the standard format of a compact disk are reproduced completely by this method with use of only two rules in a one-dimensional CA without loss of information

  7. Scattering rules in soliton cellular automata associated with Uq(D(1)n)-crystal Bn,1

    International Nuclear Information System (INIS)

    Mohamad, Mahathir bin

    2012-01-01

    By means of the crystal theory, we study a class of automata associated with U q (D (1) n )-crystal B n,1 . They have a commuting family of time evolutions, and solitons of length l are labeled by U q (A (1) n−1 )-crystal B 2,l A . The scattering rule of two solitons of lengths l 1 and l 2 (l 1 > l 2 ) including the phase shift is identified with the combinatorial R-matrix for the U q (A (1) n −1 )-crystal B 2,l 2 A ⊗B 2,l 1 A . (paper)

  8. Project RAMA: Reconstructing Asteroids Into Mechanical Automata

    Science.gov (United States)

    Dunn, Jason; Fagin, Max; Snyder, Michael; Joyce, Eric

    2017-01-01

    Many interesting ideas have been conceived for building space-based infrastructure in cislunar space. From O'Neill's space colonies, to solar power satellite farms, and even prospecting retrieved near earth asteroids. In all the scenarios, one thing remained fixed - the need for space resources at the outpost. To satisfy this need, O'Neill suggested an electromagnetic railgun to deliver resources from the lunar surface, while NASA's Asteroid Redirect Mission called for a solar electric tug to deliver asteroid materials from interplanetary space. At Made In Space, we propose an entirely new concept. One which is scalable, cost effective, and ensures that the abundant material wealth of the inner solar system becomes readily available to humankind in a nearly automated fashion. We propose the RAMA architecture, which turns asteroids into self-contained spacecraft capable of moving themselves back to cislunar space. The RAMA architecture is just as capable of transporting conventional-sized asteroids on the 10-meter length scale as transporting asteroids 100 meters or larger, making it the most versatile asteroid retrieval architecture in terms of retrieved-mass capability. This report describes the results of the Phase I study funded by the NASA NIAC program for Made In Space to establish the concept feasibility of using space manufacturing to convert asteroids into autonomous, mechanical spacecraft. Project RAMA, Reconstituting Asteroids into Mechanical Automata, is designed to leverage the future advances of additive manufacturing (AM), in-situ resource utilization (ISRU) and in-situ manufacturing (ISM) to realize enormous efficiencies in repeated asteroid redirect missions. A team of engineers at Made In Space performed the study work with consultation from the asteroid mining industry, academia, and NASA. Previous studies for asteroid retrieval have been constrained to studying only asteroids that are both large enough to be discovered, and small enough to be

  9. MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable

    Directory of Open Access Journals (Sweden)

    Karin Quaas

    2014-03-01

    Full Text Available Parametric timed automata extend timed automata (Alur and Dill, 1991 in that they allow the specification of parametric bounds on the clock values. Since their introduction in 1993 by Alur, Henzinger, and Vardi, it is known that the emptiness problem for parametric timed automata with one clock is decidable, whereas it is undecidable if the automaton uses three or more parametric clocks. The problem is open for parametric timed automata with two parametric clocks. Metric temporal logic, MTL for short, is a widely used specification language for real-time systems. MTL-model checking of timed automata is decidable, no matter how many clocks are used in the timed automaton. In this paper, we prove that MTL-model checking for parametric timed automata is undecidable, even if the automaton uses only one clock and one parameter and is deterministic.

  10. Cellular automata-based artificial life system of horizontal gene transfer

    Directory of Open Access Journals (Sweden)

    Ji-xin Liu

    2016-02-01

    Full Text Available Mutation and natural selection is the core of Darwin's idea about evolution. Many algorithms and models are based on this idea. However, in the evolution of prokaryotes, more and more researches have indicated that horizontal gene transfer (HGT would be much more important and universal than the authors had imagined. Owing to this mechanism, the prokaryotes not only become adaptable in nearly any environment on Earth, but also form a global genetic bank and a super communication network with all the genes of the prokaryotic world. Under this background, they present a novel cellular automata model general gene transfer to simulate and study the vertical gene transfer and HGT in the prokaryotes. At the same time, they use Schrodinger's life theory to formulate some evaluation indices and to discuss the intelligence and cognition of prokaryotes which is derived from HGT.

  11. A federation of simulations based on cellular automata in cyber-physical systems

    Directory of Open Access Journals (Sweden)

    Hoang Van Tran

    2016-02-01

    Full Text Available In cyber-physical system (CPS, cooperation between a variety of computational and physical elements usually poses difficulties to current modelling and simulation tools. Although much research has proposed to address those challenges, most solutions do not completely cover uncertain interactions in CPS. In this paper, we present a new approach to federate simulations for CPS. A federation is a combination of, and coordination between simulations upon a standard of communication. In addition, a mixed simulation is defined as several parallel simulations federated in a common time progress. Such simulations run on the models of physical systems, which are built based on cellular automata theory. The experimental results are performed on a federation of three simulations of forest fire spread, river pollution diffusion and wireless sensor network. The obtained results can be utilized to observe and predict the behaviours of physical systems in their interactions.

  12. A note on limited pushdown alphabets in stateless deterministic pushdown automata

    Czech Academy of Sciences Publication Activity Database

    Masopust, Tomáš

    2013-01-01

    Roč. 24, č. 3 (2013), s. 319-328 ISSN 0129-0541 R&D Projects: GA ČR(CZ) GPP202/11/P028 Institutional support: RVO:67985840 Keywords : deterministic pushdown automata * stateless pushdown automata * realtime pushdown automata Subject RIV: BA - General Mathematics Impact factor: 0.326, year: 2013 http://www.worldscientific.com/doi/abs/10.1142/S0129054113500068

  13. A full computation-relevant topological dynamics classification of elementary cellular automata.

    Science.gov (United States)

    Schüle, Martin; Stoop, Ruedi

    2012-12-01

    Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and chaoticity. The "complex" ECA emerge to be sensitive, but not chaotic and not eventually weakly periodic. Based on this classification, we conjecture that elementary cellular automata capable of carrying out complex computations, such as needed for Turing-universality, are at the "edge of chaos."

  14. Horn clause verification with convex polyhedral abstraction and tree automata-based refinement

    DEFF Research Database (Denmark)

    Kafle, Bishoksan; Gallagher, John Patrick

    2017-01-01

    In this paper we apply tree-automata techniques to refinement of abstract interpretation in Horn clause verification. We go beyond previous work on refining trace abstractions; firstly we handle tree automata rather than string automata and thereby can capture traces in any Horn clause derivations...... underlying the Horn clauses. Experiments using linear constraint problems and the abstract domain of convex polyhedra show that the refinement technique is practical and that iteration of abstract interpretation with tree automata-based refinement solves many challenging Horn clause verification problems. We...... compare the results with other state-of-the-art Horn clause verification tools....

  15. Simulasi Tumbukan Partikel Gas Ideal Dengan Model Cellular Automata Dua Dimensi

    OpenAIRE

    Abdul Basid, Annisa Mujriati

    2010-01-01

    Telah dilakukan simulasi tumbukan partikel gas ideal dengan menggunakan  model cellular automata dua dimensi untuk memvisualisasikan tumbukan partikel gas ideal. Tumbukan partikel  disimulasikan  dengan  menggunakan  model  cellular  automata  dua  dimensi.  Di  dalam cellular automata, pergerakan partikel diatur dengan suatu aturan  yaitu aturan delapan tetangga yang merupakan aturan acak. Hasil program simulasi tumbukan partikel gas ideal dengan model cellular automata dua dimensi  mengguna...

  16. Learning and Model-checking Networks of I/O Automata

    DEFF Research Database (Denmark)

    Mao, Hua; Jaeger, Manfred

    2012-01-01

    We introduce a new statistical relational learning (SRL) approach in which models for structured data, especially network data, are constructed as networks of communicating nite probabilistic automata. Leveraging existing automata learning methods from the area of grammatical inference, we can...... learn generic models for network entities in the form of automata templates. As is characteristic for SRL techniques, the abstraction level aorded by learning generic templates enables one to apply the learned model to new domains. A main benet of learning models based on nite automata lies in the fact...

  17. From Boolean logic to switching circuits and automata. Towards modern information technology

    Energy Technology Data Exchange (ETDEWEB)

    Stankovic, Radomir S. [Nis Univ. (RS). Dept. of Computer Science; Astola, Jaakko [Tampere Univ. of Technology (Finland). Dept. of Signal Processing

    2011-07-01

    Logic networks and automata are facets of digital systems. The change of the design of logic networks from skills and art into a scientific discipline was possible by the development of the underlying mathematical theory called the Switching Theory. The fundamentals of this theory come from the attempts towards an algebraic description of laws of thoughts presented in the works by George J. Boole and the works on logic by Augustus De Morgan. As often the case in engineering, when the importance of a problem and the need for solving it reach certain limits, the solutions are searched by many scholars in different parts of the word, simultaneously or at about the same time, however, quite independently and often unaware of the work by other scholars. The formulation and rise of Switching Theory is such an example. This book presents a brief account of the developments of Switching Theory and highlights some less known facts in the history of it. The readers will find the book a fresh look into the development of the field revealing how difficult it has been to arrive at many of the concepts that we now consider obvious. Researchers in the history or philosophy of computing will find this book a valuable source of information that complements the standard presentations of the topic. (orig.)

  18. Motion Planning in Multi-robot Systems using Timed Automata

    DEFF Research Database (Denmark)

    Andersen, Michael. S.; Jensen, Rune S.; Bak, Thomas

    This paper dscribes how interacting timed automata can be used to model, analyze, and verify motion planning problems for systems with multiple mobile robots. The method assumes an infra-structure of simple unicycle type robots, moving om a planar grid. The motion of the robots, including simple...... kinematics, is captured in an automata formalism that allows formal composition and symbolic reasoning. The verification software UppAal is used to verify specification requirements formulated in computational tree logic (CTL), generating all feasible trajectories that satisfy specifications. The results...... of the planning are demonstrateted in a testbed that allows execution of the planned paths and motion primitives by synchronizing the planning results from UppAal with actual robotic vehicles. The planning problem may be modified online by moving obstacles in the physical environment, which causes a re...

  19. Interpolant tree automata and their application in Horn clause verification

    DEFF Research Database (Denmark)

    Kafle, Bishoksan; Gallagher, John Patrick

    2016-01-01

    This paper investigates the combination of abstract interpretation over the domain of convex polyhedra with interpolant tree automata, in an abstraction-refinement scheme for Horn clause verification. These techniques have been previously applied separately, but are combined in a new way in this ......This paper investigates the combination of abstract interpretation over the domain of convex polyhedra with interpolant tree automata, in an abstraction-refinement scheme for Horn clause verification. These techniques have been previously applied separately, but are combined in a new way...... clause verification problems indicates that the combination of interpolant tree automaton with abstract interpretation gives some increase in the power of the verification tool, while sometimes incurring a performance overhead....

  20. Station Model for Rail Transit System Using Cellular Automata

    International Nuclear Information System (INIS)

    Xun Jing; Ning Bin; Li Keping

    2009-01-01

    In this paper, we propose a new cellular automata model to simulate the railway traffic at station. Based on NaSch model, the proposed station model is composed of the main track and the siding track. Two different schemes for trains passing through station are considered. One is the scheme of 'pass by the main track, start and stop by the siding track'. The other is the scheme of 'two tracks play the same role'. We simulate the train movement using the proposed model and analyze the traffic flow at station. The simulation results demonstrate that the proposed cellular automata model can be successfully used for the simulations of railway traffic. Some characteristic behaviors of railway traffic flow can be reproduced. Moreover, the simulation values of the minimum headway are close to the theoretical values. This result demonstrates the dependability and availability of the proposed model. (general)

  1. Universality of two-dimensional critical cellular automata

    OpenAIRE

    Bollobás, Béla; Duminil-Copin, Hugo; Morris, Robert; Smith, Paul

    2014-01-01

    We study the class of monotone, two-state, deterministic cellular automata, in which sites are activated (or `infected') by certain configurations of nearby infected sites. These models have close connections to statistical physics, and several specific examples have been extensively studied in recent years by both mathematicians and physicists. This general setting was first studied only recently, however, by Bollob\\'as, Smith and Uzzell, who showed that the family of all such `bootstrap per...

  2. Reconfigurable control of a power plant deaerator using learning automata

    International Nuclear Information System (INIS)

    Garcia, H.E.; Ray, A.; Edwards, R.M.

    1991-01-01

    A deaerating feedwater heater, equipped with a water level controller and a pressure controller, has been chosen to investigate the feasibility of a reconfigurable control scheme for power plants by incorporating the concept of learning automata. In this paper simulation results based on a model of the Experimental Breeder Reactor (EBR-II) at the Argonne National Laboratory site in Idaho are presented to demonstrate the efficacy of the reconfigurable control scheme

  3. A Markov Process Inspired Cellular Automata Model of Road Traffic

    OpenAIRE

    Wang, Fa; Li, Li; Hu, Jianming; Ji, Yan; Yao, Danya; Zhang, Yi; Jin, Xuexiang; Su, Yuelong; Wei, Zheng

    2008-01-01

    To provide a more accurate description of the driving behaviors in vehicle queues, a namely Markov-Gap cellular automata model is proposed in this paper. It views the variation of the gap between two consequent vehicles as a Markov process whose stationary distribution corresponds to the observed distribution of practical gaps. The multiformity of this Markov process provides the model enough flexibility to describe various driving behaviors. Two examples are given to show how to specialize i...

  4. Multidimensional cellular automata and generalization of Fekete's lemma

    Directory of Open Access Journals (Sweden)

    Silvio Capobianco

    2008-08-01

    Full Text Available Fekete's lemma is a well known combinatorial result on number sequences: we extend it to functions defined on $d$-tuples of integers. As an application of the new variant, we show that nonsurjective $d$-dimensional cellular automata are characterized by loss of arbitrarily much information on finite supports, at a growth rate greater than that of the support's boundary determined by the automaton's neighbourhood index.

  5. Dualities for multi-state probabilistic cellular automata

    International Nuclear Information System (INIS)

    López, F Javier; Sanz, Gerardo; Sobottka, Marcelo

    2008-01-01

    In this paper a new form of duality for probabilistic cellular automata (PCA) is introduced. Using this duality, an ergodicity result for processes having a dual is proved. Also, conditions on the probabilities defining the evolution of the processes for the existence of a dual are provided. The results are applied to wide classes of PCA which include multi-opinion voter models, competition models and the Domany–Kinzel model

  6. Generalized hydrodynamic transport in lattice-gas automata

    Science.gov (United States)

    Luo, Li-Shi; Chen, Hudong; Chen, Shiyi; Doolen, Gary D.; Lee, Yee-Chun

    1991-01-01

    The generalized hydrodynamics of two-dimensional lattice-gas automata is solved analytically in the linearized Boltzmann approximation. The dependence of the transport coefficients (kinematic viscosity, bulk viscosity, and sound speed) upon wave number k is obtained analytically. Anisotropy of these coefficients due to the lattice symmetry is studied for the entire range of wave number, k. Boundary effects due to a finite mean free path (Knudsen layer) are analyzed, and accurate comparisons are made with lattice-gas simulations.

  7. Bisimulation for Higher-Dimensional Automata. A Geometric Interpretation

    DEFF Research Database (Denmark)

    Fahrenberg, Ulrich

    We show how parallel compostition of higher-dimensional automata (HDA) can be expressed categorically in the spirit of Winskel & Nielsen. Employing the notion of computation path introduced by van Glabbeek, we define a new notion of bisimulation of HDA using open maps. We derive a connection...... between computation paths and carrier sequences of dipaths and show that bisimilarity of HDA can be decided by the use of geometric techniques....

  8. Dynamical phase transitions in spin models and automata

    International Nuclear Information System (INIS)

    Derrida, B.

    1989-01-01

    Some of the models and methods developed in the study of the dynamics of spin models and automata are described. Special attention is given to the distance method which consists of comparing the time evolution of two configurations. The method is used to obtain the phase boundary between a frozen and a chaotic phase in the case of deterministic models. For stochastic systems the method is used to obtain dynamical phase transitions

  9. The adaptive cruise control vehicles in the cellular automata model

    International Nuclear Information System (INIS)

    Jiang Rui; Wu Qingsong

    2006-01-01

    This Letter presented a cellular automata model where the adaptive cruise control vehicles are modelled. In this model, the constant time headway policy is adopted. The fundamental diagram is presented. The simulation results are in good agreement with the analytical ones. The mixture of ACC vehicles with manually driven vehicles is investigated. It is shown that with the introduction of ACC vehicles, the jam can be suppressed

  10. Discovering Motifs in Biological Sequences Using the Micron Automata Processor.

    Science.gov (United States)

    Roy, Indranil; Aluru, Srinivas

    2016-01-01

    Finding approximately conserved sequences, called motifs, across multiple DNA or protein sequences is an important problem in computational biology. In this paper, we consider the (l, d) motif search problem of identifying one or more motifs of length l present in at least q of the n given sequences, with each occurrence differing from the motif in at most d substitutions. The problem is known to be NP-complete, and the largest solved instance reported to date is (26,11). We propose a novel algorithm for the (l,d) motif search problem using streaming execution over a large set of non-deterministic finite automata (NFA). This solution is designed to take advantage of the micron automata processor, a new technology close to deployment that can simultaneously execute multiple NFA in parallel. We demonstrate the capability for solving much larger instances of the (l, d) motif search problem using the resources available within a single automata processor board, by estimating run-times for problem instances (39,18) and (40,17). The paper serves as a useful guide to solving problems using this new accelerator technology.

  11. Study of spatially extended dynamical systems using probabilistic cellular automata

    International Nuclear Information System (INIS)

    Vanag, Vladimir K

    1999-01-01

    Spatially extended dynamical systems are ubiquitous and include such things as insect and animal populations; complex chemical, technological, and geochemical processes; humanity itself, and much more. It is clearly desirable to have a certain universal tool with which the highly complex behaviour of nonlinear dynamical systems can be analyzed and modelled. For this purpose, cellular automata seem to be good candidates. In the present review, emphasis is placed on the possibilities that various types of probabilistic cellular automata (PCA), such as DSMC (direct simulation Monte Carlo) and LGCA (lattice-gas cellular automata), offer. The methods are primarily designed for modelling spatially extended dynamical systems with inner fluctuations accounted for. For the Willamowskii-Roessler and Oregonator models, PCA applications to the following problems are illustrated: the effect of fluctuations on the dynamics of nonlinear systems; Turing structure formation; the effect of hydrodynamic modes on the behaviour of nonlinear chemical systems (stirring effects); bifurcation changes in the dynamical regimes of complex systems with restricted geometry or low spatial dimension; and the description of chemical systems in microemulsions. (reviews of topical problems)

  12. Self-organisation in Cellular Automata with Coalescent Particles: Qualitative and Quantitative Approaches

    Science.gov (United States)

    Hellouin de Menibus, Benjamin; Sablik, Mathieu

    2017-06-01

    This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial configuration at random according to some initial shift-ergodic measure, and use the limit measure to describe the asymptotic behaviour of the automata. We first take a qualitative approach, i.e. we obtain information on the limit measure(s). We prove that only particles moving in one particular direction can persist asymptotically. This provides some previously unknown information on the limit measures of various deterministic and probabilistic cellular automata: 3 and 4-cyclic cellular automata [introduced by Fisch (J Theor Probab 3(2):311-338, 1990; Phys D 45(1-3):19-25, 1990)], one-sided captive cellular automata [introduced by Theyssier (Captive Cellular Automata, 2004)], the majority-traffic cellular automaton, a self stabilisation process towards a discrete line [introduced by Regnault and Rémila (in: Mathematical Foundations of Computer Science 2015—40th International Symposium, MFCS 2015, Milan, Italy, Proceedings, Part I, 2015)]. In a second time we restrict our study to a subclass, the gliders cellular automata. For this class we show quantitative results, consisting in the asymptotic law of some parameters: the entry times [generalising K ůrka et al. (in: Proceedings of AUTOMATA, 2011)], the density of particles and the rate of convergence to the limit measure.

  13. A new recursive incremental algorithm for building minimal acyclic deterministic finite automata

    NARCIS (Netherlands)

    Watson, B.W.; Martin-Vide, C.; Mitrana, V.

    2003-01-01

    This chapter presents a new algorithm for incrementally building minimal acyclic deterministic finite automata. Such minimal automata are a compact representation of a finite set of words (e.g. in a spell checker). The incremental aspect of such algorithms (where the intermediate automaton is

  14. PRM113 - Timed Automata Modeling of The Personalized Treatment Decisions In Metastatic Castration Resistant Prostate Cancer

    NARCIS (Netherlands)

    Schivo, Stefano; Degeling, K.; Degeling, Koen; Koffijberg, Hendrik; IJzerman, Maarten Joost; Langerak, Romanus

    2015-01-01

    Objectives The Timed Automata modeling paradigm has emerged from Computer Science as a mature tool for the functional analysis and performance evaluation of timed distributed systems. This study is a first exploration of the suitability of Timed Automata for health economic modeling, using a case

  15. Characterization of the permutations by block that have reversible one dimensional cellular automata; Caracterizacion de las permutaciones en bloque que representan automatas celulares unidimensionales reversibles

    Energy Technology Data Exchange (ETDEWEB)

    Seck Tuoh Mora, J. C. [Instituto Politecnico Nacional, Mexico, D. F. (Mexico)

    2001-06-01

    We present a review of reversible one dimensional cellular automata and their representation by block permutations. We analyze in detail the behavior of such block permutations to get their characterization. [Spanish] En el siguiente escrito se da una revision a la representacion y comportamiento de automatas celulares unidimensionales reversibles por medio de permutaciones en bloque. Hacemos un analisis detallado del comportamiento de dichas permutaciones para obtener su caracterizacion.

  16. Statistical hydrodynamics of lattice-gas automata

    OpenAIRE

    Grosfils, Patrick; Boon, Jean-Pierre; Brito López, Ricardo; Ernst, M. H.

    1993-01-01

    We investigate the space and time behavior of spontaneous thermohydrodynamic fluctuations in a simple fluid modeled by a lattice-gas automaton and develop the statistical-mechanical theory of thermal lattice gases to compute the dynamical structure factor, i.e., the power spectrum of the density correlation function. A comparative analysis of the theoretical predictions with our lattice gas simulations is presented. The main results are (i) the spectral function of the lattice-gas fluctuation...

  17. Teaching Group Theory Using Rubik's Cubes

    Science.gov (United States)

    Cornock, Claire

    2015-01-01

    Being situated within a course at the applied end of the spectrum of maths degrees, the pure mathematics modules at Sheffield Hallam University have an applied spin. Pure topics are taught through consideration of practical examples such as knots, cryptography and automata. Rubik's cubes are used to teach group theory within a final year pure…

  18. A theory of desynchronisable closed loops system

    NARCIS (Netherlands)

    Beohar, H.; Cuijpers, P.J.L.; Bliudze, S.; Bruni, R.; Grohmann, D.; Silva, A.

    2010-01-01

    The task of implementing a supervisory controller is non-trivial, even though different theories exist that allow automatic synthesis of these controllers in the form of automata. One of the reasons for this discord is due to the asynchronous interaction between a plant and its controller in

  19. Reversible one-dimensional cellular automata with one of the two Welch indices equal to 1 and full shifts

    International Nuclear Information System (INIS)

    Mora, Juan Carlos Seck Tuoh; Hernandez, Manuel Gonzalez; Vergara, Sergio V Chapa

    2003-01-01

    Reversible cellular automata are invertible discrete dynamical systems which have been widely studied both for analysing interesting theoretical questions and for obtaining relevant practical applications, for instance, simulating invertible natural systems or implementing data coding devices. An important problem in the theory of reversible automata is to know how the local behaviour which is not invertible is able to yield a reversible global one. In this sense, symbolic dynamics plays an important role for obtaining an adequate representation of a reversible cellular automaton. In this paper we prove the equivalence between a reversible automaton where the ancestors only differ at one side (technically with one of the two Welch indices equal to 1) and a full shift. We represent any reversible automaton by a de Bruijn diagram, and we characterize the way in which the diagram produces an evolution formed by undefined repetitions of two states. By means of amalgamations, we prove that there is always a way of transforming a de Bruijn diagram into the full shift. Finally, we provide an example illustrating the previous results

  20. Reversible one-dimensional cellular automata with one of the two Welch indices equal to 1 and full shifts

    Energy Technology Data Exchange (ETDEWEB)

    Mora, Juan Carlos Seck Tuoh [Centro de Investigacion Avanzada en Ingenieria Industrial, Universidad Autonoma del Estado de Hidalgo, Carr Pachuca-Tulancingo Km 4.5, 42020 Pachuca (Mexico); Hernandez, Manuel Gonzalez [Centro de Investigacion Avanzada en Ingenieria Industrial, Universidad Autonoma del Estado de Hidalgo, Carr Pachuca-Tulancingo Km 4.5, 42020 Pachuca (Mexico); Vergara, Sergio V Chapa [Depto de Ingenieria Electrica, Seccion Computacion, Centro de Investigacion y de Estudios Avanzados, Instituto Politecnico Nacional, Av IPN 2508, Col San Pedro Zacatenco, 07300 DF (Mexico)

    2003-07-25

    Reversible cellular automata are invertible discrete dynamical systems which have been widely studied both for analysing interesting theoretical questions and for obtaining relevant practical applications, for instance, simulating invertible natural systems or implementing data coding devices. An important problem in the theory of reversible automata is to know how the local behaviour which is not invertible is able to yield a reversible global one. In this sense, symbolic dynamics plays an important role for obtaining an adequate representation of a reversible cellular automaton. In this paper we prove the equivalence between a reversible automaton where the ancestors only differ at one side (technically with one of the two Welch indices equal to 1) and a full shift. We represent any reversible automaton by a de Bruijn diagram, and we characterize the way in which the diagram produces an evolution formed by undefined repetitions of two states. By means of amalgamations, we prove that there is always a way of transforming a de Bruijn diagram into the full shift. Finally, we provide an example illustrating the previous results.

  1. Lattice gas automata simulations of flow through porous media

    International Nuclear Information System (INIS)

    Matsukuma, Yosuke; Abe, Yutaka; Adachi, Hiromichi; Takahashi, Ryoichi

    1998-01-01

    In the course of a severe accident, a debris bed may be formed from once- molten and fragmented fuel elements. In order to avoid further degradation of the reactor core, it is necessary to remove the heat from the debris bed since the debris bed still release the decay heat. So as to predict the coolability of the debris bed, it is important to precisely estimate flow patterns through complex geometry of debris bed in microscopic level. Lattice gas automata could be powerful tool to simulate such a complex geometry. As a first step of the study, fundamental numerical simulation were conducted in two dimensional systems by using the lattice gas automata method to clarify single phase flow patterns through porous media in mesoscopic level. Immiscible lattice gas model is one of the lattice gas automata method and utilized for spinodal decomposition simulation of binary fluids. This model was applied to generate the complex flow geometry simulating porous media. It was approved that the complex flow geometries were successfully generated by the present method. Flow concentration was observed in specified flow channels for lower Reynolds number. Two dimensional flow concentration was caused by the irregular flow geometry generated by the present method, since the flow selects the channels of lower friction. Two dimensional pressure distribution was observed relating to the concentrations of flow in specified channels. The simulating results of the flow through the porous media by the present method qualitatively agree with the Ergun's equation. Quantitatively, the present results approach to Ergun's equation in higher Reynolds number than 10, although concentration of the flow in a specified flow channels were observed in lower Reynolds number than 10. It can be concluded that this technique is useful is useful to simulate flow through complex geometry like porous media. (author)

  2. Cellular automata codebooks applied to compact image compression

    Directory of Open Access Journals (Sweden)

    Radu DOGARU

    2006-12-01

    Full Text Available Emergent computation in semi-totalistic cellular automata (CA is used to generate a set of basis (or codebook. Such codebooks are convenient for simple and circuit efficient compression schemes based on binary vector quantization, applied to the bitplanes of any monochrome or color image. Encryption is also naturally included using these codebooks. Natural images would require less than 0.5 bits per pixel (bpp while the quality of the reconstructed images is comparable with traditional compression schemes. The proposed scheme is attractive for low power, sensor integrated applications.

  3. Reliable self-replicating machines in asynchronous cellular automata.

    Science.gov (United States)

    Lee, Jia; Adachi, Susumu; Peper, Ferdinand

    2007-01-01

    We propose a self-replicating machine that is embedded in a two-dimensional asynchronous cellular automaton with von Neumann neighborhood. The machine dynamically encodes its shape into description signals, and despite the randomness of cell updating, it is able to successfully construct copies of itself according to the description signals. Self-replication on asynchronously updated cellular automata may find application in nanocomputers, where reconfigurability is an essential property, since it allows avoidance of defective parts and simplifies programming of such computers.

  4. A Cellular Automata Model of Infection Control on Medical Implants

    Science.gov (United States)

    Prieto-Langarica, Alicia; Kojouharov, Hristo; Chen-Charpentier, Benito; Tang, Liping

    2011-01-01

    S. epidermidis infections on medically implanted devices are a common problem in modern medicine due to the abundance of the bacteria. Once inside the body, S. epidermidis gather in communities called biofilms and can become extremely hard to eradicate, causing the patient serious complications. We simulate the complex S. epidermidis-Neutrophils interactions in order to determine the optimum conditions for the immune system to be able to contain the infection and avoid implant rejection. Our cellular automata model can also be used as a tool for determining the optimal amount of antibiotics for combating biofilm formation on medical implants. PMID:23543851

  5. Two Novel Quantum-Dot Cellular Automata Full Adders

    Directory of Open Access Journals (Sweden)

    Mahdie Qanbari

    2013-01-01

    Full Text Available Quantum-dot cellular automata (QCA is an efficient technology to create computing devices. QCA is a suitable candidate for the next generation of digital systems. Full adders are the main member of computational systems because other operations can be implemented by adders. In this paper, two QCA full adders are introduced. The first one is implemented in one layer, and the second one is implemented in three layers. Five-input majority gate is used in both of them. These full adders are better than pervious designs in terms of area, delay, and complexity.

  6. The power of reachability testing for timed automata

    DEFF Research Database (Denmark)

    Aceto, Luca; Bouyer, Patricia; Burgueno, A.

    2003-01-01

    The computational engine of the verification tool UPPAAL consists of a collection of efficient algorithms for the analysis of reachability properties of systems. Model-checking of properties other than plain reachability ones may currently be carried out in such a tool as follows. Given a propert...... be reached. Finally, the property language characterizing the power of reachability testing is used to provide a definition of characteristic properties with respect to a timed version of the ready simulation preorder, for nodes of tau-free, deterministic timed automata....

  7. Connection machine: a computer architecture based on cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Hillis, W D

    1984-01-01

    This paper describes the connection machine, a programmable computer based on cellular automata. The essential idea behind the connection machine is that a regular locally-connected cellular array can be made to behave as if the processing cells are connected into any desired topology. When the topology of the machine is chosen to match the topology of the application program, the result is a fast, powerful computing engine. The connection machine was originally designed to implement knowledge retrieval operations in artificial intelligence programs, but the hardware and the programming techniques are apparently applicable to a much larger class of problems. A machine with 100000 processing cells is currently being constructed. 27 references.

  8. Network reliability assessment using a cellular automata approach

    International Nuclear Information System (INIS)

    Rocco S, Claudio M.; Moreno, Jose Ali

    2002-01-01

    Two cellular automata (CA) models that evaluate the s-t connectedness and shortest path in a network are presented. CA based algorithms enhance the performance of classical algorithms, since they allow a more reliable and straightforward parallel implementation resulting in a dynamic network evaluation, where changes in the connectivity and/or link costs can readily be incorporated avoiding recalculation from scratch. The paper also demonstrates how these algorithms can be applied for network reliability evaluation (based on Monte-Carlo approach) and for finding s-t path with maximal reliability

  9. Algorithmic Approach to Abstracting Linear Systems by Timed Automata

    DEFF Research Database (Denmark)

    Sloth, Christoffer; Wisniewski, Rafael

    2011-01-01

    This paper proposes an LMI-based algorithm for abstracting dynamical systems by timed automata, which enables automatic formal verification of linear systems. The proposed abstraction is based on partitioning the state space of the system using positive invariant sets, generated by Lyapunov...... functions. This partitioning ensures that the vector field of the dynamical system is transversal to all facets of the cells, which induces some desirable properties of the abstraction. The algorithm is based on identifying intersections of level sets of quadratic Lyapunov functions, and determining...

  10. A Formal Theory of Perception. Technical Report No. 161.

    Science.gov (United States)

    Rottmayer, William Arthur

    An attempt to build a mathematical model of a device that could learn geometry is discussed. The report discusses the background and motivation of the study, the coding problem, the derivation of Suppes "Stimulus-Response Theory of Finite Automata" used in the work in learning theory, and a summary of the technical work. (DB)

  11. Essay on a general theory of nervous system functions

    Energy Technology Data Exchange (ETDEWEB)

    Schweizer, H J

    1985-01-01

    The axiomatic theory unites the aspects of neurophysiology, psychology and system-theory. The formulation of the structural-nucleus of the theory relies on basic insights from biology, neurophysiology and system-theory. The structural-nucleus allows the reconstruction of the essential properties of nervous system functions, organisation and development. The theory also contributes to the discussion of stochastic automata and artificial intelligence.

  12. Definition and evolution of quantum cellular automata with two qubits per cell

    International Nuclear Information System (INIS)

    Karafyllidis, Ioannis G.

    2004-01-01

    Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical systems and processes. It is however known that except for the trivial case, unitary evolution of one-dimensional homogeneous quantum cellular automata with one qubit per cell is not possible. Quantum cellular automata that comprise two qubits per cell are defined and their evolution is studied using a quantum computer simulator. The evolution is unitary and its linearity manifests itself as a periodic structure in the probability distribution patterns

  13. Controller synthesis for dynamic hierarchical real-time plants using timed automata

    DEFF Research Database (Denmark)

    Bin Waez, Md Tawhid; Wasowski, Andrzej; Dingel, Juergen

    2017-01-01

    We use timed I/O automata based timed games to synthesize task-level reconfiguration services for cost-effective fault tolerance in a case study. The case study shows that state-space explosion is a severe problem for timed games. By applying suitable abstractions, we dramatically improve...... the scalability. However, timed I/O automata do not facilitate algorithmic abstraction generation techniques. The case study motivates the development of timed process automata to improve modeling and analysis for controller synthesis of time-critical plants which can be hierarchical and dynamic. The model offers...

  14. An automata model of granular materials

    International Nuclear Information System (INIS)

    Gutt, G.M.; Haff, P.K.

    1990-01-01

    In this paper a new modeling technique (the Lattice Grain Model) is presented for the simulation of two-dimensional granular systems involving large numbers of grains. These granular systems may include both high shear rate regions as well as static plugs of grains and cannot easily be handled within the framework of existing continuum theories such as soil mechanics. The Lattice Grain Model (LGrM) is similar to the Lattice Gas Model (LBM). This allows large simulations to be programmed onto a hypercube concurrent processor in a straightforward manner. However, it differs from LBM in that it includes the inelastic collisions and volume-filling properties of macroscopic grains. Examples to be presented will include Couette flow, flow through an hourglass, and gravity-driven flows around obstacles

  15. Simulation of root forms using cellular automata model

    International Nuclear Information System (INIS)

    Winarno, Nanang; Prima, Eka Cahya; Afifah, Ratih Mega Ayu

    2016-01-01

    This research aims to produce a simulation program for root forms using cellular automata model. Stephen Wolfram in his book entitled “A New Kind of Science” discusses the formation rules based on the statistical analysis. In accordance with Stephen Wolfram’s investigation, the research will develop a basic idea of computer program using Delphi 7 programming language. To best of our knowledge, there is no previous research developing a simulation describing root forms using the cellular automata model compared to the natural root form with the presence of stone addition as the disturbance. The result shows that (1) the simulation used four rules comparing results of the program towards the natural photographs and each rule had shown different root forms; (2) the stone disturbances prevent the root growth and the multiplication of root forms had been successfully modeled. Therefore, this research had added some stones, which have size of 120 cells placed randomly in the soil. Like in nature, stones cannot be penetrated by plant roots. The result showed that it is very likely to further develop the program of simulating root forms by 50 variations

  16. Interpolant Tree Automata and their Application in Horn Clause Verification

    Directory of Open Access Journals (Sweden)

    Bishoksan Kafle

    2016-07-01

    Full Text Available This paper investigates the combination of abstract interpretation over the domain of convex polyhedra with interpolant tree automata, in an abstraction-refinement scheme for Horn clause verification. These techniques have been previously applied separately, but are combined in a new way in this paper. The role of an interpolant tree automaton is to provide a generalisation of a spurious counterexample during refinement, capturing a possibly infinite set of spurious counterexample traces. In our approach these traces are then eliminated using a transformation of the Horn clauses. We compare this approach with two other methods; one of them uses interpolant tree automata in an algorithm for trace abstraction and refinement, while the other uses abstract interpretation over the domain of convex polyhedra without the generalisation step. Evaluation of the results of experiments on a number of Horn clause verification problems indicates that the combination of interpolant tree automaton with abstract interpretation gives some increase in the power of the verification tool, while sometimes incurring a performance overhead.

  17. Vesicle computers: Approximating a Voronoi diagram using Voronoi automata

    International Nuclear Information System (INIS)

    Adamatzky, Andrew; De Lacy Costello, Ben; Holley, Julian; Gorecki, Jerzy; Bull, Larry

    2011-01-01

    Highlights: → We model irregular arrangements of vesicles filled with chemical systems. → We examine influence of precipitation threshold on the system's computational potential. → We demonstrate computation of Voronoi diagram and skeleton. - Abstract: Irregular arrangements of vesicles filled with excitable and precipitating chemical systems are imitated by Voronoi automata - finite-state machines defined on a planar Voronoi diagram. Every Voronoi cell takes four states: resting, excited, refractory and precipitate. A resting cell excites if it has at least one neighbour in an excited state. The cell precipitates if the ratio of excited cells in its neighbourhood versus the number of neighbours exceeds a certain threshold. To approximate a Voronoi diagram on Voronoi automata we project a planar set onto the automaton lattice, thus cells corresponding to data-points are excited. Excitation waves propagate across the Voronoi automaton, interact with each other and form precipitate at the points of interaction. The configuration of the precipitate represents the edges of an approximated Voronoi diagram. We discover the relationship between the quality of the Voronoi diagram approximation and the precipitation threshold, and demonstrate the feasibility of our model in approximating Voronoi diagrams of arbitrary-shaped objects and in constructing a skeleton of a planar shape.

  18. Modeling evolution and immune system by cellular automata

    International Nuclear Information System (INIS)

    Bezzi, M.

    2001-01-01

    In this review the behavior of two different biological systems is investigated using cellular automata. Starting from this spatially extended approach it is also tried, in some cases, to reduce the complexity of the system introducing mean-field approximation, and solving (or trying to solve) these simplified systems. It is discussed the biological meaning of the results, the comparison with experimental data (if available) and the different features between spatially extended and mean-field versions. The biological systems considered in this review are the following: Darwinian evolution in simple ecosystems and immune system response. In the first section the main features of molecular evolution are introduced, giving a short survey of genetics for physicists and discussing some models for prebiotic systems and simple ecosystems. It is also introduced a cellular automaton model for studying a set of evolving individuals in a general fitness landscape, considering also the effects of co-evolution. In particular the process of species formation (speciation) is described in sect. 5. The second part deals with immune system modeling. The biological features of immune response are discussed, as well as it is introduced the concept of shape space and of idiotypic network. More detailed reviews which deal with immune system models (mainly focused on idiotypic network models) can be found. Other themes here discussed: the applications of CA to immune system modeling, two complex cellular automata for humoral and cellular immune response. Finally, it is discussed the biological data and the general conclusions are drawn in the last section

  19. Creating Clinical Fuzzy Automata with Fuzzy Arden Syntax.

    Science.gov (United States)

    de Bruin, Jeroen S; Steltzer, Heinz; Rappelsberger, Andrea; Adlassnig, Klaus-Peter

    2017-01-01

    Formal constructs for fuzzy sets and fuzzy logic are incorporated into Arden Syntax version 2.9 (Fuzzy Arden Syntax). With fuzzy sets, the relationships between measured or observed data and linguistic terms are expressed as degrees of compatibility that model the unsharpness of the boundaries of linguistic terms. Propositional uncertainty due to incomplete knowledge of relationships between clinical linguistic concepts is modeled with fuzzy logic. Fuzzy Arden Syntax also supports the construction of fuzzy state monitors. The latter are defined as monitors that employ fuzzy automata to observe gradual transitions between different stages of disease. As a use case, we re-implemented FuzzyARDS, a previously published clinical monitoring system for patients suffering from acute respiratory distress syndrome (ARDS). Using the re-implementation as an example, we show how key concepts of fuzzy automata, i.e., fuzzy states and parallel fuzzy state transitions, can be implemented in Fuzzy Arden Syntax. The results showed that fuzzy state monitors can be implemented in a straightforward manner.

  20. Optimal Design of Gravitational Sewer Networks with General Cellular Automata

    Directory of Open Access Journals (Sweden)

    Mohammad Hadi Afshar

    2014-05-01

    Full Text Available In this paper, a Cellular Automata method is applied for the optimal design of sewer networks. The solution of sewer network optimization problems requires the determination of pipe diameters and average pipe cover depths, minimizing the total cost of the sewer network subject to operational constraints. In this paper, the network nodes and upstream and downstream pipe cover depths are considered as CA cells and cell states, respectively, and the links around each cell are taken into account as neighborhood. The proposed method is a general and flexible method for the optimization of sewer networks as it can be used to optimally design both gravity and pumped network due to the use of pipe nodal cover depths as the decision variables. The proposed method is tested against two  gravitational sewer networks and the  comparison of results with other methods such as  Genetic algorithm, Cellular Automata, Ant Colony Optimization Algorithm and Particle Swarm Optimization show the efficiency and effectiveness of the proposed method.

  1. Simulation of root forms using cellular automata model

    Energy Technology Data Exchange (ETDEWEB)

    Winarno, Nanang, E-mail: nanang-winarno@upi.edu; Prima, Eka Cahya [International Program on Science Education, Universitas Pendidikan Indonesia, Jl. Dr. Setiabudi no 229, Bandung40154 (Indonesia); Afifah, Ratih Mega Ayu [Department of Physics Education, Post Graduate School, Universitas Pendidikan Indonesia, Jl. Dr. Setiabudi no 229, Bandung40154 (Indonesia)

    2016-02-08

    This research aims to produce a simulation program for root forms using cellular automata model. Stephen Wolfram in his book entitled “A New Kind of Science” discusses the formation rules based on the statistical analysis. In accordance with Stephen Wolfram’s investigation, the research will develop a basic idea of computer program using Delphi 7 programming language. To best of our knowledge, there is no previous research developing a simulation describing root forms using the cellular automata model compared to the natural root form with the presence of stone addition as the disturbance. The result shows that (1) the simulation used four rules comparing results of the program towards the natural photographs and each rule had shown different root forms; (2) the stone disturbances prevent the root growth and the multiplication of root forms had been successfully modeled. Therefore, this research had added some stones, which have size of 120 cells placed randomly in the soil. Like in nature, stones cannot be penetrated by plant roots. The result showed that it is very likely to further develop the program of simulating root forms by 50 variations.

  2. Automata network models of galaxy evolution

    Science.gov (United States)

    Chappell, David; Scalo, John

    1993-01-01

    Two ideas appear frequently in theories of star formation and galaxy evolution: (1) star formation is nonlocally excitatory, stimulating star formation in neighboring regions by propagation of a dense fragmenting shell or the compression of preexisting clouds; and (2) star formation is nonlocally inhibitory, making H2 regions and explosions which can create low-density and/or high temperature regions and increase the macroscopic velocity dispersion of the cloudy gas. Since it is not possible, given the present state of hydrodynamic modeling, to estimate whether one of these effects greatly dominates the other, it is of interest to investigate the predicted spatial pattern of star formation and its temporal behavior in simple models which incorporate both effects in a controlled manner. The present work presents preliminary results of such a study which is based on lattice galaxy models with various types of nonlocal inhibitory and excitatory couplings of the local SFR to the gas density, temperature, and velocity field meant to model a number of theoretical suggestions.

  3. Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings

    NARCIS (Netherlands)

    Daciuk, J; Champarnaud, JM; Maurel, D

    2003-01-01

    This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state automata (recognizers) from sets of words. Incremental, semi-incremental, and non-incremental methods have been implemented and evaluated.

  4. Modeling chemical systems using cellular automata a textbook and laboratory manual

    CERN Document Server

    Kier, Lemont B; Cheng, Chao-Kun

    2005-01-01

    There are few publications on Cellular Automata and certainly no direct competition Insight into a new modeling paradigm Novel approach to the use of in silico modeling to replace or supplement costly labs.

  5. Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity

    Science.gov (United States)

    Louis, S.J.; Raines, G.L.

    2003-01-01

    We use a genetic algorithm to calibrate a spatially and temporally resolved cellular automata to model mining activity on public land in Idaho and western Montana. The genetic algorithm searches through a space of transition rule parameters of a two dimensional cellular automata model to find rule parameters that fit observed mining activity data. Previous work by one of the authors in calibrating the cellular automaton took weeks - the genetic algorithm takes a day and produces rules leading to about the same (or better) fit to observed data. These preliminary results indicate that genetic algorithms are a viable tool in calibrating cellular automata for this application. Experience gained during the calibration of this cellular automata suggests that mineral resource information is a critical factor in the quality of the results. With automated calibration, further refinements of how the mineral-resource information is provided to the cellular automaton will probably improve our model.

  6. Quantum Genetics in terms of Quantum Reversible Automata and Quantum Computation of Genetic Codes and Reverse Transcription

    CERN Document Server

    Baianu,I C

    2004-01-01

    The concepts of quantum automata and quantum computation are studied in the context of quantum genetics and genetic networks with nonlinear dynamics. In previous publications (Baianu,1971a, b) the formal concept of quantum automaton and quantum computation, respectively, were introduced and their possible implications for genetic processes and metabolic activities in living cells and organisms were considered. This was followed by a report on quantum and abstract, symbolic computation based on the theory of categories, functors and natural transformations (Baianu,1971b; 1977; 1987; 2004; Baianu et al, 2004). The notions of topological semigroup, quantum automaton, or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. Further, detailed studies of nonlinear dynamics in genetic networks were carried out in categories of n-valued, Lukasiewicz Logic Algebra...

  7. Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata

    Directory of Open Access Journals (Sweden)

    Karine Altisen

    2010-06-01

    Full Text Available To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC and timed automata (TA, in order to take advantage of the strengths of each technique for analyzing various components. But the time to analyze a state-based component modeled by TA may be prohibitively high, due to the state space explosion problem. In this paper, we propose a framework of granularity-based interfacing to speed up the analysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granularities and then based on RTC theory, we derive lower and upper bounds on arrival patterns of the fine output streams using the causality closure algorithm. Our framework can help to achieve tradeoffs between precision and analysis time.

  8. Deterministic one-way simulation of two-way, real-time cellular automata and its related problems

    Energy Technology Data Exchange (ETDEWEB)

    Umeo, H; Morita, K; Sugata, K

    1982-06-13

    The authors show that for any deterministic two-way, real-time cellular automaton, m, there exists a deterministic one-way cellular automation which can simulate m in twice real-time. Moreover the authors present a new type of deterministic one-way cellular automata, called circular cellular automata, which are computationally equivalent to deterministic two-way cellular automata. 7 references.

  9. Modeling reliability of power systems substations by using stochastic automata networks

    International Nuclear Information System (INIS)

    Šnipas, Mindaugas; Radziukynas, Virginijus; Valakevičius, Eimutis

    2017-01-01

    In this paper, stochastic automata networks (SANs) formalism to model reliability of power systems substations is applied. The proposed strategy allows reducing the size of state space of Markov chain model and simplifying system specification. Two case studies of standard configurations of substations are considered in detail. SAN models with different assumptions were created. SAN approach is compared with exact reliability calculation by using a minimal path set method. Modeling results showed that total independence of automata can be assumed for relatively small power systems substations with reliable equipment. In this case, the implementation of Markov chain model by a using SAN method is a relatively easy task. - Highlights: • We present the methodology to apply stochastic automata network formalism to create Markov chain models of power systems. • The stochastic automata network approach is combined with minimal path sets and structural functions. • Two models of substation configurations with different model assumptions are presented to illustrate the proposed methodology. • Modeling results of system with independent automata and functional transition rates are similar. • The conditions when total independence of automata can be assumed are addressed.

  10. Control of Discrete-Event Systems Automata and Petri Net Perspectives

    CERN Document Server

    Silva, Manuel; Schuppen, Jan

    2013-01-01

    Control of Discrete-event Systems provides a survey of the most important topics in the discrete-event systems theory with particular focus on finite-state automata, Petri nets and max-plus algebra. Coverage ranges from introductory material on the basic notions and definitions of discrete-event systems to more recent results. Special attention is given to results on supervisory control, state estimation and fault diagnosis of both centralized and distributed/decentralized systems developed in the framework of the Distributed Supervisory Control of Large Plants (DISC) project. Later parts of the text are devoted to the study of congested systems though fluidization, an over approximation allowing a much more efficient study of observation and control problems of timed Petri nets. Finally, the max-plus algebraic approach to the analysis and control of choice-free systems is also considered. Control of Discrete-event Systems provides an introduction to discrete-event systems for readers that are not familiar wi...

  11. Modelling Implicit Communication in Multi-Agent Systems with Hybrid Input/Output Automata

    Directory of Open Access Journals (Sweden)

    Marta Capiluppi

    2012-10-01

    Full Text Available We propose an extension of Hybrid I/O Automata (HIOAs to model agent systems and their implicit communication through perturbation of the environment, like localization of objects or radio signals diffusion and detection. To this end we decided to specialize some variables of the HIOAs whose values are functions both of time and space. We call them world variables. Basically they are treated similarly to the other variables of HIOAs, but they have the function of representing the interaction of each automaton with the surrounding environment, hence they can be output, input or internal variables. Since these special variables have the role of simulating implicit communication, their dynamics are specified both in time and space, because they model the perturbations induced by the agent to the environment, and the perturbations of the environment as perceived by the agent. Parallel composition of world variables is slightly different from parallel composition of the other variables, since their signals are summed. The theory is illustrated through a simple example of agents systems.

  12. Towards measuring the semantic capacity of a physical medium demonstrated with elementary cellular automata.

    Science.gov (United States)

    Dittrich, Peter

    2018-02-01

    The organic code concept and its operationalization by molecular codes have been introduced to study the semiotic nature of living systems. This contribution develops further the idea that the semantic capacity of a physical medium can be measured by assessing its ability to implement a code as a contingent mapping. For demonstration and evaluation, the approach is applied to a formal medium: elementary cellular automata (ECA). The semantic capacity is measured by counting the number of ways codes can be implemented. Additionally, a link to information theory is established by taking multivariate mutual information for quantifying contingency. It is shown how ECAs differ in their semantic capacities, how this is related to various ECA classifications, and how this depends on how a meaning is defined. Interestingly, if the meaning should persist for a certain while, the highest semantic capacity is found in CAs with apparently simple behavior, i.e., the fixed-point and two-cycle class. Synergy as a predictor for a CA's ability to implement codes can only be used if context implementing codes are common. For large context spaces with sparse coding contexts synergy is a weak predictor. Concluding, the approach presented here can distinguish CA-like systems with respect to their ability to implement contingent mappings. Applying this to physical systems appears straight forward and might lead to a novel physical property indicating how suitable a physical medium is to implement a semiotic system. Copyright © 2017 Elsevier B.V. All rights reserved.

  13. A solution to the biodiversity paradox by logical deterministic cellular automata.

    Science.gov (United States)

    Kalmykov, Lev V; Kalmykov, Vyacheslav L

    2015-06-01

    The paradox of biological diversity is the key problem of theoretical ecology. The paradox consists in the contradiction between the competitive exclusion principle and the observed biodiversity. The principle is important as the basis for ecological theory. On a relatively simple model we show a mechanism of indefinite coexistence of complete competitors which violates the known formulations of the competitive exclusion principle. This mechanism is based on timely recovery of limiting resources and their spatio-temporal allocation between competitors. Because of limitations of the black-box modeling there was a problem to formulate the exclusion principle correctly. Our white-box multiscale model of two-species competition is based on logical deterministic individual-based cellular automata. This approach provides an automatic deductive inference on the basis of a system of axioms, and gives a direct insight into mechanisms of the studied system. It is one of the most promising methods of artificial intelligence. We reformulate and generalize the competitive exclusion principle and explain why this formulation provides a solution of the biodiversity paradox. In addition, we propose a principle of competitive coexistence.

  14. Investigation of high burnup structures in uranium dioxide applying cellular automata: algorithms and codes

    International Nuclear Information System (INIS)

    Akishina, E.P.; Kostenko, B.F.; Ivanov, V.V.

    2003-01-01

    A new method of research in spatial structures that result from uranium dioxide burning in nuclear reactors of modern atomic plants is suggested. The method is based on the presentation of images of the mentioned structures in the form of the working field of a cellular automaton (CA). First, it has allowed one to extract some important quantitative characteristics of the structures directly from the micrographs of the uranium fuel surface. Secondly, the CA has been found out to allow one to formulate easily the dynamics of the evolution of the studied structures in terms of such micrograph elements as spots, spots' boundaries, cracks, etc. Relation has been found between the dynamics and some exactly solvable models of the theory of cellular automata, in particular, the Ising model and the vote model. This investigation gives a detailed description of some CA algorithms which allow one to perform the fuel surface image processing and to model its evolution caused by burnup or chemical etching. (author)

  15. Reversible Flip-Flops in Quantum-Dot Cellular Automata

    Science.gov (United States)

    Rad, Samaneh Kazemi; Heikalabad, Saeed Rasouli

    2017-09-01

    Quantum-dot cellular automata is a new technology to design the efficient combinational and sequential circuits at the nano-scale. This technology has many desirable advantages compared to the CMOS technology such as low power consumption, less occupation area and low latency. These features make it suitable for use in flip-flop design. In this paper, with knowing the characteristics of reversible logic, we design new structures for flip-flops. The operations of these structures are evaluated with QCADesigner Version 2.0.3 simulator. In addition, we calculate the power dissipation of these structures by QCAPro tool. The results illustrated that proposed structures are efficient compared to the previous ones.

  16. Universal shift register implementation using quantum dot cellular automata

    Directory of Open Access Journals (Sweden)

    Tamoghna Purkayastha

    2018-06-01

    Full Text Available Quantum-dot Cellular Automata (QCA demands to be a promising alternative of CMOS in ultra large scale circuit integration. Arithmetic and logic unit designs using QCA are of high research interest. A layout of four and eight bit universal shift register (USR has been proposed. Initially QCA layouts of D flip-flop with clear and 4 to 1 multiplexer are designed, which are extended to design 4 and 8-bit parallel in parallel out (PIPO shift register. Finally the PIPO is utilized to design 4-bit and 8-bit USR. By the comparative analysis it is observed that the proposed D Flip-flop achieved 40% clock delay improvement, whereas the modified layout of 4 to 1 multiplexer achieved 30% cell count reduction and 17% clock delay reduction from the previous works. This results in 31% reduction in cell count, 45% reduction in area and 55% reduction in clock cycle delay in 8 bit USR layout.

  17. Integration of Neural Networks and Cellular Automata for Urban Planning

    Institute of Scientific and Technical Information of China (English)

    Anthony Gar-on Yeh; LI Xia

    2004-01-01

    This paper presents a new type of cellular automata (CA) model for the simulation of alternative land development using neural networks for urban planning. CA models can be regarded as a planning tool because they can generate alternative urban growth. Alternative development patterns can be formed by using different sets of parameter values in CA simulation. A critical issue is how to define parameter values for realistic and idealized simulation. This paper demonstrates that neural networks can simplify CA models but generate more plausible results. The simulation is based on a simple three-layer network with an output neuron to generate conversion probability. No transition rules are required for the simulation. Parameter values are automatically obtained from the training of network by using satellite remote sensing data. Original training data can be assessed and modified according to planning objectives. Alternative urban patterns can be easily formulated by using the modified training data sets rather than changing the model.

  18. Bisimulation Meet PCTL Equivalences for Probabilistic Automata (Journal Version)

    DEFF Research Database (Denmark)

    Song, Lei; Zhang, Lijun; Godskesen, Jens Christian

    2013-01-01

    Probabilistic automata (PA) have been successfully applied in the formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on PCTL and its extension PCTL*. Various behavioral...... equivalences are proposed for PAs, as a powerful tool for abstraction and compositional minimization for PAs. Unfortunately, the behavioral equivalences are well-known to be strictly stronger than the logical equivalences induced by PCTL or PCTL*. This paper introduces novel notions of strong bisimulation...... relations, which characterizes PCTL and PCTL* exactly. We also extend weak bisimulations characterizing PCTL and PCTL* without next operator, respectively. Thus, our paper bridges the gap between logical and behavioral equivalences in this setting....

  19. History dependent quantum random walks as quantum lattice gas automata

    Energy Technology Data Exchange (ETDEWEB)

    Shakeel, Asif, E-mail: asif.shakeel@gmail.com, E-mail: dmeyer@math.ucsd.edu, E-mail: plove@haverford.edu; Love, Peter J., E-mail: asif.shakeel@gmail.com, E-mail: dmeyer@math.ucsd.edu, E-mail: plove@haverford.edu [Department of Physics, Haverford College, Haverford, Pennsylvania 19041 (United States); Meyer, David A., E-mail: asif.shakeel@gmail.com, E-mail: dmeyer@math.ucsd.edu, E-mail: plove@haverford.edu [Department of Mathematics, University of California/San Diego, La Jolla, California 92093-0112 (United States)

    2014-12-15

    Quantum Random Walks (QRW) were first defined as one-particle sectors of Quantum Lattice Gas Automata (QLGA). Recently, they have been generalized to include history dependence, either on previous coin (internal, i.e., spin or velocity) states or on previous position states. These models have the goal of studying the transition to classicality, or more generally, changes in the performance of quantum walks in algorithmic applications. We show that several history dependent QRW can be identified as one-particle sectors of QLGA. This provides a unifying conceptual framework for these models in which the extra degrees of freedom required to store the history information arise naturally as geometrical degrees of freedom on the lattice.

  20. From Dynamic Condition Response Structures to Büchi Automata

    DEFF Research Database (Denmark)

    Mukkamala, Raghava Rao; Hildebrandt, Thomas

    2010-01-01

    Recently we have presented distributed dynamic condition response structures (DCR structures) as a declarative process model conservatively generalizing labelled event structures to allow for finite specifications of repeated, possibly infinite behavior. The key ideas are to split the causality...... relation of event structures in two dual relations: the condition relation and the response relation, to split the conflict relation in two relations: the dynamic exclusion and dynamic inclusion, and finally to allow configurations to be multi sets of events. In the present abstract we recall the model...... and show how to characterise the execution of DCR structures and the acceptance condition for infinite runs by giving a map to Bu ̈chi-automata. This is the first step towards automatic verification of processes specified as DCR structures....

  1. Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study.

    Science.gov (United States)

    Tîrnăucă, Cristina; Montaña, José L; Ontañón, Santiago; González, Avelino J; Pardo, Luis M

    2016-06-24

    Imagine an agent that performs tasks according to different strategies. The goal of Behavioral Recognition (BR) is to identify which of the available strategies is the one being used by the agent, by simply observing the agent's actions and the environmental conditions during a certain period of time. The goal of Behavioral Cloning (BC) is more ambitious. In this last case, the learner must be able to build a model of the behavior of the agent. In both settings, the only assumption is that the learner has access to a training set that contains instances of observed behavioral traces for each available strategy. This paper studies a machine learning approach based on Probabilistic Finite Automata (PFAs), capable of achieving both the recognition and cloning tasks. We evaluate the performance of PFAs in the context of a simulated learning environment (in this case, a virtual Roomba vacuum cleaner robot), and compare it with a collection of other machine learning approaches.

  2. Molecular automata assembly: principles and simulation of bacterial membrane construction.

    Science.gov (United States)

    Lahoz-Beltra, R

    1997-01-01

    The motivation to understand the basic rules and principles governing molecular self-assembly may be relevant to explain in the context of molecular biology the self-organization and biological functions exhibited within cells. This paper presents a molecular automata model to simulate molecular self-assembly introducing the concept of molecular programming to simulate the biological function or operation performed by an assembled molecular state machine. The method is illustrated modelling Escherichia coli membrane construction including the assembly and operation of ATP synthase as well as the assembly of the bacterial flagellar motor. Flagellar motor operation was simulated using a different approach based on state machine definition used in virtual reality systems. The proposed methodology provides a modelling framework for simulation of biological functions performed by cellular components and other biological systems suitable to be modelled as molecular state machines.

  3. An Asynchronous Cellular Automata-Based Adaptive Illumination Facility

    Science.gov (United States)

    Bandini, Stefania; Bonomi, Andrea; Vizzari, Giuseppe; Acconci, Vito

    The term Ambient Intelligence refers to electronic environments that are sensitive and responsive to the presence of people; in the described scenario the environment itself is endowed with a set of sensors (to perceive humans or other physical entities such as dogs, bicycles, etc.), interacting with a set of actuators (lights) that choose their actions (i.e. state of illumination) in an attempt improve the overall experience of these users. The model for the interaction and action of sensors and actuators is an asynchronous Cellular Automata (CA) with memory, supporting a self-organization of the system as a response to the presence and movements of people inside it. The paper will introduce the model, as well as an ad hoc user interface for the specification of the relevant parameters of the CA transition rule that determines the overall system behaviour.

  4. Simulations of living cell origins using a cellular automata model.

    Science.gov (United States)

    Ishida, Takeshi

    2014-04-01

    Understanding the generalized mechanisms of cell self-assembly is fundamental for applications in various fields, such as mass producing molecular machines in nanotechnology. Thus, the details of real cellular reaction networks and the necessary conditions for self-organized cells must be elucidated. We constructed a 2-dimensional cellular automata model to investigate the emergence of biological cell formation, which incorporated a looped membrane and a membrane-bound information system (akin to a genetic code and gene expression system). In particular, with an artificial reaction system coupled with a thermal system, the simultaneous formation of a looped membrane and an inner reaction process resulted in a more stable structure. These double structures inspired the primitive biological cell formation process from chemical evolution stage. With a model to simulate cellular self-organization in a 2-dimensional cellular automata model, 3 phenomena could be realized: (1) an inner reaction system developed as an information carrier precursor (akin to DNA); (2) a cell border emerged (akin to a cell membrane); and (3) these cell structures could divide into 2. This double-structured cell was considered to be a primary biological cell. The outer loop evolved toward a lipid bilayer membrane, and inner polymeric particles evolved toward precursor information carriers (evolved toward DNA). This model did not completely clarify all the necessary and sufficient conditions for biological cell self-organization. Further, our virtual cells remained unstable and fragile. However, the "garbage bag model" of Dyson proposed that the first living cells were deficient; thus, it would be reasonable that the earliest cells were more unstable and fragile than the simplest current unicellular organisms.

  5. Simulating Space Radiation-Induced Breast Tumor Incidence Using Automata.

    Science.gov (United States)

    Heuskin, A C; Osseiran, A I; Tang, J; Costes, S V

    2016-07-01

    Estimating cancer risk from space radiation has been an ongoing challenge for decades primarily because most of the reported epidemiological data on radiation-induced risks are derived from studies of atomic bomb survivors who were exposed to an acute dose of gamma rays instead of chronic high-LET cosmic radiation. In this study, we introduce a formalism using cellular automata to model the long-term effects of ionizing radiation in human breast for different radiation qualities. We first validated and tuned parameters for an automata-based two-stage clonal expansion model simulating the age dependence of spontaneous breast cancer incidence in an unexposed U.S. We then tested the impact of radiation perturbation in the model by modifying parameters to reflect both targeted and nontargeted radiation effects. Targeted effects (TE) reflect the immediate impact of radiation on a cell's DNA with classic end points being gene mutations and cell death. They are well known and are directly derived from experimental data. In contrast, nontargeted effects (NTE) are persistent and affect both damaged and undamaged cells, are nonlinear with dose and are not well characterized in the literature. In this study, we introduced TE in our model and compared predictions against epidemiologic data of the atomic bomb survivor cohort. TE alone are not sufficient for inducing enough cancer. NTE independent of dose and lasting ∼100 days postirradiation need to be added to accurately predict dose dependence of breast cancer induced by gamma rays. Finally, by integrating experimental relative biological effectiveness (RBE) for TE and keeping NTE (i.e., radiation-induced genomic instability) constant with dose and LET, the model predicts that RBE for breast cancer induced by cosmic radiation would be maximum at 220 keV/μm. This approach lays the groundwork for further investigation into the impact of chronic low-dose exposure, inter-individual variation and more complex space radiation

  6. Last-position elimination-based learning automata.

    Science.gov (United States)

    Zhang, Junqi; Wang, Cheng; Zhou, MengChu

    2014-12-01

    An update scheme of the state probability vector of actions is critical for learning automata (LA). The most popular is the pursuit scheme that pursues the estimated optimal action and penalizes others. This paper proposes a reverse philosophy that leads to last-position elimination-based learning automata (LELA). The action graded last in terms of the estimated performance is penalized by decreasing its state probability and is eliminated when its state probability becomes zero. All active actions, that is, actions with nonzero state probability, equally share the penalized state probability from the last-position action at each iteration. The proposed LELA is characterized by the relaxed convergence condition for the optimal action, the accelerated step size of the state probability update scheme for the estimated optimal action, and the enriched sampling for the estimated nonoptimal actions. The proof of the ϵ-optimal property for the proposed algorithm is presented. Last-position elimination is a widespread philosophy in the real world and has proved to be also helpful for the update scheme of the learning automaton via the simulations of well-known benchmark environments. In the simulations, two versions of the LELA, using different selection strategies of the last action, are compared with the classical pursuit algorithms Discretized Pursuit Reward-Inaction (DP(RI)) and Discretized Generalized Pursuit Algorithm (DGPA). Simulation results show that the proposed schemes achieve significantly faster convergence and higher accuracy than the classical ones. Specifically, the proposed schemes reduce the interval to find the best parameter for a specific environment in the classical pursuit algorithms. Thus, they can have their parameter tuning easier to perform and can save much more time when applied to a practical case. Furthermore, the convergence curves and the corresponding variance coefficient curves of the contenders are illustrated to characterize their

  7. New MPPT algorithm based on hybrid dynamical theory

    KAUST Repository

    Elmetennani, Shahrazed

    2014-11-01

    This paper presents a new maximum power point tracking algorithm based on the hybrid dynamical theory. A multiceli converter has been considered as an adaptation stage for the photovoltaic chain. The proposed algorithm is a hybrid automata switching between eight different operating modes, which has been validated by simulation tests under different working conditions. © 2014 IEEE.

  8. New MPPT algorithm based on hybrid dynamical theory

    KAUST Repository

    Elmetennani, Shahrazed; Laleg-Kirati, Taous-Meriem; Benmansour, K.; Boucherit, M. S.; Tadjine, M.

    2014-01-01

    This paper presents a new maximum power point tracking algorithm based on the hybrid dynamical theory. A multiceli converter has been considered as an adaptation stage for the photovoltaic chain. The proposed algorithm is a hybrid automata switching between eight different operating modes, which has been validated by simulation tests under different working conditions. © 2014 IEEE.

  9. Stochastic cellular automata model of neurosphere growth: Roles of proliferative potential, contact inhibition, cell death, and phagocytosis.

    Science.gov (United States)

    Sipahi, Rifat; Zupanc, Günther K H

    2018-05-14

    Neural stem and progenitor cells isolated from the central nervous system form, under specific culture conditions, clonal cell clusters known as neurospheres. The neurosphere assay has proven to be a powerful in vitro system to study the behavior of such cells and the development of their progeny. However, the theory of neurosphere growth has remained poorly understood. To overcome this limitation, we have, in the present paper, developed a cellular automata model, with which we examined the effects of proliferative potential, contact inhibition, cell death, and clearance of dead cells on growth rate, final size, and composition of neurospheres. Simulations based on this model indicated that the proliferative potential of the founder cell and its progenitors has a major influence on neurosphere size. On the other hand, contact inhibition of proliferation limits the final size, and reduces the growth rate, of neurospheres. The effect of this inhibition is particularly dramatic when a stem cell becomes encapsulated by differentiated or other non-proliferating cells, thereby suppressing any further mitotic division - despite the existing proliferative potential of the stem cell. Conversely, clearance of dead cells through phagocytosis is predicted to accelerate growth by reducing contact inhibition. A surprising prediction derived from our model is that cell death, while resulting in a decrease in growth rate and final size of neurospheres, increases the degree of differentiation of neurosphere cells. It is likely that the cellular automata model developed as part of the present investigation is applicable to the study of tissue growth in a wide range of systems. Copyright © 2018 Elsevier Ltd. All rights reserved.

  10. Linear reversible second-order cellular automata and their first-order matrix equivalents

    Science.gov (United States)

    Macfarlane, A. J.

    2004-11-01

    Linear or one-dimensional reversible second-order cellular automata, exemplified by three cases named as RCA1-3, are introduced. Displays of their evolution in discrete time steps, &{\\in}Z_2;) as for RCA1-3. MCA1-3 are tractable because it has been possible to generalize to them the heavy duty methods already well-developed for ordinary first-order cellular automata like those of Wolfram's Rules 90 and 150. While the automata MCA1-3 are thought to be of genuine interest in their own right, with untapped further mathematical potential, their treatment has been applied here to expediting derivation of a large body of general and explicit results for N(t) for RCA1-3. Amongst explicit results obtained are formulas also for each of RCA1-3 for the total weight of the configurations of the first &2^M; times, M =0, 1, 2,\\ldots.

  11. A novel image encryption algorithm using chaos and reversible cellular automata

    Science.gov (United States)

    Wang, Xingyuan; Luan, Dapeng

    2013-11-01

    In this paper, a novel image encryption scheme is proposed based on reversible cellular automata (RCA) combining chaos. In this algorithm, an intertwining logistic map with complex behavior and periodic boundary reversible cellular automata are used. We split each pixel of image into units of 4 bits, then adopt pseudorandom key stream generated by the intertwining logistic map to permute these units in confusion stage. And in diffusion stage, two-dimensional reversible cellular automata which are discrete dynamical systems are applied to iterate many rounds to achieve diffusion on bit-level, in which we only consider the higher 4 bits in a pixel because the higher 4 bits carry almost the information of an image. Theoretical analysis and experimental results demonstrate the proposed algorithm achieves a high security level and processes good performance against common attacks like differential attack and statistical attack. This algorithm belongs to the class of symmetric systems.

  12. Cellular Automata on Graphs: Topological Properties of ER Graphs Evolved towards Low-Entropy Dynamics

    Directory of Open Access Journals (Sweden)

    Marc-Thorsten Hütt

    2012-06-01

    Full Text Available Cellular automata (CA are a remarkably  efficient tool for exploring general properties of complex systems and spatiotemporal patterns arising from local rules. Totalistic cellular automata,  where the update  rules depend  only on the density of neighboring states, are at the same time a versatile  tool for exploring  dynamical  processes on graphs. Here we briefly review our previous results on cellular automata on graphs, emphasizing some systematic relationships between network architecture and dynamics identified in this way. We then extend the investigation  towards graphs obtained in a simulated-evolution procedure, starting from Erdő s–Rényi (ER graphs and selecting for low entropies of the CA dynamics. Our key result is a strong association of low Shannon entropies with a broadening of the graph’s degree distribution.

  13. Generic framework for mining cellular automata models on protein-folding simulations.

    Science.gov (United States)

    Diaz, N; Tischer, I

    2016-05-13

    Cellular automata model identification is an important way of building simplified simulation models. In this study, we describe a generic architectural framework to ease the development process of new metaheuristic-based algorithms for cellular automata model identification in protein-folding trajectories. Our framework was developed by a methodology based on design patterns that allow an improved experience for new algorithms development. The usefulness of the proposed framework is demonstrated by the implementation of four algorithms, able to obtain extremely precise cellular automata models of the protein-folding process with a protein contact map representation. Dynamic rules obtained by the proposed approach are discussed, and future use for the new tool is outlined.

  14. Design of arithmetic circuits in quantum dot cellular automata nanotechnology

    CERN Document Server

    Sridharan, K

    2015-01-01

    This research monograph focuses on the design of arithmetic circuits in Quantum Dot Cellular Automata (QCA). Using the fact that the 3-input majority gate is a primitive in QCA, the book sets out to discover hitherto unknown properties of majority logic in the context of arithmetic circuit designs. The pursuit for efficient adders in QCA takes two forms. One involves application of the new results in majority logic to existing adders. The second involves development of a custom adder for QCA technology. A QCA adder named as hybrid adder is proposed and it is shown that it outperforms existing multi-bit adders with respect to area and delay. The work is extended to the design of a low-complexity multiplier for signed numbers in QCA. Furthermore the book explores two aspects unique to QCA technology, namely thermal robustness and the role of interconnects. In addition, the book introduces the reader to QCA layout design and simulation using QCADesigner. Features & Benefits: This research-based book: ·  �...

  15. Cellular automata model for traffic flow with safe driving conditions

    International Nuclear Information System (INIS)

    Lárraga María Elena; Alvarez-Icaza Luis

    2014-01-01

    In this paper, a recently introduced cellular automata (CA) model is used for a statistical analysis of the inner microscopic structure of synchronized traffic flow. The analysis focuses on the formation and dissolution of clusters or platoons of vehicles, as the mechanism that causes the presence of this synchronized traffic state with a high flow. This platoon formation is one of the most interesting phenomena observed in traffic flows and plays an important role both in manual and automated highway systems (AHS). Simulation results, obtained from a single-lane system under periodic boundary conditions indicate that in the density region where the synchronized state is observed, most vehicles travel together in platoons with approximately the same speed and small spatial distances. The examination of velocity variations and individual vehicle gaps shows that the flow corresponding to the synchronized state is stable, safe and highly correlated. Moreover, results indicate that the observed platoon formation in real traffic is reproduced in simulations by the relation between vehicle headway and velocity that is embedded in the dynamics definition of the CA model. (general)

  16. A novel time series link prediction method: Learning automata approach

    Science.gov (United States)

    Moradabadi, Behnaz; Meybodi, Mohammad Reza

    2017-09-01

    Link prediction is a main social network challenge that uses the network structure to predict future links. The common link prediction approaches to predict hidden links use a static graph representation where a snapshot of the network is analyzed to find hidden or future links. For example, similarity metric based link predictions are a common traditional approach that calculates the similarity metric for each non-connected link and sort the links based on their similarity metrics and label the links with higher similarity scores as the future links. Because people activities in social networks are dynamic and uncertainty, and the structure of the networks changes over time, using deterministic graphs for modeling and analysis of the social network may not be appropriate. In the time-series link prediction problem, the time series link occurrences are used to predict the future links In this paper, we propose a new time series link prediction based on learning automata. In the proposed algorithm for each link that must be predicted there is one learning automaton and each learning automaton tries to predict the existence or non-existence of the corresponding link. To predict the link occurrence in time T, there is a chain consists of stages 1 through T - 1 and the learning automaton passes from these stages to learn the existence or non-existence of the corresponding link. Our preliminary link prediction experiments with co-authorship and email networks have provided satisfactory results when time series link occurrences are considered.

  17. Cellular-automata-based learning network for pattern recognition

    Science.gov (United States)

    Tzionas, Panagiotis G.; Tsalides, Phillippos G.; Thanailakis, Adonios

    1991-11-01

    Most classification techniques either adopt an approach based directly on the statistical characteristics of the pattern classes involved, or they transform the patterns in a feature space and try to separate the point clusters in this space. An alternative approach based on memory networks has been presented, its novelty being that it can be implemented in parallel and it utilizes direct features of the patterns rather than statistical characteristics. This study presents a new approach for pattern classification using pseudo 2-D binary cellular automata (CA). This approach resembles the memory network classifier in the sense that it is based on an adaptive knowledge based formed during a training phase, and also in the fact that both methods utilize pattern features that are directly available. The main advantage of this approach is that the sensitivity of the pattern classifier can be controlled. The proposed pattern classifier has been designed using 1.5 micrometers design rules for an N-well CMOS process. Layout has been achieved using SOLO 1400. Binary pseudo 2-D hybrid additive CA (HACA) is described in the second section of this paper. The third section describes the operation of the pattern classifier and the fourth section presents some possible applications. The VLSI implementation of the pattern classifier is presented in the fifth section and, finally, the sixth section draws conclusions from the results obtained.

  18. Mammogram segmentation using maximal cell strength updation in cellular automata.

    Science.gov (United States)

    Anitha, J; Peter, J Dinesh

    2015-08-01

    Breast cancer is the most frequently diagnosed type of cancer among women. Mammogram is one of the most effective tools for early detection of the breast cancer. Various computer-aided systems have been introduced to detect the breast cancer from mammogram images. In a computer-aided diagnosis system, detection and segmentation of breast masses from the background tissues is an important issue. In this paper, an automatic segmentation method is proposed to identify and segment the suspicious mass regions of mammogram using a modified transition rule named maximal cell strength updation in cellular automata (CA). In coarse-level segmentation, the proposed method performs an adaptive global thresholding based on the histogram peak analysis to obtain the rough region of interest. An automatic seed point selection is proposed using gray-level co-occurrence matrix-based sum average feature in the coarse segmented image. Finally, the method utilizes CA with the identified initial seed point and the modified transition rule to segment the mass region. The proposed approach is evaluated over the dataset of 70 mammograms with mass from mini-MIAS database. Experimental results show that the proposed approach yields promising results to segment the mass region in the mammograms with the sensitivity of 92.25% and accuracy of 93.48%.

  19. Neural networks and cellular automata in experimental high energy physics

    Energy Technology Data Exchange (ETDEWEB)

    Denby, B

    1988-06-01

    Within the past few years, two novel computing techniques, cellular automata and neural networks, have shown considerable promise in the solution of problems of a very high degree of complexity, such as turbulent fluid flow, image processing, and pattern recognition. Many of the problems faced in experimental high energy physics are also of this nature. Track reconstruction in wire chambers and cluster finding in cellular calorimeters, for instance, involve pattern recognition and high combinatorial complexity since many combinations of hits or cells must be considered in order to arrive at the final tracks or clusters. Here we examine in what way connective network methods can be applied to some of the problems of experimental high energy physics. It is found that such problems as track and cluster finding adapt naturally to these approaches. When large scale hard-wired connective networks become available, it will be possible to realize solutions to such problems in a fraction of the time required by traditional methods. For certain types of problems, faster solutions are already possible using model networks implemented on vector or other massively parallel machines. It should also be possible, using existing technology, to build simplified networks that will allow detailed reconstructed event information to be used in fast trigger decisions.

  20. Cellular Automata for Modeling the field-scale erosion

    International Nuclear Information System (INIS)

    Diaz Suarez, Jorge; Bagarotti Marin, Angel; Ruiz Perez, Maria Elena

    2008-01-01

    Full text: The Cellular Automaton (CA) is a system used discrete dynamic modeling of many physical systems. Their fundamental properties are the interaction at the local level, homogeneity and parallelism. It has been used as a secondary for the simulation of large systems where the use of equations in partial derivatives is complex and costly from the computational point of view. On the other hand, the high complexity of spatial interaction in the processes involved in the erosion-transport-deposition of sediments at field level, considerably limiting the use of base models physics. The objective of this study is to model the main processes involved in erosion water supply of soils through the use of the CAMELot system, based on an extension of the original paradigm of the CA. The CAMELot system has been used in the simulation of systems of large spatial extent, where the laws of local interaction between automata have a deep physical sense. This system guarantees both the input of the necessary specifications and simulation in parallel, as the visualization and the general management of the system. They are exposed to each of the submodels used in it and the overall dynamics of the system is analyzed. (author)

  1. Generating inferences from knowledge structures based on general automata

    Energy Technology Data Exchange (ETDEWEB)

    Koenig, E C

    1983-01-01

    The author shows that the model for knowledge structures for computers based on general automata accommodates procedures for establishing inferences. Algorithms are presented which generate inferences as output of a computer when its sentence input names appropriate knowledge elements contained in an associated knowledge structure already stored in the memory of the computer. The inferences are found to have either a single graph tuple or more than one graph tuple of associated knowledge. Six algorithms pertain to a single graph tuple and a seventh pertains to more than one graph tuple of associated knowledge. A named term is either the automaton, environment, auxiliary receptor, principal receptor, auxiliary effector, or principal effector. The algorithm pertaining to more than one graph tuple requires that the input sentence names the automaton, transformation response, and environment of one of the tuples of associated knowledge in a sequence of tuples. Interaction with the computer may be either in a conversation or examination mode. The algorithms are illustrated by an example. 13 references.

  2. Fast and Epsilon-Optimal Discretized Pursuit Learning Automata.

    Science.gov (United States)

    Zhang, JunQi; Wang, Cheng; Zhou, MengChu

    2015-10-01

    Learning automata (LA) are powerful tools for reinforcement learning. A discretized pursuit LA is the most popular one among them. During an iteration its operation consists of three basic phases: 1) selecting the next action; 2) finding the optimal estimated action; and 3) updating the state probability. However, when the number of actions is large, the learning becomes extremely slow because there are too many updates to be made at each iteration. The increased updates are mostly from phases 1 and 3. A new fast discretized pursuit LA with assured ε -optimality is proposed to perform both phases 1 and 3 with the computational complexity independent of the number of actions. Apart from its low computational complexity, it achieves faster convergence speed than the classical one when operating in stationary environments. This paper can promote the applications of LA toward the large-scale-action oriented area that requires efficient reinforcement learning tools with assured ε -optimality, fast convergence speed, and low computational complexity for each iteration.

  3. Using Cellular Automata for Parking Recommendations in Smart Environments

    Science.gov (United States)

    Horng, Gwo-Jiun

    2014-01-01

    In this work, we propose an innovative adaptive recommendation mechanism for smart parking. The cognitive RF module will transmit the vehicle location information and the parking space requirements to the parking congestion computing center (PCCC) when the driver must find a parking space. Moreover, for the parking spaces, we use a cellular automata (CA) model mechanism that can adjust to full and not full parking lot situations. Here, the PCCC can compute the nearest parking lot, the parking lot status and the current or opposite driving direction with the vehicle location information. By considering the driving direction, we can determine when the vehicles must turn around and thus reduce road congestion and speed up finding a parking space. The recommendation will be sent to the drivers through a wireless communication cognitive radio (CR) model after the computation and analysis by the PCCC. The current study evaluates the performance of this approach by conducting computer simulations. The simulation results show the strengths of the proposed smart parking mechanism in terms of avoiding increased congestion and decreasing the time to find a parking space. PMID:25153671

  4. Cellular Automata-Based Parallel Random Number Generators Using FPGAs

    Directory of Open Access Journals (Sweden)

    David H. K. Hoe

    2012-01-01

    Full Text Available Cellular computing represents a new paradigm for implementing high-speed massively parallel machines. Cellular automata (CA, which consist of an array of locally connected processing elements, are a basic form of a cellular-based architecture. The use of field programmable gate arrays (FPGAs for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR. This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehard is used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehard tests.

  5. An Automata Based Intrusion Detection Method for Internet of Things

    Directory of Open Access Journals (Sweden)

    Yulong Fu

    2017-01-01

    Full Text Available Internet of Things (IoT transforms network communication to Machine-to-Machine (M2M basis and provides open access and new services to citizens and companies. It extends the border of Internet and will be developed as one part of the future 5G networks. However, as the resources of IoT’s front devices are constrained, many security mechanisms are hard to be implemented to protect the IoT networks. Intrusion detection system (IDS is an efficient technique that can be used to detect the attackers when cryptography is broken, and it can be used to enforce the security of IoT networks. In this article, we analyzed the intrusion detection requirements of IoT networks and then proposed a uniform intrusion detection method for the vast heterogeneous IoT networks based on an automata model. The proposed method can detect and report the possible IoT attacks with three types: jam-attack, false-attack, and reply-attack automatically. We also design an experiment to verify the proposed IDS method and examine the attack of RADIUS application.

  6. Cellular automata rule characterization and classification using texture descriptors

    Science.gov (United States)

    Machicao, Jeaneth; Ribas, Lucas C.; Scabini, Leonardo F. S.; Bruno, Odermir M.

    2018-05-01

    The cellular automata (CA) spatio-temporal patterns have attracted the attention from many researchers since it can provide emergent behavior resulting from the dynamics of each individual cell. In this manuscript, we propose an approach of texture image analysis to characterize and classify CA rules. The proposed method converts the CA spatio-temporal patterns into a gray-scale image. The gray-scale is obtained by creating a binary number based on the 8-connected neighborhood of each dot of the CA spatio-temporal pattern. We demonstrate that this technique enhances the CA rule characterization and allow to use different texture image analysis algorithms. Thus, various texture descriptors were evaluated in a supervised training approach aiming to characterize the CA's global evolution. Our results show the efficiency of the proposed method for the classification of the elementary CA (ECAs), reaching a maximum of 99.57% of accuracy rate according to the Li-Packard scheme (6 classes) and 94.36% for the classification of the 88 rules scheme. Moreover, within the image analysis context, we found a better performance of the method by means of a transformation of the binary states to a gray-scale.

  7. Neural networks and cellular automata in experimental high energy physics

    International Nuclear Information System (INIS)

    Denby, B.

    1987-11-01

    Within the past few years, two novel computing techniques, cellular automata and neural networks, have shown considerable promise in the solution of problems of a very high degree of complexity, such as turbulent fluid flow, image processing, and pattern recognition. Many of the problems faced in experimental high energy physics are also of this nature. Track reconstruction in wire chambers and cluster finding in cellular calorimeters, for instance, involve pattern recognition and high combinatorial complexity since many combinations of hits or cells must be considered in order to arrive at the final tracks or clusters. Here we examine in what way connective network methods can be applied to some of the problems of experimental high physics. It is found that such problems as track and cluster finding adapt naturally to these approaches. When large scale hardwired connective networks become available, it will be possible to realize solutions to such problems in a fraction of the time required by traditional methods. For certain types of problems, faster solutions are already possible using model networks implemented on vector or other massively parallel machines. It should also be possible, using existing technology, to build simplified networks that will allow detailed reconstructed event information to be used in fast trigger decisions

  8. Neural networks and cellular automata in experimental high energy physics

    International Nuclear Information System (INIS)

    Denby, B.

    1988-01-01

    Within the past few years, two novel computing techniques, cellular automata and neural networks, have shown considerable promise in the solution of problems of a very high degree of complexity, such as turbulent fluid flow, image processing, and pattern recognition. Many of the problems faced in experimental high energy physics are also of this nature. Track reconstruction in wire chambers and cluster finding in cellular calorimeters, for instance, involve pattern recognition and high combinatorial complexity since many combinations of hits or cells must be considered in order to arrive at the final tracks or clusters. Here we examine in what way connective network methods can be applied to some of the problems of experimental high energy physics. It is found that such problems as track and cluster finding adapt naturally to these approaches. When large scale hard-wired connective networks become available, it will be possible to realize solutions to such problems in a fraction of the time required by traditional methods. For certain types of problems, faster solutions are already possible using model networks implemented on vector or other massively parallel machines. It should also be possible, using existing technology, to build simplified networks that will allow detailed reconstructed event information to be used in fast trigger decisions. (orig.)

  9. A metric for characterizing the bistability of molecular quantum-dot cellular automata

    International Nuclear Information System (INIS)

    Lu Yuhui; Lent, Craig S

    2008-01-01

    Much of molecular electronics involves trying to use molecules as (a) wires, (b) diodes or (c) field-effect transistors. In each case the criterion for determining good performance is well known: for wires it is conductance, for diodes it is conductance asymmetry, while for transistors it is high transconductance. Candidate molecules can be screened in terms of these criteria by calculating molecular conductivity in forward and reverse directions, and in the presence of a gating field. Hence so much theoretical work has focused on understanding molecular conductance. In contrast a molecule used as a quantum-dot cellular automata (QCA) cell conducts no current at all. The keys to QCA functionality are (a) charge localization, (b) bistable charge switching within the cell and (c) electric field coupling between one molecular cell and its neighbor. The combination of these effects can be examined using the cell-cell response function which relates the polarization of one cell to the induced polarization of a neighboring cell. The response function can be obtained by calculating the molecular electronic structure with ab initio quantum chemistry techniques. We present an analysis of molecular QCA performance that can be applied to any candidate molecule. From the full quantum chemistry, all-electron ab initio calculations we extract parameters for a reduced-state model which reproduces the cell-cell response function very well. Techniques from electron transfer theory are used to derive analytical models of the response function and can be employed on molecules too large for full ab initio treatment. A metric is derived which characterizes molecular QCA performance the way transconductance characterizes transistor performance. This metric can be assessed from absorption measurements of the electron transfer band or quantum chemistry calculations of appropriate sophistication

  10. Modeling a student-classroom interaction in a tutorial-like system using learning automata.

    Science.gov (United States)

    Oommen, B John; Hashem, M Khaled

    2010-02-01

    Almost all of the learning paradigms used in machine learning, learning automata (LA), and learning theory, in general, use the philosophy of a Student (learning mechanism) attempting to learn from a teacher. This paradigm has been generalized in a myriad of ways, including the scenario when there are multiple teachers or a hierarchy of mechanisms that collectively achieve the learning. In this paper, we consider a departure from this paradigm by allowing the Student to be a member of a classroom of Students, where, for the most part, we permit each member of the classroom not only to learn from the teacher(s) but also to "extract" information from any of his fellow Students. This paper deals with issues concerning the modeling, decision-making process, and testing of such a scenario within the LA context. The main result that we show is that a weak learner can actually benefit from this capability of utilizing the information that he gets from a superior colleague-if this information transfer is done appropriately. As far as we know, the whole concept of Students learning from both a teacher and from a classroom of Students is novel and unreported in the literature. The proposed Student-classroom interaction has been tested for numerous strategies and for different environments, including the established benchmarks, and the results show that Students can improve their learning by interacting with each other. For example, for some interaction strategies, a weak Student can improve his learning by up to 73% when interacting with a classroom of Students, which includes Students of various capabilities. In these interactions, the Student does not have a priori knowledge of the identity or characteristics of the Students who offer their assistance.

  11. Evolution of probability measures by cellular automata on algebraic topological Markov chains

    Directory of Open Access Journals (Sweden)

    ALEJANDRO MAASS

    2003-01-01

    Full Text Available In this paper we review some recent results on the evolution of probability measures under cellular automata acting on a fullshift. In particular we discuss the crucial role of the attractiveness of maximal measures. We enlarge the context of the results of a previous study of topological Markov chains that are Abelian groups; the shift map is an automorphism of this group. This is carried out by studying the dynamics of Markov measures by a particular additive cellular automata. Many of these topics were within the focus of Francisco Varela's mathematical interests.

  12. A comparative analysis of electronic and molecular quantum dot cellular automata

    International Nuclear Information System (INIS)

    Umamahesvari, H.; Ajitha, D.

    2015-01-01

    This paper presents a comparative analysis of electronic quantum-dot cellular automata (EQCA) and Magnetic quantum dot Cellular Automata (MQCA). QCA is a computing paradigm that encodes and processes information by the position of individual electrons. To enhance the high dense and ultra-low power devices, various researches have been actively carried out to find an alternative way to continue and follow Moore’s law, so called “beyond CMOS technology”. There have been several proposals for physically implementing QCA, EQCA and MQCA are the two important QCAs reported so far. This paper provides a comparative study on these two QCAs

  13. The Study Of Properties Of The Word Of Mouth Marketing Using Cellular Automata

    Directory of Open Access Journals (Sweden)

    Kowalska-Styczeń Agnieszka

    2014-02-01

    Full Text Available This article presents the possibility of using cellular automata, to study the properties of word of mouth (w-o-m marketing. Cellular automata allow to analyze the dynamics of changes in views and attitudes in social groups based on local interactions between people in small groups of friends, family members etc. The proposed paper shows the possibility of modelling the dynamics of word of mouth mechanism, if the basic assumptions of this process are: different size groups where this phenomenon occurs, and varied access to information. On the competing firms market, the dependence of the w-o-m mechanism dynamics on the model parameters is shown

  14. Quantum mechanics of lattice gas automata: One-particle plane waves and potentials

    International Nuclear Information System (INIS)

    Meyer, D.A.

    1997-01-01

    Classical lattice gas automata effectively simulate physical processes, such as diffusion and fluid flow (in certain parameter regimes), despite their simplicity at the microscale. Motivated by current interest in quantum computation we recently defined quantum lattice gas automata; in this paper we initiate a project to analyze which physical processes these models can effectively simulate. Studying the single particle sector of a one-dimensional quantum lattice gas we find discrete analogs of plane waves and wave packets, and then investigate their behavior in the presence of inhomogeneous potentials. copyright 1997 The American Physical Society

  15. Multi-Core Emptiness Checking of Timed Büchi Automata using Inclusion Abstraction

    DEFF Research Database (Denmark)

    Laarman, Alfons; Olesen, Mads Chr.; Dalsgaard, Andreas

    2013-01-01

    This paper contributes to the multi-core model checking of timed automata (TA) with respect to liveness properties, by investigating checking of TA Büchi emptiness under the very coarse inclusion abstraction or zone subsumption, an open problem in this field. We show that in general Büchi emptiness...... parallel LTL model checking algorithm for timed automata. The algorithms are implemented in LTSmin, and experimental evaluations show the effectiveness and scalability of both contributions: subsumption halves the number of states in the real-world FDDI case study, and the multi-core algorithm yields...

  16. A stochastic parameterization for deep convection using cellular automata

    Science.gov (United States)

    Bengtsson, L.; Steinheimer, M.; Bechtold, P.; Geleyn, J.

    2012-12-01

    Cumulus parameterizations used in most operational weather and climate models today are based on the mass-flux concept which took form in the early 1970's. In such schemes it is assumed that a unique relationship exists between the ensemble-average of the sub-grid convection, and the instantaneous state of the atmosphere in a vertical grid box column. However, such a relationship is unlikely to be described by a simple deterministic function (Palmer, 2011). Thus, because of the statistical nature of the parameterization challenge, it has been recognized by the community that it is important to introduce stochastic elements to the parameterizations (for instance: Plant and Craig, 2008, Khouider et al. 2010, Frenkel et al. 2011, Bentsson et al. 2011, but the list is far from exhaustive). There are undoubtedly many ways in which stochastisity can enter new developments. In this study we use a two-way interacting cellular automata (CA), as its intrinsic nature possesses many qualities interesting for deep convection parameterization. In the one-dimensional entraining plume approach, there is no parameterization of horizontal transport of heat, moisture or momentum due to cumulus convection. In reality, mass transport due to gravity waves that propagate in the horizontal can trigger new convection, important for the organization of deep convection (Huang, 1988). The self-organizational characteristics of the CA allows for lateral communication between adjacent NWP model grid-boxes, and temporal memory. Thus the CA scheme used in this study contain three interesting components for representation of cumulus convection, which are not present in the traditional one-dimensional bulk entraining plume method: horizontal communication, memory and stochastisity. The scheme is implemented in the high resolution regional NWP model ALARO, and simulations show enhanced organization of convective activity along squall-lines. Probabilistic evaluation demonstrate an enhanced spread in

  17. Effect of asynchronous updating on the stability of cellular automata

    International Nuclear Information System (INIS)

    Baetens, J.M.; Van der Weeën, P.; De Baets, B.

    2012-01-01

    Highlights: ► An upper bound on the Lyapunov exponent of asynchronously updated CA is established. ► The employed update method has repercussions on the stability of CAs. ► A decision on the employed update method should be taken with care. ► Substantial discrepancies arise between synchronously and asynchronously updated CA. ► Discrepancies between different asynchronous update schemes are less pronounced. - Abstract: Although cellular automata (CAs) were conceptualized as utter discrete mathematical models in which the states of all their spatial entities are updated simultaneously at every consecutive time step, i.e. synchronously, various CA-based models that rely on so-called asynchronous update methods have been constructed in order to overcome the limitations that are tied up with the classical way of evolving CAs. So far, only a few researchers have addressed the consequences of this way of updating on the evolved spatio-temporal patterns, and the reachable stationary states. In this paper, we exploit Lyapunov exponents to determine to what extent the stability of the rules within a family of totalistic CAs is affected by the underlying update method. For that purpose, we derive an upper bound on the maximum Lyapunov exponent of asynchronously iterated CAs, and show its validity, after which we present a comparative study between the Lyapunov exponents obtained for five different update methods, namely one synchronous method and four well-established asynchronous methods. It is found that the stability of CAs is seriously affected if one of the latter methods is employed, whereas the discrepancies arising between the different asynchronous methods are far less pronounced and, finally, we discuss the repercussions of our findings on the development of CA-based models.

  18. Parametric Linear Hybrid Automata for Complex Environmental Systems Modeling

    Directory of Open Access Journals (Sweden)

    Samar Hayat Khan Tareen

    2015-07-01

    Full Text Available Environmental systems, whether they be weather patterns or predator-prey relationships, are dependent on a number of different variables, each directly or indirectly affecting the system at large. Since not all of these factors are known, these systems take on non-linear dynamics, making it difficult to accurately predict meaningful behavioral trends far into the future. However, such dynamics do not warrant complete ignorance of different efforts to understand and model close approximations of these systems. Towards this end, we have applied a logical modeling approach to model and analyze the behavioral trends and systematic trajectories that these systems exhibit without delving into their quantification. This approach, formalized by René Thomas for discrete logical modeling of Biological Regulatory Networks (BRNs and further extended in our previous studies as parametric biological linear hybrid automata (Bio-LHA, has been previously employed for the analyses of different molecular regulatory interactions occurring across various cells and microbial species. As relationships between different interacting components of a system can be simplified as positive or negative influences, we can employ the Bio-LHA framework to represent different components of the environmental system as positive or negative feedbacks. In the present study, we highlight the benefits of hybrid (discrete/continuous modeling which lead to refinements among the fore-casted behaviors in order to find out which ones are actually possible. We have taken two case studies: an interaction of three microbial species in a freshwater pond, and a more complex atmospheric system, to show the applications of the Bio-LHA methodology for the timed hybrid modeling of environmental systems. Results show that the approach using the Bio-LHA is a viable method for behavioral modeling of complex environmental systems by finding timing constraints while keeping the complexity of the model

  19. Behavioural differential equations : a coinductive calculus of streams, automata, and power series

    NARCIS (Netherlands)

    J.J.M.M. Rutten (Jan)

    2000-01-01

    textabstractStreams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs

  20. A cellular automata intraurban model with prices and income-differentiated actors

    NARCIS (Netherlands)

    Furtado, B.A.; Ettema, D.F.; Ruiz, R.M.; Hurkens, J.; Delden, H. van

    2012-01-01

    This paper presents an intraurban cellular automata model that is an extension to White and Engelen’s pioneering model. The paper’s main contribution is to distinguish between agglomerative eff ects, determined by the attraction of the neighbourhood, and disagglomerative eff ects, driven by land

  1. Parallel Implementation of Triangular Cellular Automata for Computing Two-Dimensional Elastodynamic Response on Arbitrary Domains

    Science.gov (United States)

    Leamy, Michael J.; Springer, Adam C.

    In this research we report parallel implementation of a Cellular Automata-based simulation tool for computing elastodynamic response on complex, two-dimensional domains. Elastodynamic simulation using Cellular Automata (CA) has recently been presented as an alternative, inherently object-oriented technique for accurately and efficiently computing linear and nonlinear wave propagation in arbitrarily-shaped geometries. The local, autonomous nature of the method should lead to straight-forward and efficient parallelization. We address this notion on symmetric multiprocessor (SMP) hardware using a Java-based object-oriented CA code implementing triangular state machines (i.e., automata) and the MPI bindings written in Java (MPJ Express). We use MPJ Express to reconfigure our existing CA code to distribute a domain's automata to cores present on a dual quad-core shared-memory system (eight total processors). We note that this message passing parallelization strategy is directly applicable to computer clustered computing, which will be the focus of follow-on research. Results on the shared memory platform indicate nearly-ideal, linear speed-up. We conclude that the CA-based elastodynamic simulator is easily configured to run in parallel, and yields excellent speed-up on SMP hardware.

  2. Simulating Urban Growth Using a Random Forest-Cellular Automata (RF-CA Model

    Directory of Open Access Journals (Sweden)

    Courage Kamusoko

    2015-04-01

    Full Text Available Sustainable urban planning and management require reliable land change models, which can be used to improve decision making. The objective of this study was to test a random forest-cellular automata (RF-CA model, which combines random forest (RF and cellular automata (CA models. The Kappa simulation (KSimulation, figure of merit, and components of agreement and disagreement statistics were used to validate the RF-CA model. Furthermore, the RF-CA model was compared with support vector machine cellular automata (SVM-CA and logistic regression cellular automata (LR-CA models. Results show that the RF-CA model outperformed the SVM-CA and LR-CA models. The RF-CA model had a Kappa simulation (KSimulation accuracy of 0.51 (with a figure of merit statistic of 47%, while SVM-CA and LR-CA models had a KSimulation accuracy of 0.39 and −0.22 (with figure of merit statistics of 39% and 6%, respectively. Generally, the RF-CA model was relatively accurate at allocating “non-built-up to built-up” changes as reflected by the correct “non-built-up to built-up” components of agreement of 15%. The performance of the RF-CA model was attributed to the relatively accurate RF transition potential maps. Therefore, this study highlights the potential of the RF-CA model for simulating urban growth.

  3. Lower and Upper Bounds in Zone Based Abstractions of Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Bouyer, Patricia; Larsen, Kim Guldstrand

    2004-01-01

    Timed automata have an infinite semantics. For verification purposes, one usually uses zone based abstractions w.r.t. the maximal constants to which clocks of the timed automaton are compared. We show that by distinguishing maximal lower and upper bounds, significantly coarser abstractions can...... dramatically increases the scalability of the real-time model checker Uppaal....

  4. Using cellular automata for parallel simulation of laser dynamics with dynamic load balancing

    NARCIS (Netherlands)

    Guisado, J.L.; Fernández de Vega, F.; Jiménez Morales, F.; Iskra, K.A.; Sloot, P.M.A.

    2008-01-01

    We present an analysis of the feasibility of executing a parallel bioinspired model of laser dynamics, based on cellular automata (CA), on the usual target platform of this kind of applications: a heterogeneous non-dedicated cluster. As this model employs a synchronous CA, using the single program,

  5. A cellular automata approach to chemical reactions : 1 reaction controlled systems

    NARCIS (Netherlands)

    Korte, de A.C.J.; Brouwers, H.J.H.

    2013-01-01

    A direct link between the chemical reaction controlled (shrinking core) model and cellular automata, to study the dissolution of particles, is derived in this paper. Previous research on first and second order reactions is based on the concentration of the reactant. The present paper describes the

  6. Descriptional complexity of non-unary self-verifying symmetric difference automata

    CSIR Research Space (South Africa)

    Marais, Laurette

    2017-09-01

    Full Text Available Previously, self-verifying symmetric difference automata were defined and a tight bound of 2^n-1-1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n at least 2, there is a regular...

  7. On the relationship between LTL normal forms and Büchi automata

    DEFF Research Database (Denmark)

    Li, Jianwen; Pu, Geguang; Zhang, Lijun

    2013-01-01

    In this paper, we revisit the problem of translating LTL formulas to Büchi automata. We first translate the given LTL formula into a special disjuctive-normal form (DNF). The formula will be part of the state, and its DNF normal form specifies the atomic properties that should hold immediately...

  8. Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems

    NARCIS (Netherlands)

    K. Etessami (Kousha); D.K. Wojtczak (Dominik); M. Yannakakis

    2010-01-01

    textabstractWe begin by observing that (discrete-time) Quasi-Birth-Death Processes (QBDs) are equivalent, in a precise sense, to probabilistic 1-Counter Automata (p1CAs), and both Tree-Like QBDs (TL-QBDs) and Tree-Structured QBDs (TS-QBDs) are equivalent to both probabilistic Pushdown Systems

  9. Modeling cell adhesion and proliferation: a cellular-automata based approach.

    Science.gov (United States)

    Vivas, J; Garzón-Alvarado, D; Cerrolaza, M

    Cell adhesion is a process that involves the interaction between the cell membrane and another surface, either a cell or a substrate. Unlike experimental tests, computer models can simulate processes and study the result of experiments in a shorter time and lower costs. One of the tools used to simulate biological processes is the cellular automata, which is a dynamic system that is discrete both in space and time. This work describes a computer model based on cellular automata for the adhesion process and cell proliferation to predict the behavior of a cell population in suspension and adhered to a substrate. The values of the simulated system were obtained through experimental tests on fibroblast monolayer cultures. The results allow us to estimate the cells settling time in culture as well as the adhesion and proliferation time. The change in the cells morphology as the adhesion over the contact surface progress was also observed. The formation of the initial link between cell and the substrate of the adhesion was observed after 100 min where the cell on the substrate retains its spherical morphology during the simulation. The cellular automata model developed is, however, a simplified representation of the steps in the adhesion process and the subsequent proliferation. A combined framework of experimental and computational simulation based on cellular automata was proposed to represent the fibroblast adhesion on substrates and changes in a macro-scale observed in the cell during the adhesion process. The approach showed to be simple and efficient.

  10. A Cellular Automata-based Model for Simulating Restitution Property in a Single Heart Cell.

    Science.gov (United States)

    Sabzpoushan, Seyed Hojjat; Pourhasanzade, Fateme

    2011-01-01

    Ventricular fibrillation is the cause of the most sudden mortalities. Restitution is one of the specific properties of ventricular cell. The recent findings have clearly proved the correlation between the slope of restitution curve with ventricular fibrillation. This; therefore, mandates the modeling of cellular restitution to gain high importance. A cellular automaton is a powerful tool for simulating complex phenomena in a simple language. A cellular automaton is a lattice of cells where the behavior of each cell is determined by the behavior of its neighboring cells as well as the automata rule. In this paper, a simple model is depicted for the simulation of the property of restitution in a single cardiac cell using cellular automata. At first, two state variables; action potential and recovery are introduced in the automata model. In second, automata rule is determined and then recovery variable is defined in such a way so that the restitution is developed. In order to evaluate the proposed model, the generated restitution curve in our study is compared with the restitution curves from the experimental findings of valid sources. Our findings indicate that the presented model is not only capable of simulating restitution in cardiac cell, but also possesses the capability of regulating the restitution curve.

  11. Energy dissipation dataset for reversible logic gates in quantum dot-cellular automata.

    Science.gov (United States)

    Bahar, Ali Newaz; Rahman, Mohammad Maksudur; Nahid, Nur Mohammad; Hassan, Md Kamrul

    2017-02-01

    This paper presents an energy dissipation dataset of different reversible logic gates in quantum-dot cellular automata. The proposed circuits have been designed and verified using QCADesigner simulator. Besides, the energy dissipation has been calculated under three different tunneling energy level at temperature T =2 K. For estimating the energy dissipation of proposed gates; QCAPro tool has been employed.

  12. Lower and Upper Bounds in Zone-Based Abstractions of Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Bouyer, Patricia; Larsen, Kim Guldstrand

    2005-01-01

    The semantics of timed automata is defined using an infinite-state transition system. For verification purposes, one usually uses zone based abstractions w.r.t. the maximal constants to which clocks of the timed automaton are compared. We show that by distinguishing maximal lower and upper bounds...

  13. Associating current knowledge with that of past experience based on knowledge about automata

    Energy Technology Data Exchange (ETDEWEB)

    Koenig, E C

    1982-01-01

    Important to the performance of interactive systems is the ability of its members to associate current knowledge with knowledge of past experience. Knowledge association results in greater detail of a current knowledge and is demonstrated through the use of examples. It is based on knowledge about automata and the knowledge structures are in the form of graphs. 11 references.

  14. Performance of Сellular Automata-based Stream Ciphers in GPU Implementation

    Directory of Open Access Journals (Sweden)

    P. G. Klyucharev

    2016-01-01

    Full Text Available Earlier the author had developed methods to build high-performance generalized cellular automata-based symmetric ciphers, which allow obtaining the encryption algorithms that show extremely high performance in hardware implementation. However, their implementation based on the conventional microprocessors lacks high performance. The mere fact is quite common - it shows a scope of applications for these ciphers. Nevertheless, the use of graphic processors enables achieving an appropriate performance for a software implementation.The article is extension of a series of the articles, which study various aspects to construct and implement cryptographic algorithms based on the generalized cellular automata. The article is aimed at studying the capabilities to implement the GPU-based cryptographic algorithms under consideration.Representing a key generator, the implemented encryption algorithm comprises 2k generalized cellular automata. The cellular automata graphs are Ramanujan’s ones. The cells of produced k gamma streams alternate, thereby allowing the GPU capabilities to be better used.To implement was used OpenCL, as the most universal and platform-independent API. The software written in C ++ was designed so that the user could set various parameters, including the encryption key, the graph structure, the local communication function, various constants, etc. To test were used a variety of graphics processors (NVIDIA GTX 650; NVIDIA GTX 770; AMD R9 280X.Depending on operating conditions, and GPU used, a performance range is from 0.47 to 6.61 Gb / s, which is comparable to the performance of the countertypes.Thus, the article has demonstrated that using the GPU makes it is possible to provide efficient software implementation of stream ciphers based on the generalized cellular automata.This work was supported by the RFBR, the project №16-07-00542.

  15. Using cellular automata to simulate forest fire propagation in Portugal

    Science.gov (United States)

    Freire, Joana; daCamara, Carlos

    2017-04-01

    Wildfires in the Mediterranean region have severe damaging effects mainly due to large fire events [1, 2]. When restricting to Portugal, wildfires have burned over 1:4 million ha in the last decade. Considering the increasing tendency in the extent and severity of wildfires [1, 2], the availability of modeling tools of fire episodes is of crucial importance. Two main types of mathematical models are generally available, namely deterministic and stochastic models. Deterministic models attempt a description of fires, fuel and atmosphere as multiphase continua prescribing mass, momentum and energy conservation, which typically leads to systems of coupled PDEs to be solved numerically on a grid. Simpler descriptions, such as FARSITE, neglect the interaction with atmosphere and propagate the fire front using wave techniques. One of the most important stochastic models are Cellular Automata (CA), in which space is discretized into cells, and physical quantities take on a finite set of values at each cell. The cells evolve in discrete time according to a set of transition rules, and the states of the neighboring cells. In the present work, we implement and then improve a simple and fast CA model designed to operationally simulate wildfires in Portugal. The reference CA model chosen [3] has the advantage of having been applied successfully in other Mediterranean ecosystems, namely to historical fires in Greece. The model is defined on a square grid with propagation to 8 nearest and next-nearest neighbors, where each cell is characterized by 4 possible discrete states, corresponding to burning, not-yet burned, fuel-free and completely burned cells, with 4 possible rules of evolution which take into account fuel properties, meteorological conditions, and topography. As a CA model, it offers the possibility to run a very high number of simulations in order to verify and apply the model, and is easily modified by implementing additional variables and different rules for the

  16. MODELING OF FUTURE LAND COVER LAND USE CHANGE IN NORTH CAROLINA USING MARKOV CHAIN AND CELLULAR AUTOMATA MODEL

    OpenAIRE

    Mohammad Sayemuzzaman; Manoj K. Jha

    2014-01-01

    State wide variant topographic features in North Carolina attract the hydro-climatologist. There is none modeling study found that predict future Land Cover Land Use (LCLU) change for whole North Carolina. In this study, satellite-derived land cover maps of year 1992, 2001 and 2006 of North Carolina were integrated within the framework of the Markov-Cellular Automata (Markov-CA) model which combines the Markov chain and Cellular Automata (CA) techniques. A Multi-Criteria Evaluation (MCE) was ...

  17. Treatment Analysis in a Cancer Stem Cell Context Using a Tumor Growth Model Based on Cellular Automata.

    Science.gov (United States)

    Monteagudo, Ángel; Santos, José

    2015-01-01

    Cancer can be viewed as an emergent behavior in terms of complex system theory and artificial life, Cellular Automata (CA) being the tool most used for studying and characterizing the emergent behavior. Different approaches with CA models were used to model cancer growth. The use of the abstract model of acquired cancer hallmarks permits the direct modeling at cellular level, where a cellular automaton defines the mitotic and apoptotic behavior of cells, and allows for an analysis of different dynamics of the cellular system depending on the presence of the different hallmarks. A CA model based on the presence of hallmarks in the cells, which includes a simulation of the behavior of Cancer Stem Cells (CSC) and their implications for the resultant growth behavior of the multicellular system, was employed. This modeling of cancer growth, in the avascular phase, was employed to analyze the effect of cancer treatments in a cancer stem cell context. The model clearly explains why, after treatment against non-stem cancer cells, the regrowth capability of CSCs generates a faster regrowth of tumor behavior, and also shows that a continuous low-intensity treatment does not favor CSC proliferation and differentiation, thereby allowing an unproblematic control of future tumor regrowth. The analysis performed indicates that, contrary to the current attempts at CSC control, trying to make CSC proliferation more difficult is an important point to consider, especially in the immediate period after a standard treatment for controlling non-stem cancer cell proliferation.

  18. Treatment Analysis in a Cancer Stem Cell Context Using a Tumor Growth Model Based on Cellular Automata.

    Directory of Open Access Journals (Sweden)

    Ángel Monteagudo

    Full Text Available Cancer can be viewed as an emergent behavior in terms of complex system theory and artificial life, Cellular Automata (CA being the tool most used for studying and characterizing the emergent behavior. Different approaches with CA models were used to model cancer growth. The use of the abstract model of acquired cancer hallmarks permits the direct modeling at cellular level, where a cellular automaton defines the mitotic and apoptotic behavior of cells, and allows for an analysis of different dynamics of the cellular system depending on the presence of the different hallmarks. A CA model based on the presence of hallmarks in the cells, which includes a simulation of the behavior of Cancer Stem Cells (CSC and their implications for the resultant growth behavior of the multicellular system, was employed. This modeling of cancer growth, in the avascular phase, was employed to analyze the effect of cancer treatments in a cancer stem cell context. The model clearly explains why, after treatment against non-stem cancer cells, the regrowth capability of CSCs generates a faster regrowth of tumor behavior, and also shows that a continuous low-intensity treatment does not favor CSC proliferation and differentiation, thereby allowing an unproblematic control of future tumor regrowth. The analysis performed indicates that, contrary to the current attempts at CSC control, trying to make CSC proliferation more difficult is an important point to consider, especially in the immediate period after a standard treatment for controlling non-stem cancer cell proliferation.

  19. Algorithm for repairing the damaged images of grain structures obtained from the cellular automata and measurement of grain size

    Science.gov (United States)

    Ramírez-López, A.; Romero-Romo, M. A.; Muñoz-Negron, D.; López-Ramírez, S.; Escarela-Pérez, R.; Duran-Valencia, C.

    2012-10-01

    Computational models are developed to create grain structures using mathematical algorithms based on the chaos theory such as cellular automaton, geometrical models, fractals, and stochastic methods. Because of the chaotic nature of grain structures, some of the most popular routines are based on the Monte Carlo method, statistical distributions, and random walk methods, which can be easily programmed and included in nested loops. Nevertheless, grain structures are not well defined as the results of computational errors and numerical inconsistencies on mathematical methods. Due to the finite definition of numbers or the numerical restrictions during the simulation of solidification, damaged images appear on the screen. These images must be repaired to obtain a good measurement of grain geometrical properties. Some mathematical algorithms were developed to repair, measure, and characterize grain structures obtained from cellular automata in the present work. An appropriate measurement of grain size and the corrected identification of interfaces and length are very important topics in materials science because they are the representation and validation of mathematical models with real samples. As a result, the developed algorithms are tested and proved to be appropriate and efficient to eliminate the errors and characterize the grain structures.

  20. Cellular Automata Models Applied to the Study of Landslide Dynamics

    Science.gov (United States)

    Liucci, Luisa; Melelli, Laura; Suteanu, Cristian

    2015-04-01

    Landslides are caused by complex processes controlled by the interaction of numerous factors. Increasing efforts are being made to understand the spatial and temporal evolution of this phenomenon, and the use of remote sensing data is making significant contributions in improving forecast. This paper studies landslides seen as complex dynamic systems, in order to investigate their potential Self Organized Critical (SOC) behavior, and in particular, scale-invariant aspects of processes governing the spatial development of landslides and their temporal evolution, as well as the mechanisms involved in driving the system and keeping it in a critical state. For this purpose, we build Cellular Automata Models, which have been shown to be capable of reproducing the complexity of real world features using a small number of variables and simple rules, thus allowing for the reduction of the number of input parameters commonly used in the study of processes governing landslide evolution, such as those linked to the geomechanical properties of soils. This type of models has already been successfully applied in studying the dynamics of other natural hazards, such as earthquakes and forest fires. The basic structure of the model is composed of three modules: (i) An initialization module, which defines the topographic surface at time zero as a grid of square cells, each described by an altitude value; the surface is acquired from real Digital Elevation Models (DEMs). (ii) A transition function, which defines the rules used by the model to update the state of the system at each iteration. The rules use a stability criterion based on the slope angle and introduce a variable describing the weakening of the material over time, caused for example by rainfall. The weakening brings some sites of the system out of equilibrium thus causing the triggering of landslides, which propagate within the system through local interactions between neighboring cells. By using different rates of

  1. A dynamically reconfigurable logic cell: from artificial neural networks to quantum-dot cellular automata

    Science.gov (United States)

    Naqvi, Syed Rameez; Akram, Tallha; Iqbal, Saba; Haider, Sajjad Ali; Kamran, Muhammad; Muhammad, Nazeer

    2018-02-01

    Considering the lack of optimization support for Quantum-dot Cellular Automata, we propose a dynamically reconfigurable logic cell capable of implementing various logic operations by means of artificial neural networks. The cell can be reconfigured to any 2-input combinational logic gate by altering the strength of connections, called weights and biases. We demonstrate how these cells may appositely be organized to perform multi-bit arithmetic and logic operations. The proposed work is important in that it gives a standard implementation of an 8-bit arithmetic and logic unit for quantum-dot cellular automata with minimal area and latency overhead. We also compare the proposed design with a few existing arithmetic and logic units, and show that it is more area efficient than any equivalent available in literature. Furthermore, the design is adaptable to 16, 32, and 64 bit architectures.

  2. Evolution of Cellular Automata toward a LIFE-Like Rule Guided by 1/ƒ Noise

    Science.gov (United States)

    Ninagawa, Shigeru

    There is evidence in favor of a relationship between the presence of 1/ƒ noise and computational universality in cellular automata. To confirm the relationship, we search for two-dimensional cellular automata with a 1/ƒ power spectrum by means of genetic algorithms. The power spectrum is calculated from the evolution of the state of the cell, starting from a random initial configuration. The fitness is estimated by the power spectrum with consideration of the spectral similarity to the 1/ƒ spectrum. The result shows that the rule with the highest fitness over the most runs exhibits a 1/ƒ type spectrum and its transition function and behavior are quite similar to those of the Game of Life, which is known to be a computationally universal cellular automaton. These results support the relationship between the presence of 1/ƒ noise and computational universality.

  3. Opinion evolution based on cellular automata rules in small world networks

    Science.gov (United States)

    Shi, Xiao-Ming; Shi, Lun; Zhang, Jie-Fang

    2010-03-01

    In this paper, we apply cellular automata rules, which can be given by a truth table, to human memory. We design each memory as a tracking survey mode that keeps the most recent three opinions. Each cellular automata rule, as a personal mechanism, gives the final ruling in one time period based on the data stored in one's memory. The key focus of the paper is to research the evolution of people's attitudes to the same question. Based on a great deal of empirical observations from computer simulations, all the rules can be classified into 20 groups. We highlight the fact that the phenomenon shown by some rules belonging to the same group will be altered within several steps by other rules in different groups. It is truly amazing that, compared with the last hundreds of presidential voting in America, the eras of important events in America's history coincide with the simulation results obtained by our model.

  4. An authenticated image encryption scheme based on chaotic maps and memory cellular automata

    Science.gov (United States)

    Bakhshandeh, Atieh; Eslami, Ziba

    2013-06-01

    This paper introduces a new image encryption scheme based on chaotic maps, cellular automata and permutation-diffusion architecture. In the permutation phase, a piecewise linear chaotic map is utilized to confuse the plain-image and in the diffusion phase, we employ the Logistic map as well as a reversible memory cellular automata to obtain an efficient and secure cryptosystem. The proposed method admits advantages such as highly secure diffusion mechanism, computational efficiency and ease of implementation. A novel property of the proposed scheme is its authentication ability which can detect whether the image is tampered during the transmission or not. This is particularly important in applications where image data or part of it contains highly sensitive information. Results of various analyses manifest high security of this new method and its capability for practical image encryption.

  5. Solving the Ternary Quantum-Dot Cellular Automata Logic Gate Problem by Means of Adiabatic Switching

    Science.gov (United States)

    Pecar, Primoz; Mraz, Miha; Zimic, Nikolaj; Janez, Miha; Lebar Bajec, Iztok

    2008-06-01

    Quantum-dot cellular automata (QCA) are one of the most promising alternative platforms of the future. Recent years have witnessed the development of basic logic structures as well as more complex processing structures, however most in the realm of binary logic. On the grounds that future platforms should not disregard the advantages of multi-valued logic, Lebar Bajec et al. were the first to show that quantum-dot cellular automata can be used for the implementation of ternary logic as well. In their study the ternary AND and OR logic functions proved to be the most troublesome primitive to implement. This research presents a revised solution that is based on adiabatic switching.

  6. Uniform and localized corrosion modelling by means of probabilistic cellular automata

    International Nuclear Information System (INIS)

    Perez-Brokate, Cristian

    2016-01-01

    Numerical modelling is complementary tool for corrosion prediction. The objective of this work is to develop a corrosion model by means of a probabilistic cellular automata approach at a mesoscopic scale. In this work, we study the morphological evolution and kinetics of corrosion. This model couples electrochemical oxidation and reduction reactions. Regarding kinetics, cellular automata models are able to describe current as a function of the applied potential for a redox reaction on an inert electrode. The inclusion of probabilities allows the description of the stochastic nature of anodic and cathodic reactions. Corrosion morphology has been studied in different context: generalised corrosion, pitting corrosion and corrosion in an occluded environment. a general tendency of two regimes is found. a first regime of uniform corrosion where the anodic and cathodic reactions occur homogeneously over the surface. a second regime of localized corrosion when there is a spatial separation of anodic and cathodic zones, with an increase of anodic reaction rate. (author) [fr

  7. Coulomb coupling and the role of symmetries in quantum-dot arrays for cellular automata

    International Nuclear Information System (INIS)

    Ramirez, F.; Cota, E.; Ulloa, S. E.

    2000-01-01

    Using a group-theoretical analysis of the symmetries of a quantum dot array, we investigate the role of defects on the energetics of the system and the resulting charge configurations (or polarization of the cell). We find that for the typical four- or five-element geometries proposed, even small asymmetries introduced by defects in the system, or variations in the local electrostatic environment, can give rise to large effects on the polarization of the ground state and the corresponding low-energy excitations. These shifts are likely to produce important effects in the operation of the cellular automata proposed using these quantum dots. In particular, we find that the sensitivity to polarization changes induced by a driver cell decreases dramatically, and the polarization values are no longer fully defined. These effects would both force the use of stronger driving fields, and may also complicate the dynamical behavior of the cellular automata. (c) 2000 The American Physical Society

  8. Using Cellular Automata to Investigate Pedestrian Conflicts with Vehicles in Crosswalk at Signalized Intersection

    Directory of Open Access Journals (Sweden)

    Xiaomeng Li

    2012-01-01

    Full Text Available The operational efficiency and safety of pedestrian flows at intersections is an important aspect of urban traffic. Particularly, conflicts between pedestrians and vehicles in crosswalk are one of the most influential factors for intersection safety. This paper presents a cellular automata model that simulates pedestrian and vehicle crossing behaviors at signalized intersections. Through the simulation, we investigate the effects of different pedestrian signal timing and crosswalk widths on the crosswalk capacity, the number of traffic conflicts between pedestrians and vehicles, and pedestrian delay due to the conflicts. The simulation results indicate that the cellular automata is an effective simulation platform for investigating complex pedestrian-related traffic phenomenon at signalized intersections.

  9. Molecular device computer: point of departure for large scale cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Carter, F L

    1984-01-01

    Switching is possible at the molecular size level because of the conformational changes that occur. Three of the most promising switching mechanisms include electron tunnelling in short periodic arrays, soliton switching and soliton valving. Assuming a 3-d architecture and molecular dimensions, memory and switching elements with densities of 10/sup 15/ to 10 /sup 18/ elements per cc are possible. The active elements are connected together conceptionally with molecular wires like polysulfur nitride (sn)/sub x/ and polyacetylene (ch)/sub x/. Simple cellular automata involving soliton propagation in conjugated systems would include soliton valves and cyclic configurations of valves. In the latter, soliton propagation becomes isomorphous with group operations giving rise to possible non-binary finite-state machines. The development of a molecular electron device (MED) synthetic capability in combination with the above devices would suggest that large 3-d arrays of parallel processors will be possible with automata, biological, and crystallographic implications. 41 references.

  10. Three-dimensional cellular automata as a model of a seismic fault

    International Nuclear Information System (INIS)

    Gálvez, G; Muñoz, A

    2017-01-01

    The Earth's crust is broken into a series of plates, whose borders are the seismic fault lines and it is where most of the earthquakes occur. This plating system can in principle be described by a set of nonlinear coupled equations describing the motion of the plates, its stresses, strains and other characteristics. Such a system of equations is very difficult to solve, and nonlinear parts leads to a chaotic behavior, which is not predictable. In 1989, Bak and Tang presented an earthquake model based on the sand pile cellular automata. The model though simple, provides similar results to those observed in actual earthquakes. In this work the cellular automata in three dimensions is proposed as a best model to approximate a seismic fault. It is noted that the three-dimensional model reproduces similar properties to those observed in real seismicity, especially, the Gutenberg-Richter law. (paper)

  11. Design of Improved Arithmetic Logic Unit in Quantum-Dot Cellular Automata

    Science.gov (United States)

    Heikalabad, Saeed Rasouli; Gadim, Mahya Rahimpour

    2018-06-01

    The quantum-dot cellular automata (QCA) can be replaced to overcome the limitation of CMOS technology. An arithmetic logic unit (ALU) is a basic structure of any computer devices. In this paper, design of improved single-bit arithmetic logic unit in quantum dot cellular automata is presented. The proposed structure for ALU has AND, OR, XOR and ADD operations. A unique 2:1 multiplexer, an ultra-efficient two-input XOR and a low complexity full adder are used in the proposed structure. Also, an extended design of this structure is provided for two-bit ALU in this paper. The proposed structure of ALU is simulated by QCADesigner and simulation result is evaluated. Evaluation results show that the proposed design has best performance in terms of area, complexity and delay compared to the previous designs.

  12. Simulations of fluid flow through porous media based on cellular automata and non-linear dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Paulson, K V

    1992-05-15

    A study is being carried out to apply cellular automata and non-linear dynamics in the construction of efficient and accurate computer simulations of multiphase fluid flow through porous media, with the objective of application to reservoir modelling for hydrocarbon recovery. An algorithm based on Boolean operations has been developed which transforms a PC clone into a highly efficient vector processor capable of cellular automata simulation of single fluid flow through two-dimensional rock matrix models of varying porosities. Macroscopic flow patterns have been established through spatial and temporal averaging with no floating point operations. Permeabilities of the different models have been calculated. Hardware allows the algorithm to function on dual processors on a PC platform using a video recording and editing facility. Very encouraging results have been obtained. 4 figs.

  13. New efficient five-input majority gate for quantum-dot cellular automata

    International Nuclear Information System (INIS)

    Farazkish, Razieh; Navi, Keivan

    2012-01-01

    A novel fault-tolerant five-input majority gate for quantum-dot cellular automata is presented. Quantum-dot cellular automata (QCA) is an emerging technology which is considered to be presented in future computers. Two principle logic elements in QCA are “majority gate” and “inverter.” In this paper, we propose a new approach to the design of fault-tolerant five-input majority gate by considering two-dimensional arrays of QCA cells. We analyze fault tolerance properties of such block five-input majority gate in terms of misalignment, missing, and dislocation cells. Some physical proofs are used for verifying five-input majority gate circuit layout and functionality. Our results clearly demonstrate that the redundant version of the block five-input majority gate is more robust than the standard style for this gate.

  14. Stair evacuation simulation based on cellular automata considering evacuees’ walk preferences

    International Nuclear Information System (INIS)

    Ding Ning; Luh, Peter B.; Zhang Hui; Chen Tao

    2015-01-01

    As a physical model, the cellular automata (CA) model is widely used in many areas, such as stair evacuation. However, existing CA models do not consider evacuees’ walk preferences nor psychological status, and the structure of the basic model is unapplicable for the stair structure. This paper is to improve the stair evacuation simulation by addressing these issues, and a new cellular automata model is established. Several evacuees’ walk preference and how evacuee’s psychology influences their behaviors are introduced into this model. Evacuees’ speeds will be influenced by these features. To validate this simulation, two fire drills held in two high-rise buildings are video-recorded. It is found that the simulation results are similar to the fire drill results. The structure of this model is simple, and it is easy to further develop and utilize in different buildings with various kinds of occupants. (paper)

  15. Parallel Genetic Algorithms for calibrating Cellular Automata models: Application to lava flows

    International Nuclear Information System (INIS)

    D'Ambrosio, D.; Spataro, W.; Di Gregorio, S.; Calabria Univ., Cosenza; Crisci, G.M.; Rongo, R.; Calabria Univ., Cosenza

    2005-01-01

    Cellular Automata are highly nonlinear dynamical systems which are suitable far simulating natural phenomena whose behaviour may be specified in terms of local interactions. The Cellular Automata model SCIARA, developed far the simulation of lava flows, demonstrated to be able to reproduce the behaviour of Etnean events. However, in order to apply the model far the prediction of future scenarios, a thorough calibrating phase is required. This work presents the application of Genetic Algorithms, general-purpose search algorithms inspired to natural selection and genetics, far the parameters optimisation of the model SCIARA. Difficulties due to the elevated computational time suggested the adoption a Master-Slave Parallel Genetic Algorithm far the calibration of the model with respect to the 2001 Mt. Etna eruption. Results demonstrated the usefulness of the approach, both in terms of computing time and quality of performed simulations

  16. Simulation of a plane wavefront propagating in cardiac tissue using a cellular automata model

    International Nuclear Information System (INIS)

    Barbosa, Carlos R Hall

    2003-01-01

    We present a detailed description of a cellular automata model for the propagation of action potential in a planar cardiac tissue, which is very fast and easy to use. The model incorporates anisotropy in the electrical conductivity and a spatial variation of the refractory time. The transmembrane potential distribution is directly derived from the cell states, and the intracellular and extracellular potential distributions are calculated for the particular case of a plane wavefront. Once the potential distributions are known, the associated current densities are calculated by Ohm's law, and the magnetic field is determined at a plane parallel to the cardiac tissue by applying the law of Biot and Savart. The results obtained for propagation speed and for magnetic field amplitude with the cellular automata model are compared with values predicted by the bidomain formulation, for various angles between wavefront propagation and fibre direction, characterizing excellent agreement between the models

  17. An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata

    DEFF Research Database (Denmark)

    Byg, Joakim; Jørgensen, Kenneth Yrke; Srba, Jiri

    2009-01-01

    Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the described mutual trans- lations are rather inefficient. We propose an extension of timed-arc Petri nets with invariants...... to enforce urgency and with transport arcs to generalise the read-arcs. We also describe a novel translation from the extended timed-arc Petri net model to networks of timed automata. The translation is implemented in the tool TAPAAL and it uses UPPAAL as the verification engine. Our experiments confirm...... the efficiency of the translation and in some cases the translated models verify significantly faster than the native UPPAAL models do....

  18. A cellular automata model of traffic flow with variable probability of randomization

    International Nuclear Information System (INIS)

    Zheng Wei-Fan; Zhang Ji-Ye

    2015-01-01

    Research on the stochastic behavior of traffic flow is important to understand the intrinsic evolution rules of a traffic system. By introducing an interactional potential of vehicles into the randomization step, an improved cellular automata traffic flow model with variable probability of randomization is proposed in this paper. In the proposed model, the driver is affected by the interactional potential of vehicles before him, and his decision-making process is related to the interactional potential. Compared with the traditional cellular automata model, the modeling is more suitable for the driver’s random decision-making process based on the vehicle and traffic situations in front of him in actual traffic. From the improved model, the fundamental diagram (flow–density relationship) is obtained, and the detailed high-density traffic phenomenon is reproduced through numerical simulation. (paper)

  19. Energy dissipation dataset for reversible logic gates in quantum dot-cellular automata

    Directory of Open Access Journals (Sweden)

    Ali Newaz Bahar

    2017-02-01

    Full Text Available This paper presents an energy dissipation dataset of different reversible logic gates in quantum-dot cellular automata. The proposed circuits have been designed and verified using QCADesigner simulator. Besides, the energy dissipation has been calculated under three different tunneling energy level at temperature T=2 K. For estimating the energy dissipation of proposed gates; QCAPro tool has been employed.

  20. Behavioural differential equations : a coinductive calculus of streams, automata, and power series

    OpenAIRE

    Rutten, Jan

    2000-01-01

    textabstractStreams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive definitions take the shape of what we have called behavioural differential equations, after Brzozowski's notion of input deriv...

  1. Canalization and control in automata networks: body segmentation in Drosophila melanogaster.

    Directory of Open Access Journals (Sweden)

    Manuel Marques-Pita

    Full Text Available We present schema redescription as a methodology to characterize canalization in automata networks used to model biochemical regulation and signalling. In our formulation, canalization becomes synonymous with redundancy present in the logic of automata. This results in straightforward measures to quantify canalization in an automaton (micro-level, which is in turn integrated into a highly scalable framework to characterize the collective dynamics of large-scale automata networks (macro-level. This way, our approach provides a method to link micro- to macro-level dynamics--a crux of complexity. Several new results ensue from this methodology: uncovering of dynamical modularity (modules in the dynamics rather than in the structure of networks, identification of minimal conditions and critical nodes to control the convergence to attractors, simulation of dynamical behaviour from incomplete information about initial conditions, and measures of macro-level canalization and robustness to perturbations. We exemplify our methodology with a well-known model of the intra- and inter cellular genetic regulation of body segmentation in Drosophila melanogaster. We use this model to show that our analysis does not contradict any previous findings. But we also obtain new knowledge about its behaviour: a better understanding of the size of its wild-type attractor basin (larger than previously thought, the identification of novel minimal conditions and critical nodes that control wild-type behaviour, and the resilience of these to stochastic interventions. Our methodology is applicable to any complex network that can be modelled using automata, but we focus on biochemical regulation and signalling, towards a better understanding of the (decentralized control that orchestrates cellular activity--with the ultimate goal of explaining how do cells and tissues 'compute'.

  2. a Predator-Prey Model Based on the Fully Parallel Cellular Automata

    Science.gov (United States)

    He, Mingfeng; Ruan, Hongbo; Yu, Changliang

    We presented a predator-prey lattice model containing moveable wolves and sheep, which are characterized by Penna double bit strings. Sexual reproduction and child-care strategies are considered. To implement this model in an efficient way, we build a fully parallel Cellular Automata based on a new definition of the neighborhood. We show the roles played by the initial densities of the populations, the mutation rate and the linear size of the lattice in the evolution of this model.

  3. Model Skinner Operant Conditioning automata i bionički naučeno upravljanje robota

    OpenAIRE

    Cai, Jianxian; Hong, Li; Cheng, Lina; Yu, Ruihong

    2016-01-01

    Fuzzy Skinner Operant Conditioning Automaton (FSOCA) sastavljen je na temelju Operant Conditioning mehanizma primjenom teorije neizrazitih skupova. Osnovno obilježje automata FSOCA je sljedeće: neizraziti rezultati stanja pomoću Gausove funkcije koriste se kao skupovi neizrazitog stanja; neizrazita pravila preslikavanja (fuzzy mapping rules) kod fuzzy-conditioning-operacije zamjenjuju stohastičke "conditioning-operant" skupove preslikavanja. Stoga se automat FSOCA može koristiti za opisivanje...

  4. Excellent approach to modeling urban expansion by fuzzy cellular automata: agent base model

    Science.gov (United States)

    Khajavigodellou, Yousef; Alesheikh, Ali A.; Mohammed, Abdulrazak A. S.; Chapi, Kamran

    2014-09-01

    Recently, the interaction between humans and their environment is the one of important challenges in the world. Landuse/ cover change (LUCC) is a complex process that includes actors and factors at different social and spatial levels. The complexity and dynamics of urban systems make the applicable practice of urban modeling very difficult. With the increased computational power and the greater availability of spatial data, micro-simulation such as the agent based and cellular automata simulation methods, has been developed by geographers, planners, and scholars, and it has shown great potential for representing and simulating the complexity of the dynamic processes involved in urban growth and land use change. This paper presents Fuzzy Cellular Automata in Geospatial Information System and remote Sensing to simulated and predicted urban expansion pattern. These FCA-based dynamic spatial urban models provide an improved ability to forecast and assess future urban growth and to create planning scenarios, allowing us to explore the potential impacts of simulations that correspond to urban planning and management policies. A fuzzy inference guided cellular automata approach. Semantic or linguistic knowledge on Land use change is expressed as fuzzy rules, based on which fuzzy inference is applied to determine the urban development potential for each pixel. The model integrates an ABM (agent-based model) and FCA (Fuzzy Cellular Automata) to investigate a complex decision-making process and future urban dynamic processes. Based on this model rapid development and green land protection under the influences of the behaviors and decision modes of regional authority agents, real estate developer agents, resident agents and non- resident agents and their interactions have been applied to predict the future development patterns of the Erbil metropolitan region.

  5. Application of lattice-gas cellular automata to the Brownian motion of solids in suspension

    International Nuclear Information System (INIS)

    Ladd, A.J.C.; Colvin, M.E.; Frenkel, D.

    1988-01-01

    An adaptation of lattice-gas cellular automata to the simulation of solid-fluid suspensions is described. The method incorporates both dissipative hydrodynamic forces and thermal fluctuations. At low solid densities, theoretical results for the drag force on a single disk and the viscosity of a suspension of disks are reproduced. The zero--shear-rate viscosity has been obtained over a range of packing fractions and results indicate that simulations of three-dimensional suspensions are feasible

  6. Canalization and control in automata networks: body segmentation in Drosophila melanogaster.

    Science.gov (United States)

    Marques-Pita, Manuel; Rocha, Luis M

    2013-01-01

    We present schema redescription as a methodology to characterize canalization in automata networks used to model biochemical regulation and signalling. In our formulation, canalization becomes synonymous with redundancy present in the logic of automata. This results in straightforward measures to quantify canalization in an automaton (micro-level), which is in turn integrated into a highly scalable framework to characterize the collective dynamics of large-scale automata networks (macro-level). This way, our approach provides a method to link micro- to macro-level dynamics--a crux of complexity. Several new results ensue from this methodology: uncovering of dynamical modularity (modules in the dynamics rather than in the structure of networks), identification of minimal conditions and critical nodes to control the convergence to attractors, simulation of dynamical behaviour from incomplete information about initial conditions, and measures of macro-level canalization and robustness to perturbations. We exemplify our methodology with a well-known model of the intra- and inter cellular genetic regulation of body segmentation in Drosophila melanogaster. We use this model to show that our analysis does not contradict any previous findings. But we also obtain new knowledge about its behaviour: a better understanding of the size of its wild-type attractor basin (larger than previously thought), the identification of novel minimal conditions and critical nodes that control wild-type behaviour, and the resilience of these to stochastic interventions. Our methodology is applicable to any complex network that can be modelled using automata, but we focus on biochemical regulation and signalling, towards a better understanding of the (decentralized) control that orchestrates cellular activity--with the ultimate goal of explaining how do cells and tissues 'compute'.

  7. Synchronization, TIGoRS, and Information Flow in Complex Systems: Dispositional Cellular Automata.

    Science.gov (United States)

    Sulis, William H

    2016-04-01

    Synchronization has a long history in physics where it refers to the phase matching of two identical oscillators. This notion has been extensively studied in physics as well as in biology, where it has been applied to such widely varying phenomena as the flashing of fireflies and firing of neurons in the brain. Human behavior, however, may be recurrent but it is not oscillatory even though many physiological systems do exhibit oscillatory tendencies. Moreover, much of human behaviour is collaborative and cooperative, where the individual behaviours may be distinct yet contemporaneous (if not simultaneous) and taken collectively express some functionality. In the context of behaviour, the important aspect is the repeated co-occurrence in time of behaviours that facilitate the propagation of information or of functionality, regardless of whether or not these behaviours are similar or identical. An example of this weaker notion of synchronization is transient induced global response synchronization (TIGoRS). Previous work has shown that TIGoRS is a ubiquitous phenomenon among complex systems, enabling them to stably parse environmental transients into salient units to which they stably respond. This leads to the notion of Sulis machines, which emergently generate a primitive linguistic structure through their dynamics. This article reviews the notion of TIGoRS and its expression in several complex systems models including tempered neural networks, driven cellular automata and cocktail party automata. The emergent linguistics of Sulis machines are discussed. A new class of complex systems model, the dispositional cellular automaton is introduced. A new metric for TIGoRS, the excess synchronization, is introduced and applied to the study of TIGoRS in dispositional cellular automata. It is shown that these automata exhibit a nonlinear synchronization response to certain perturbing transients.

  8. Addressing population heterogeneity and distribution in epidemics models using a cellular automata approach.

    Science.gov (United States)

    López, Leonardo; Burguerner, Germán; Giovanini, Leonardo

    2014-04-12

    The spread of an infectious disease is determined by biological and social factors. Models based on cellular automata are adequate to describe such natural systems consisting of a massive collection of simple interacting objects. They characterize the time evolution of the global system as the emergent behaviour resulting from the interaction of the objects, whose behaviour is defined through a set of simple rules that encode the individual behaviour and the transmission dynamic. An epidemic is characterized trough an individual-based-model built upon cellular automata. In the proposed model, each individual of the population is represented by a cell of the automata. This way of modeling an epidemic situation allows to individually define the characteristic of each individual, establish different scenarios and implement control strategies. A cellular automata model to study the time evolution of a heterogeneous populations through the various stages of disease was proposed, allowing the inclusion of individual heterogeneity, geographical characteristics and social factors that determine the dynamic of the desease. Different assumptions made to built the classical model were evaluated, leading to following results: i) for low contact rate (like in quarantine process or low density population areas) the number of infective individuals is lower than other areas where the contact rate is higher, and ii) for different initial spacial distributions of infected individuals different epidemic dynamics are obtained due to its influence on the transition rate and the reproductive ratio of disease. The contact rate and spatial distributions have a central role in the spread of a disease. For low density populations the spread is very low and the number of infected individuals is lower than in highly populated areas. The spacial distribution of the population and the disease focus as well as the geographical characteristic of the area play a central role in the dynamics of the

  9. Cell Based GIS as Cellular Automata for Disaster Spreading Predictions and Required Data Systems

    Directory of Open Access Journals (Sweden)

    Kohei Arai

    2013-03-01

    Full Text Available A method for prediction and simulation based on the Cell Based Geographic Information System(GIS as Cellular Automata (CA is proposed together with required data systems, in particular metasearch engine usage in an unified way. It is confirmed that the proposed cell based GIS as CA has flexible usage of the attribute information that is attached to the cell in concert with location information and does work for disaster spreading simulation and prediction.

  10. Linear reversible second-order cellular automata and their first-order matrix equivalents

    International Nuclear Information System (INIS)

    Macfarlane, A J

    2004-01-01

    Linear or one-dimensional reversible second-order cellular automata, exemplified by three cases named as RCA1-3, are introduced. Displays of their evolution in discrete time steps, t=0, 1, 2, ..., from their simplest initial states and on the basis of updating rules in modulo 2 arithmetic, are presented. In these, shaded and unshaded squares denote cells whose cell variables are equal to one and zero respectively. This paper is devoted to finding general formulas for, and explicit numerical evaluations of, the weights N(t) of the states or configurations of RCA1-3, i.e. the total number of shaded cells in tth line of their displays. This is achieved by means of the replacement of RCA1-3 by the equivalent linear first-order matrix automata MCA1-3, for which the cell variables are 2x2 matrices, instead of just numbers (element of Z 2 ) as for RCA1-3. MCA1-3 are tractable because it has been possible to generalize to them the heavy duty methods already well-developed for ordinary first-order cellular automata like those of Wolfram's Rules 90 and 150. While the automata MCA1-3 are thought to be of genuine interest in their own right, with untapped further mathematical potential, their treatment has been applied here to expediting derivation of a large body of general and explicit results for N(t) for RCA1-3. Amongst explicit results obtained are formulas also for each of RCA1-3 for the total weight of the configurations of the first 2 M times, M=0, 1, 2, ..

  11. Quasi-adiabatic Switching for Metal-Island Quantum-dot Cellular Automata

    OpenAIRE

    Toth, Geza; Lent, Craig S.

    2000-01-01

    Recent experiments have demonstrated a working cell suitable for implementing the Quantum-dot Cellular Automata (QCA) paradigm. These experiments have been performed using metal island clusters. The most promising approach to QCA operation involves quasi-adiabatically switching the cells. This has been analyzed extensively in gated semiconductor cells. Here we present a metal island cell structure that makes quasi-adiabatic switching possible. We show how this permits quasi-adiabatic clocking...

  12. Comments On Clock Models In Hybrid Automata And Hybrid Control Systems

    Directory of Open Access Journals (Sweden)

    Virginia Ecaterina OLTEAN

    2001-12-01

    Full Text Available Hybrid systems have received a lot of attention in the past decade and a number of different models have been proposed in order to establish mathematical framework that is able to handle both continuous and discrete aspects. This contribution is focused on two models: hybrid automata and hybrid control systems with continuous-discrete interface and the importance of clock models is emphasized. Simple and relevant examples, some taken from the literature, accompany the presentation.

  13. Prisoner's Dilemma in One-Dimensional Cellular Automata: Visualization of Evolutionary Patterns

    OpenAIRE

    Pereira, Marcelo Alves; Martinez, Alexandre Souto; Espindola, Aquino Lauri

    2007-01-01

    The spatial Prisoner's Dilemma is a prototype model to show the emergence of cooperation in very competitive environments. It considers players, at site of lattices, that can either cooperate or defect when playing the Prisoner's Dilemma with other z players. This model presents a rich phase diagram. Here we consider players in cells of one-dimensional cellular automata. Each player interacts with other z players. This geometry allows us to vary, in a simple manner, the number of neighbors ra...

  14. A 3-D model of tumor progression based on complex automata driven by particle dynamics.

    Science.gov (United States)

    Wcisło, Rafał; Dzwinel, Witold; Yuen, David A; Dudek, Arkadiusz Z

    2009-12-01

    The dynamics of a growing tumor involving mechanical remodeling of healthy tissue and vasculature is neglected in most of the existing tumor models. This is due to the lack of efficient computational framework allowing for simulation of mechanical interactions. Meanwhile, just these interactions trigger critical changes in tumor growth dynamics and are responsible for its volumetric and directional progression. We describe here a novel 3-D model of tumor growth, which combines particle dynamics with cellular automata concept. The particles represent both tissue cells and fragments of the vascular network. They interact with their closest neighbors via semi-harmonic central forces simulating mechanical resistance of the cell walls. The particle dynamics is governed by both the Newtonian laws of motion and the cellular automata rules. These rules can represent cell life-cycle and other biological interactions involving smaller spatio-temporal scales. We show that our complex automata, particle based model can reproduce realistic 3-D dynamics of the entire system consisting of the tumor, normal tissue cells, blood vessels and blood flow. It can explain phenomena such as the inward cell motion in avascular tumor, stabilization of tumor growth by the external pressure, tumor vascularization due to the process of angiogenesis, trapping of healthy cells by invading tumor, and influence of external (boundary) conditions on the direction of tumor progression. We conclude that the particle model can serve as a general framework for designing advanced multiscale models of tumor dynamics and it is very competitive to the modeling approaches presented before.

  15. An energy and cost efficient majority-based RAM cell in quantum-dot cellular automata

    Directory of Open Access Journals (Sweden)

    Milad Bagherian Khosroshahy

    Full Text Available Nanotechnologies, notably quantum-dot cellular automata, have achieved major attentions for their prominent features as compared to the conventional CMOS circuitry. Quantum-dot cellular automata, particularly owning to its considerable reduction in size, high switching speed and ultra-low energy consumption, is considered as a potential alternative for the CMOS technology. As the memory unit is one of the most essential components in a digital system, designing a well-optimized QCA random access memory (RAM cell is an important area of research. In this paper, a new five-input majority gate is presented which is suitable for implementing efficient single-layer QCA circuits. In addition, a new RAM cell with set and reset capabilities is designed based on the proposed majority gate, which has an efficient and low-energy structure. The functionality, performance and energy consumption of the proposed designs are evaluated based on the QCADesigner and QCAPro tools. According to the simulation results, the proposed RAM design leads to on average 38% lower total energy dissipation, 25% smaller area, 20% lower cell count, 28% lower delay and 60% lower QCA cost as compared to its previous counterparts. Keywords: Quantum-dot cellular automata (QCA, Majority gate, Random access memory (RAM, Energy efficiency

  16. On the derivation of approximations to cellular automata models and the assumption of independence.

    Science.gov (United States)

    Davies, K J; Green, J E F; Bean, N G; Binder, B J; Ross, J V

    2014-07-01

    Cellular automata are discrete agent-based models, generally used in cell-based applications. There is much interest in obtaining continuum models that describe the mean behaviour of the agents in these models. Previously, continuum models have been derived for agents undergoing motility and proliferation processes, however, these models only hold under restricted conditions. In order to narrow down the reason for these restrictions, we explore three possible sources of error in deriving the model. These sources are the choice of limiting arguments, the use of a discrete-time model as opposed to a continuous-time model and the assumption of independence between the state of sites. We present a rigorous analysis in order to gain a greater understanding of the significance of these three issues. By finding a limiting regime that accurately approximates the conservation equation for the cellular automata, we are able to conclude that the inaccuracy between our approximation and the cellular automata is completely based on the assumption of independence. Copyright © 2014 Elsevier Inc. All rights reserved.

  17. Autonomously Implemented Versatile Path Planning for Mobile Robots Based on Cellular Automata and Ant Colony

    Directory of Open Access Journals (Sweden)

    Adel Akbarimajd

    2012-02-01

    Full Text Available A path planning method for mobile robots based on two dimensional cellular automata is proposed. The method can be applied for environments with both concave and convex obstacles. It is also appropriate for multi-robot problems as well as dynamic environments. In order to develop the planning method, environment of the robot is decomposed to a rectangular grid and the automata is defined with four states including Robot cell, Free cell, Goal cell and Obstacle cell. Evolution rules of automata are proposed in order to direct the robot toward its goal. CA based path planner method is afterwards modified by a colony technique to be applicable for concave obstacles. Then a layered architecture is proposed to autonomously implement the planning algorithm. The architecture employs an abstraction approach which makes the complexity manageable. An important feature of the architecture is internal artifacts that have some beliefs about the world. Most actions of the robot are planned and performed with respect to these artifacts.

  18. Query Monitoring and Analysis for Database Privacy - A Security Automata Model Approach.

    Science.gov (United States)

    Kumar, Anand; Ligatti, Jay; Tu, Yi-Cheng

    2015-11-01

    Privacy and usage restriction issues are important when valuable data are exchanged or acquired by different organizations. Standard access control mechanisms either restrict or completely grant access to valuable data. On the other hand, data obfuscation limits the overall usability and may result in loss of total value. There are no standard policy enforcement mechanisms for data acquired through mutual and copyright agreements. In practice, many different types of policies can be enforced in protecting data privacy. Hence there is the need for an unified framework that encapsulates multiple suites of policies to protect the data. We present our vision of an architecture named security automata model (SAM) to enforce privacy-preserving policies and usage restrictions. SAM analyzes the input queries and their outputs to enforce various policies, liberating data owners from the burden of monitoring data access. SAM allows administrators to specify various policies and enforces them to monitor queries and control the data access. Our goal is to address the problems of data usage control and protection through privacy policies that can be defined, enforced, and integrated with the existing access control mechanisms using SAM. In this paper, we lay out the theoretical foundation of SAM, which is based on an automata named Mandatory Result Automata. We also discuss the major challenges of implementing SAM in a real-world database environment as well as ideas to meet such challenges.

  19. FPGA Implementation of one-dimensional and two-dimensional cellular automata

    International Nuclear Information System (INIS)

    D'Antone, I.

    1999-01-01

    This report describes the hardware implementation of one-dimensional and two-dimensional cellular automata (CAs). After a general introduction to the cellular automata, we consider a one-dimensional CA used to implement pseudo-random techniques in built-in self test for VLSI. Due to the increase in digital ASIC complexity, testing is becoming one of the major costs in the VLSI production. The high electronics complexity, used in particle physics experiments, demands higher reliability than in the past time. General criterions are given to evaluate the feasibility of the circuit used for testing and some quantitative parameters are underlined to optimize the architecture of the cellular automaton. Furthermore, we propose a two-dimensional CA that performs a peak finding algorithm in a matrix of cells mapping a sub-region of a calorimeter. As in a two-dimensional filtering process, the peaks of the energy clusters are found in one evolution step. This CA belongs to Wolfram class II cellular automata. Some quantitative parameters are given to optimize the architecture of the cellular automaton implemented in a commercial field programmable gate array (FPGA)

  20. A new optimization method based on cellular automata for VVER-1000 nuclear reactor loading pattern

    International Nuclear Information System (INIS)

    Fadaei, Amir Hosein; Setayeshi, Saeed

    2009-01-01

    This paper presents a new and innovative optimization technique, which uses cellular automata for solving multi-objective optimization problems. Due to its ability in simulating the local information while taking neighboring effects into account, the cellular automata technique is a powerful tool for optimization. The fuel-loading pattern in nuclear reactor cores is a major optimization problem. Due to the immensity of the search space in fuel management optimization problems, finding the optimum solution requires a huge amount of calculations in the classical method. The cellular automata models, based on local information, can reduce the computations significantly. In this study, reducing the power peaking factor, while increasing the initial excess reactivity inside the reactor core of VVER-1000, which are two apparently contradictory objectives, are considered as the objective functions. The result is an optimum configuration, which is in agreement with the pattern proposed by the designer. In order to gain confidence in the reliability of this method, the aforementioned problem was also solved using neural network and simulated annealing, and the results and procedures were compared.

  1. Effects of Initial Symmetry on the Global Symmetry of One-Dimensional Legal Cellular Automata

    Directory of Open Access Journals (Sweden)

    Ikuko Tanaka

    2015-09-01

    Full Text Available To examine the development of pattern formation from the viewpoint of symmetry, we applied a two-dimensional discrete Walsh analysis to a one-dimensional cellular automata model under two types of regular initial conditions. The amount of symmetropy of cellular automata (CA models under regular and random initial conditions corresponds to three Wolfram’s classes of CAs, identified as Classes II, III, and IV. Regular initial conditions occur in two groups. One group that makes a broken, regular pattern formation has four types of symmetry, whereas the other group that makes a higher hierarchy pattern formation has only two types. Additionally, both final pattern formations show an increased amount of symmetropy as time passes. Moreover, the final pattern formations are affected by iterations of base rules of CA models of chaos dynamical systems. The growth design formations limit possibilities: the ratio of developing final pattern formations under a regular initial condition decreases in the order of Classes III, II, and IV. This might be related to the difference in degree in reference to surrounding conditions. These findings suggest that calculations of symmetries of the structures of one-dimensional cellular automata models are useful for revealing rules of pattern generation for animal bodies.

  2. Iris segmentation using an edge detector based on fuzzy sets theory and cellular learning automata.

    Science.gov (United States)

    Ghanizadeh, Afshin; Abarghouei, Amir Atapour; Sinaie, Saman; Saad, Puteh; Shamsuddin, Siti Mariyam

    2011-07-01

    Iris-based biometric systems identify individuals based on the characteristics of their iris, since they are proven to remain unique for a long time. An iris recognition system includes four phases, the most important of which is preprocessing in which the iris segmentation is performed. The accuracy of an iris biometric system critically depends on the segmentation system. In this paper, an iris segmentation system using edge detection techniques and Hough transforms is presented. The newly proposed edge detection system enhances the performance of the segmentation in a way that it performs much more efficiently than the other conventional iris segmentation methods.

  3. Systolic trees and systolic language recognition by tree automata

    Energy Technology Data Exchange (ETDEWEB)

    Steinby, M

    1983-01-01

    K. Culik II, J. Gruska, A. Salomaa and D. Wood have studied the language recognition capabilities of certain types of systolically operating networks of processors (see research reports Cs-81-32, Cs-81-36 and Cs-82-01, Univ. of Waterloo, Ontario, Canada). In this paper, their model for systolic VLSI trees is formalised in terms of standard tree automaton theory, and the way in which some known facts about recognisable forests and tree transductions can be applied in VLSI tree theory is demonstrated. 13 references.

  4. Self-organized perturbations enhance class IV behavior and 1/f power spectrum in elementary cellular automata.

    Science.gov (United States)

    Nakajima, Kohei; Haruna, Taichi

    2011-09-01

    In this paper, we propose a new class of cellular automata based on the modification of its state space. It is introduced to model a computation which is exposed to an environment. We formalized the computation as extension and projection processes of its state space and resulting misidentifications of the state. This is motivated to embed the role of an environment into the system itself, which naturally induces self-organized internal perturbations rather than the usual external perturbations. Implementing this structure into the elementary cellular automata, we characterized its effect by means of input entropy and power spectral analysis. As a result, the cellular automata with this structure showed robust class IV behavior and a 1/f power spectrum in a wide range of rule space comparative to the notion of the edge of chaos. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

  5. Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata.

    Science.gov (United States)

    Chen, Yangzhou; Guo, Yuqi; Wang, Ying

    2017-03-29

    In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research.

  6. A verification strategy for web services composition using enhanced stacked automata model.

    Science.gov (United States)

    Nagamouttou, Danapaquiame; Egambaram, Ilavarasan; Krishnan, Muthumanickam; Narasingam, Poonkuzhali

    2015-01-01

    Currently, Service-Oriented Architecture (SOA) is becoming the most popular software architecture of contemporary enterprise applications, and one crucial technique of its implementation is web services. Individual service offered by some service providers may symbolize limited business functionality; however, by composing individual services from different service providers, a composite service describing the intact business process of an enterprise can be made. Many new standards have been defined to decipher web service composition problem namely Business Process Execution Language (BPEL). BPEL provides an initial work for forming an Extended Markup Language (XML) specification language for defining and implementing business practice workflows for web services. The problems with most realistic approaches to service composition are the verification of composed web services. It has to depend on formal verification method to ensure the correctness of composed services. A few research works has been carried out in the literature survey for verification of web services for deterministic system. Moreover the existing models did not address the verification properties like dead transition, deadlock, reachability and safetyness. In this paper, a new model to verify the composed web services using Enhanced Stacked Automata Model (ESAM) has been proposed. The correctness properties of the non-deterministic system have been evaluated based on the properties like dead transition, deadlock, safetyness, liveness and reachability. Initially web services are composed using Business Process Execution Language for Web Service (BPEL4WS) and it is converted into ESAM (combination of Muller Automata (MA) and Push Down Automata (PDA)) and it is transformed into Promela language, an input language for Simple ProMeLa Interpreter (SPIN) tool. The model is verified using SPIN tool and the results revealed better recital in terms of finding dead transition and deadlock in contrast to the

  7. On the Correctness of Real-Time Modular Computer Systems Modeling with Stopwatch Automata Networks

    Directory of Open Access Journals (Sweden)

    Alevtina B. Glonina

    2018-01-01

    Full Text Available In this paper, we consider a schedulability analysis problem for real-time modular computer systems (RT MCS. A system configuration is called schedulable if all the jobs finish within their deadlines. The authors propose a stopwatch automata-based general model of RT MCS operation. A model instance for a given RT MCS configuration is a network of stopwatch automata (NSA and it can be built automatically using the general model. A system operation trace, which is necessary for checking the schedulability criterion, can be obtained from the corresponding NSA trace. The paper substantiates the correctness of the proposed approach. A set of correctness requirements to models of system components and to the whole system model were derived from RT MCS specifications. The authors proved that if all models of system components satisfy the corresponding requirements, the whole system model built according to the proposed approach satisfies its correctness requirements and is deterministic (i.e. for a given configuration a trace generated by the corresponding model run is uniquely determined. The model determinism implies that any model run can be used for schedulability analysis. This fact is crucial for the approach efficiency, as the number of possible model runs grows exponentially with the number of jobs in a system. Correctness requirements to models of system components models can be checked automatically by a verifier using observer automata approach. The authors proved by using UPPAAL verifier that all the developed models of system components satisfy the corresponding requirements. User-defined models of system components can be also used for system modeling if they satisfy the requirements.

  8. The Development of Design Tools for Fault Tolerant Quantum Dot Cellular Automata Based Logic

    Science.gov (United States)

    Armstrong, Curtis D.; Humphreys, William M.

    2003-01-01

    We are developing software to explore the fault tolerance of quantum dot cellular automata gate architectures in the presence of manufacturing variations and device defects. The Topology Optimization Methodology using Applied Statistics (TOMAS) framework extends the capabilities of the A Quantum Interconnected Network Array Simulator (AQUINAS) by adding front-end and back-end software and creating an environment that integrates all of these components. The front-end tools establish all simulation parameters, configure the simulation system, automate the Monte Carlo generation of simulation files, and execute the simulation of these files. The back-end tools perform automated data parsing, statistical analysis and report generation.

  9. The Design of Fault Tolerant Quantum Dot Cellular Automata Based Logic

    Science.gov (United States)

    Armstrong, C. Duane; Humphreys, William M.; Fijany, Amir

    2002-01-01

    As transistor geometries are reduced, quantum effects begin to dominate device performance. At some point, transistors cease to have the properties that make them useful computational components. New computing elements must be developed in order to keep pace with Moore s Law. Quantum dot cellular automata (QCA) represent an alternative paradigm to transistor-based logic. QCA architectures that are robust to manufacturing tolerances and defects must be developed. We are developing software that allows the exploration of fault tolerant QCA gate architectures by automating the specification, simulation, analysis and documentation processes.

  10. Six-Correction Logic (SCL Gates in Quantum-dot Cellular Automata (QCA

    Directory of Open Access Journals (Sweden)

    Md. Anisur Rahman

    2015-11-01

    Full Text Available Quantum Dot Cellular Automata (QCA is a promising nanotechnology in Quantum electronics for its ultra low power consumption, faster speed and small size features. It has significant advantages over the Complementary Metal–Oxide–Semiconductor (CMOS technology. This paper present, a novel QCA representation of Six-Correction Logic (SCL gate based on QCA logic gates: the Maj3, Maj AND gate and Maj OR. In order to design and verify the functionality of the proposed layout, QCADesigner a familiar QCA simulator has been employed. The simulation results confirm correctness of the claims and its usefulness in designing a digital circuits.

  11. Glider-based computing in reaction-diffusion hexagonal cellular automata

    International Nuclear Information System (INIS)

    Adamatzky, Andrew; Wuensche, Andrew; De Lacy Costello, Benjamin

    2006-01-01

    A three-state hexagonal cellular automaton, discovered in [Wuensche A. Glider dynamics in 3-value hexagonal cellular automata: the beehive rule. Int J Unconvention Comput, in press], presents a conceptual discrete model of a reaction-diffusion system with inhibitor and activator reagents. The automaton model of reaction-diffusion exhibits mobile localized patterns (gliders) in its space-time dynamics. We show how to implement the basic computational operations with these mobile localizations, and thus demonstrate collision-based logical universality of the hexagonal reaction-diffusion cellular automaton

  12. Evolutionary Cellular Automata for Image Segmentation and Noise Filtering Using Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Sihem SLATNIA

    2011-01-01

    Full Text Available We use an evolutionary process to seek a specialized set of rules among a wide range of rules to be used by Cellular Automata (CA for a range of tasks,extracting edges in a given gray or colour image, noise filtering applied to black-white image. This is the best set of local rules determine the future state of CA in an asynchronous way. The Genetic Algorithm (GA is applied to search the best CA rules that can realize the best edge detection and noise filtering.

  13. Evolutionary Cellular Automata for Image Segmentation and Noise Filtering Using Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Okba Kazar

    2011-01-01

    Full Text Available We use an evolutionary process to seek a specialized set of rules among a wide range of rules to be used by Cellular Automata (CA for a range of tasks, extracting edges in a given gray or colour image, noise filtering applied to black-white image. This is the best set of local rules determine the future state of CA in an asynchronous way. The Genetic Algorithm (GA is applied to search the best CA rules that can realize the best edge detection and noise filtering.

  14. On the effect of memory in one-dimensional K=4 automata on networks

    Science.gov (United States)

    Alonso-Sanz, Ramón; Cárdenas, Juan Pablo

    2008-12-01

    The effect of implementing memory in cells of one-dimensional CA, and on nodes of various types of automata on networks with increasing degrees of random rewiring is studied in this article, paying particular attention to the case of four inputs. As a rule, memory induces a moderation in the rate of changing nodes and in the damage spreading, albeit in the latter case memory turns out to be ineffective in the control of the damage as the wiring network moves away from the ordered structure that features proper one-dimensional CA. This article complements the previous work done in the two-dimensional context.

  15. A study for bank effect on ship traffic in narrow water channels using cellular automata

    Science.gov (United States)

    Sun, Zhuo; Cong, Shuang; Pan, Junnan; Zheng, Jianfeng

    2017-12-01

    In narrow water channels, bank might affect nearby ships due to hydrodynamic forces (bank effect). To avoid accidents, different sailing rules (i.e., lane-changing, speed control) are required. In this paper, a two-lane cellular automata model is proposed to evaluate such phenomena. Numerical experiments show that ships will form a “slow-moving chunk” in the bank area, which will significantly block the flux. As further study demonstrated to alleviate bank effect, ship speed and bank length should be controlled.

  16. Stochastic modeling for dynamics of HIV-1 infection using cellular automata: A review.

    Science.gov (United States)

    Precharattana, Monamorn

    2016-02-01

    Recently, the description of immune response by discrete models has emerged to play an important role to study the problems in the area of human immunodeficiency virus type 1 (HIV-1) infection, leading to AIDS. As infection of target immune cells by HIV-1 mainly takes place in the lymphoid tissue, cellular automata (CA) models thus represent a significant step in understanding when the infected population is dispersed. Motivated by these, the studies of the dynamics of HIV-1 infection using CA in memory have been presented to recognize how CA have been developed for HIV-1 dynamics, which issues have been studied already and which issues still are objectives in future studies.

  17. The FPGA realization of the general cellular automata based cryptographic hash functions: Performance and effectiveness

    Directory of Open Access Journals (Sweden)

    P. G. Klyucharev

    2014-01-01

    Full Text Available In the paper the author considers hardware implementation of the GRACE-H family general cellular automata based cryptographic hash functions. VHDL is used as a language and Altera FPGA as a platform for hardware implementation. Performance and effectiveness of the FPGA implementations of GRACE-H hash functions were compared with Keccak (SHA-3, SHA-256, BLAKE, Groestl, JH, Skein hash functions. According to the performed tests, performance of the hardware implementation of GRACE-H family hash functions significantly (up to 12 times exceeded performance of the hardware implementation of previously known hash functions, and effectiveness of that hardware implementation was also better (up to 4 times.

  18. Cellular Automata as a learning process in Architecture and Urban design

    DEFF Research Database (Denmark)

    Jensen, Mads Brath; Foged, Isak Worre

    2014-01-01

    . An architectural methodological response to this situation is presented through the development of a conceptual computational design system that allows these dynamics to unfold and to be observed for architectural design decision taking. Reflecting on the development and implementation of a cellular automata based...... design approach on a master level urban design studio this paper will discuss the strategies for dealing with complexity at an urban scale as well as the pedagogical considerations behind applying computational tools and methods to a urban design education....

  19. Quantum information theory with Gaussian systems

    Energy Technology Data Exchange (ETDEWEB)

    Krueger, O.

    2006-04-06

    This thesis applies ideas and concepts from quantum information theory to systems of continuous-variables such as the quantum harmonic oscillator. The focus is on three topics: the cloning of coherent states, Gaussian quantum cellular automata and Gaussian private channels. Cloning was investigated both for finite-dimensional and for continuous-variable systems. We construct a private quantum channel for the sequential encryption of coherent states with a classical key, where the key elements have finite precision. For the case of independent one-mode input states, we explicitly estimate this precision, i.e. the number of key bits needed per input state, in terms of these parameters. (orig.)

  20. Quantum information theory with Gaussian systems

    International Nuclear Information System (INIS)

    Krueger, O.

    2006-01-01

    This thesis applies ideas and concepts from quantum information theory to systems of continuous-variables such as the quantum harmonic oscillator. The focus is on three topics: the cloning of coherent states, Gaussian quantum cellular automata and Gaussian private channels. Cloning was investigated both for finite-dimensional and for continuous-variable systems. We construct a private quantum channel for the sequential encryption of coherent states with a classical key, where the key elements have finite precision. For the case of independent one-mode input states, we explicitly estimate this precision, i.e. the number of key bits needed per input state, in terms of these parameters. (orig.)

  1. Metal Dependence of Signal Transmission through MolecularQuantum-Dot Cellular Automata (QCA: A Theoretical Studyon Fe, Ru, and Os Mixed-Valence Complexes

    Directory of Open Access Journals (Sweden)

    Ken Tokunaga

    2010-08-01

    Full Text Available Dynamic behavior of signal transmission through metal complexes [L5M-BL-ML5]5+ (M=Fe, Ru, Os, BL=pyrazine (py, 4,4’-bipyridine (bpy, L=NH3, which are simplified models of the molecular quantum-dot cellular automata (molecular QCA, is discussed from the viewpoint of one-electron theory, density functional theory. It is found that for py complexes, the signal transmission time (tst is Fe(0.6 fs < Os(0.7 fs < Ru(1.1 fs and the signal amplitude (A is Fe(0.05 e < Os(0.06 e < Ru(0.10 e. For bpy complexes, tst and A are Fe(1.4 fs < Os(1.7 fs < Ru(2.5 fs and Os(0.11 e < Ru(0.12 e

  2. Evolution of cooperation in Axelrod tournament using cellular automata

    Science.gov (United States)

    Schimit, P. H. T.; Santos, B. O.; Soares, C. A.

    2015-11-01

    Results of the Axelrod Tournament were published in 1981, and since then, evolutionary game theory emerged as an idea for understanding relations, like conflict and cooperation, between rational decision-makers. Robert Axelrod organized it as a round-robin tournament where strategies for iterated Prisoner's Dilemma were faced in a sequence of two players game. Here, we attempt to simulate the strategies submitted to the tournament in a multi-agent context, where individuals play a two-player game with their neighbors. Each individual has one of the strategies, and it plays the Prisoner's Dilemma with its neighbors. According to actions chosen (cooperate or defect), points of life are subtracted from their profiles. When an individual dies, some fitness functions are defined to choose the most successful strategy which the new individual will copy. Although tit-for-tat was the best strategy, on average, in the tournament, in our evolutionary multi-agent context, it has not been successful.

  3. A cardiac electrical activity model based on a cellular automata system in comparison with neural network model.

    Science.gov (United States)

    Khan, Muhammad Sadiq Ali; Yousuf, Sidrah

    2016-03-01

    Cardiac Electrical Activity is commonly distributed into three dimensions of Cardiac Tissue (Myocardium) and evolves with duration of time. The indicator of heart diseases can occur randomly at any time of a day. Heart rate, conduction and each electrical activity during cardiac cycle should be monitor non-invasively for the assessment of "Action Potential" (regular) and "Arrhythmia" (irregular) rhythms. Many heart diseases can easily be examined through Automata model like Cellular Automata concepts. This paper deals with the different states of cardiac rhythms using cellular automata with the comparison of neural network also provides fast and highly effective stimulation for the contraction of cardiac muscles on the Atria in the result of genesis of electrical spark or wave. The specific formulated model named as "States of automaton Proposed Model for CEA (Cardiac Electrical Activity)" by using Cellular Automata Methodology is commonly shows the three states of cardiac tissues conduction phenomena (i) Resting (Relax and Excitable state), (ii) ARP (Excited but Absolutely refractory Phase i.e. Excited but not able to excite neighboring cells) (iii) RRP (Excited but Relatively Refractory Phase i.e. Excited and able to excite neighboring cells). The result indicates most efficient modeling with few burden of computation and it is Action Potential during the pumping of blood in cardiac cycle.

  4. Stochastic cellular automata model of cell migration, proliferation and differentiation: validation with in vitro cultures of muscle satellite cells.

    Science.gov (United States)

    Garijo, N; Manzano, R; Osta, R; Perez, M A

    2012-12-07

    Cell migration and proliferation has been modelled in the literature as a process similar to diffusion. However, using diffusion models to simulate the proliferation and migration of cells tends to create a homogeneous distribution in the cell density that does not correlate to empirical observations. In fact, the mechanism of cell dispersal is not diffusion. Cells disperse by crawling or proliferation, or are transported in a moving fluid. The use of cellular automata, particle models or cell-based models can overcome this limitation. This paper presents a stochastic cellular automata model to simulate the proliferation, migration and differentiation of cells. These processes are considered as completely stochastic as well as discrete. The model developed was applied to predict the behaviour of in vitro cell cultures performed with adult muscle satellite cells. Moreover, non homogeneous distribution of cells has been observed inside the culture well and, using the above mentioned stochastic cellular automata model, we have been able to predict this heterogeneous cell distribution and compute accurate quantitative results. Differentiation was also incorporated into the computational simulation. The results predicted the myotube formation that typically occurs with adult muscle satellite cells. In conclusion, we have shown how a stochastic cellular automata model can be implemented and is capable of reproducing the in vitro behaviour of adult muscle satellite cells. Copyright © 2012 Elsevier Ltd. All rights reserved.

  5. Finite Action-Set Learning Automata for Economic Dispatch Considering Electric Vehicles and Renewable Energy Sources

    Directory of Open Access Journals (Sweden)

    Junpeng Zhu

    2014-07-01

    Full Text Available The coming interaction between a growing electrified vehicle fleet and the desired growth in renewable energy provides new insights into the economic dispatch (ED problem. This paper presents an economic dispatch model that considers electric vehicle charging, battery exchange stations, and wind farms. This ED model is a high-dimensional, non-linear, and stochastic problem and its solution requires powerful methods. A new finite action-set learning automata (FALA-based approach that has the ability to adapt to a stochastic environment is proposed. The feasibility of the proposed approach is demonstrated in a modified IEEE 30 bus system. It is compared with continuous action-set learning automata and particle swarm optimization-based approaches in terms of convergence characteristics, computational efficiency, and solution quality. Simulation results show that the proposed FALA-based approach was indeed capable of more efficiently obtaining the approximately optimal solution. In addition, by using an optimal dispatch schedule for the interaction between electric vehicle stations and power systems, it is possible to reduce the gap between demand and power generation at different times of the day.

  6. An improved multi-value cellular automata model for heterogeneous bicycle traffic flow

    Energy Technology Data Exchange (ETDEWEB)

    Jin, Sheng [College of Civil Engineering and Architecture, Zhejiang University, Hangzhou, 310058 China (China); Qu, Xiaobo [Griffith School of Engineering, Griffith University, Gold Coast, 4222 Australia (Australia); Xu, Cheng [Department of Transportation Management Engineering, Zhejiang Police College, Hangzhou, 310053 China (China); College of Transportation, Jilin University, Changchun, 130022 China (China); Ma, Dongfang, E-mail: mdf2004@zju.edu.cn [Ocean College, Zhejiang University, Hangzhou, 310058 China (China); Wang, Dianhai [College of Civil Engineering and Architecture, Zhejiang University, Hangzhou, 310058 China (China)

    2015-10-16

    This letter develops an improved multi-value cellular automata model for heterogeneous bicycle traffic flow taking the higher maximum speed of electric bicycles into consideration. The update rules of both regular and electric bicycles are improved, with maximum speeds of two and three cells per second respectively. Numerical simulation results for deterministic and stochastic cases are obtained. The fundamental diagrams and multiple states effects under different model parameters are analyzed and discussed. Field observations were made to calibrate the slowdown probabilities. The results imply that the improved extended Burgers cellular automata (IEBCA) model is more consistent with the field observations than previous models and greatly enhances the realism of the bicycle traffic model. - Highlights: • We proposed an improved multi-value CA model with higher maximum speed. • Update rules are introduced for heterogeneous bicycle traffic with maximum speed 2 and 3 cells/s. • Simulation results of the proposed model are consistent with field bicycle data. • Slowdown probabilities of both regular and electric bicycles are calibrated.

  7. Image Encryption Scheme Based on Balanced Two-Dimensional Cellular Automata

    Directory of Open Access Journals (Sweden)

    Xiaoyan Zhang

    2013-01-01

    Full Text Available Cellular automata (CA are simple models of computation which exhibit fascinatingly complex behavior. Due to the universality of CA model, it has been widely applied in traditional cryptography and image processing. The aim of this paper is to present a new image encryption scheme based on balanced two-dimensional cellular automata. In this scheme, a random image with the same size of the plain image to be encrypted is first generated by a pseudo-random number generator with a seed. Then, the random image is evoluted alternately with two balanced two-dimensional CA rules. At last, the cipher image is obtained by operating bitwise XOR on the final evolution image and the plain image. This proposed scheme possesses some advantages such as very large key space, high randomness, complex cryptographic structure, and pretty fast encryption/decryption speed. Simulation results obtained from some classical images at the USC-SIPI database demonstrate the strong performance of the proposed image encryption scheme.

  8. Emergent dynamic structures and statistical law in spherical lattice gas automata

    Science.gov (United States)

    Yao, Zhenwei

    2017-12-01

    Various lattice gas automata have been proposed in the past decades to simulate physics and address a host of problems on collective dynamics arising in diverse fields. In this work, we employ the lattice gas model defined on the sphere to investigate the curvature-driven dynamic structures and analyze the statistical behaviors in equilibrium. Under the simple propagation and collision rules, we show that the uniform collective movement of the particles on the sphere is geometrically frustrated, leading to several nonequilibrium dynamic structures not found in the planar lattice, such as the emergent bubble and vortex structures. With the accumulation of the collision effect, the system ultimately reaches equilibrium in the sense that the distribution of the coarse-grained speed approaches the two-dimensional Maxwell-Boltzmann distribution despite the population fluctuations in the coarse-grained cells. The emergent regularity in the statistical behavior of the system is rationalized by mapping our system to a generalized random walk model. This work demonstrates the capability of the spherical lattice gas automaton in revealing the lattice-guided dynamic structures and simulating the equilibrium physics. It suggests the promising possibility of using lattice gas automata defined on various curved surfaces to explore geometrically driven nonequilibrium physics.

  9. An energy and cost efficient majority-based RAM cell in quantum-dot cellular automata

    Science.gov (United States)

    Khosroshahy, Milad Bagherian; Moaiyeri, Mohammad Hossein; Navi, Keivan; Bagherzadeh, Nader

    Nanotechnologies, notably quantum-dot cellular automata, have achieved major attentions for their prominent features as compared to the conventional CMOS circuitry. Quantum-dot cellular automata, particularly owning to its considerable reduction in size, high switching speed and ultra-low energy consumption, is considered as a potential alternative for the CMOS technology. As the memory unit is one of the most essential components in a digital system, designing a well-optimized QCA random access memory (RAM) cell is an important area of research. In this paper, a new five-input majority gate is presented which is suitable for implementing efficient single-layer QCA circuits. In addition, a new RAM cell with set and reset capabilities is designed based on the proposed majority gate, which has an efficient and low-energy structure. The functionality, performance and energy consumption of the proposed designs are evaluated based on the QCADesigner and QCAPro tools. According to the simulation results, the proposed RAM design leads to on average 38% lower total energy dissipation, 25% smaller area, 20% lower cell count, 28% lower delay and 60% lower QCA cost as compared to its previous counterparts.

  10. Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks

    Science.gov (United States)

    Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

    2016-11-01

    Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability.

  11. Cellular automata model for traffic flow at intersections in internet of vehicles

    Science.gov (United States)

    Zhao, Han-Tao; Liu, Xin-Ru; Chen, Xiao-Xu; Lu, Jian-Cheng

    2018-03-01

    Considering the effect of the front vehicle's speed, the influence of the brake light and the conflict of the traffic flow, we established a cellular automata model called CE-NS for traffic flow at the intersection in the non-vehicle networking environment. According to the information interaction of Internet of Vehicles (IoV), introducing parameters describing the congestion and the accurate speed of the front vehicle into the CE-NS model, we improved the rules of acceleration, deceleration and conflict, and finally established a cellular automata model for traffic flow at intersections of IoV. The relationship between traffic parameters such as vehicle speed, flow and average travel time is obtained by numerical simulation of two models. Based on this, we compared the traffic situation of the non-vehicle networking environment with conditions of IoV environment, and analyzed the influence of the different degree of IoV on the traffic flow. The results show that the traffic speed is increased, the travel time is reduced, the flux of intersections is increased and the traffic flow is more smoothly under IoV environment. After the vehicle which achieves IoV reaches a certain proportion, the operation effect of the traffic flow begins to improve obviously.

  12. Decentralized Cooperation Strategies in Two-Dimensional Traffic of Cellular Automata

    International Nuclear Information System (INIS)

    Fang Jun; Qin Zheng; Xu Zhaohui; Chen Xiqun; Leng Biao; Jiang Zineng

    2012-01-01

    We study the two-dimensional traffic of cellular automata using computer simulation. We propose two type of decentralized cooperation strategies, which are called stepping aside (CS-SA) and choosing alternative routes (CS-CAR) respectively. We introduce them into an existing two-dimensional cellular automata (CA) model. CS-SA is designed to prohibit a kind of ping-pong jump when two objects standing together try to move in opposite directions. CS-CAR is designed to change the solution of conflict in parallel update. CS-CAR encourages the objects involved in parallel conflicts choose their alternative routes instead of waiting. We also combine the two cooperation strategies (CS-SA-CAR) to test their combined effects. It is found that the system keeps on a partial jam phase with nonzero velocity and flow until the density reaches one. The ratios of the ping-pong jump and the waiting objects involved in conflict are decreased obviously, especially at the free phase. And the average flow is improved by the three cooperation strategies. Although the average travel time is lengthened a bit by CS-CAR, it is shorten by CS-SA and CS-SA-CAR. In addition, we discuss the advantage and applicability of decentralized cooperation modeling.

  13. Subgrouping Automata: automatic sequence subgrouping using phylogenetic tree-based optimum subgrouping algorithm.

    Science.gov (United States)

    Seo, Joo-Hyun; Park, Jihyang; Kim, Eun-Mi; Kim, Juhan; Joo, Keehyoung; Lee, Jooyoung; Kim, Byung-Gee

    2014-02-01

    Sequence subgrouping for a given sequence set can enable various informative tasks such as the functional discrimination of sequence subsets and the functional inference of unknown sequences. Because an identity threshold for sequence subgrouping may vary according to the given sequence set, it is highly desirable to construct a robust subgrouping algorithm which automatically identifies an optimal identity threshold and generates subgroups for a given sequence set. To meet this end, an automatic sequence subgrouping method, named 'Subgrouping Automata' was constructed. Firstly, tree analysis module analyzes the structure of tree and calculates the all possible subgroups in each node. Sequence similarity analysis module calculates average sequence similarity for all subgroups in each node. Representative sequence generation module finds a representative sequence using profile analysis and self-scoring for each subgroup. For all nodes, average sequence similarities are calculated and 'Subgrouping Automata' searches a node showing statistically maximum sequence similarity increase using Student's t-value. A node showing the maximum t-value, which gives the most significant differences in average sequence similarity between two adjacent nodes, is determined as an optimum subgrouping node in the phylogenetic tree. Further analysis showed that the optimum subgrouping node from SA prevents under-subgrouping and over-subgrouping. Copyright © 2013. Published by Elsevier Ltd.

  14. Dynamic and quantitative method of analyzing service consistency evolution based on extended hierarchical finite state automata.

    Science.gov (United States)

    Fan, Linjun; Tang, Jun; Ling, Yunxiang; Li, Benxian

    2014-01-01

    This paper is concerned with the dynamic evolution analysis and quantitative measurement of primary factors that cause service inconsistency in service-oriented distributed simulation applications (SODSA). Traditional methods are mostly qualitative and empirical, and they do not consider the dynamic disturbances among factors in service's evolution behaviors such as producing, publishing, calling, and maintenance. Moreover, SODSA are rapidly evolving in terms of large-scale, reusable, compositional, pervasive, and flexible features, which presents difficulties in the usage of traditional analysis methods. To resolve these problems, a novel dynamic evolution model extended hierarchical service-finite state automata (EHS-FSA) is constructed based on finite state automata (FSA), which formally depict overall changing processes of service consistency states. And also the service consistency evolution algorithms (SCEAs) based on EHS-FSA are developed to quantitatively assess these impact factors. Experimental results show that the bad reusability (17.93% on average) is the biggest influential factor, the noncomposition of atomic services (13.12%) is the second biggest one, and the service version's confusion (1.2%) is the smallest one. Compared with previous qualitative analysis, SCEAs present good effectiveness and feasibility. This research can guide the engineers of service consistency technologies toward obtaining a higher level of consistency in SODSA.

  15. PAM: Particle automata model in simulation of Fusarium graminearum pathogen expansion.

    Science.gov (United States)

    Wcisło, Rafał; Miller, S Shea; Dzwinel, Witold

    2016-01-21

    The multi-scale nature and inherent complexity of biological systems are a great challenge for computer modeling and classical modeling paradigms. We present a novel particle automata modeling metaphor in the context of developing a 3D model of Fusarium graminearum infection in wheat. The system consisting of the host plant and Fusarium pathogen cells can be represented by an ensemble of discrete particles defined by a set of attributes. The cells-particles can interact with each other mimicking mechanical resistance of the cell walls and cell coalescence. The particles can move, while some of their attributes can be changed according to prescribed rules. The rules can represent cellular scales of a complex system, while the integrated particle automata model (PAM) simulates its overall multi-scale behavior. We show that due to the ability of mimicking mechanical interactions of Fusarium tip cells with the host tissue, the model is able to simulate realistic penetration properties of the colonization process reproducing both vertical and lateral Fusarium invasion scenarios. The comparison of simulation results with micrographs from laboratory experiments shows encouraging qualitative agreement between the two. Copyright © 2015 Elsevier Ltd. All rights reserved.

  16. An improved multi-value cellular automata model for heterogeneous bicycle traffic flow

    International Nuclear Information System (INIS)

    Jin, Sheng; Qu, Xiaobo; Xu, Cheng; Ma, Dongfang; Wang, Dianhai

    2015-01-01

    This letter develops an improved multi-value cellular automata model for heterogeneous bicycle traffic flow taking the higher maximum speed of electric bicycles into consideration. The update rules of both regular and electric bicycles are improved, with maximum speeds of two and three cells per second respectively. Numerical simulation results for deterministic and stochastic cases are obtained. The fundamental diagrams and multiple states effects under different model parameters are analyzed and discussed. Field observations were made to calibrate the slowdown probabilities. The results imply that the improved extended Burgers cellular automata (IEBCA) model is more consistent with the field observations than previous models and greatly enhances the realism of the bicycle traffic model. - Highlights: • We proposed an improved multi-value CA model with higher maximum speed. • Update rules are introduced for heterogeneous bicycle traffic with maximum speed 2 and 3 cells/s. • Simulation results of the proposed model are consistent with field bicycle data. • Slowdown probabilities of both regular and electric bicycles are calibrated

  17. Exact quantification of the complexity of spacewise pattern growth in cellular automata

    International Nuclear Information System (INIS)

    Freire, Joana G; Gallas, Jason A C; Brison, Owen J

    2009-01-01

    We analyze the two possible ways of simulating complex systems with cellular automata: by using the familiar timewise updating or by using the complementary spacewise updating. Both updating algorithms operate on identical sets of initial conditions defining the state of the automaton. While timewise growth generally probes just vanishingly small sets of initial conditions producing statistical samples of the asymptotic attractors, spacewise growth operates with much restricted sets which allow one to simulate them all, exhaustively. Our main result is the derivation of an exact analytical formula to quantify precisely one of the two sources of algorithmic complexity of spacewise detection of the complete set of attractors for elementary 1D cellular automata with generic non-periodic architectures of any arbitrary size. The formula gives the total number of initial conditions that need to be investigated to locate rigorously all possible patterns for any given rule. As simple applications, we illustrate how this knowledge may be used (i) to uncover missing patterns in previous classifications in the literature and (ii) to obtain surprisingly novel patterns that are totally unreachable with the time-honored technique of artificially imposing spatially periodic boundary conditions.

  18. Solution of Dendritic Growth in Steel by the Novel Point Automata Method

    International Nuclear Information System (INIS)

    Lorbiecka, A Z; Šarler, B

    2012-01-01

    The aim of this paper is the simulation of dendritic growth in steel in two dimensions by a coupled deterministic continuum mechanics heat and species transfer model and a stochastic localized phase change kinetics model taking into account the undercooling, curvature, kinetic, and thermodynamic anisotropy. The stochastic model receives temperature and concentration information from the deterministic model and the deterministic heat, and species diffusion equations receive the solid fraction information from the stochastic model. The heat and species transfer models are solved on a regular grid by the standard explicit Finite Difference Method (FDM). The phase-change kinetics model is solved by a novel Point Automata (PA) approach. The PA method was developed [1] in order to circumvent the mesh anisotropy problem, associated with the classical Cellular Automata (CA) method. The PA approach is established on randomly distributed points and neighbourhood configuration, similar as appears in meshless methods. A comparison of the PA and CA methods is shown. It is demonstrated that the results with the new PA method are not sensitive to the crystallographic orientations of the dendrite.

  19. Emergent dynamic structures and statistical law in spherical lattice gas automata.

    Science.gov (United States)

    Yao, Zhenwei

    2017-12-01

    Various lattice gas automata have been proposed in the past decades to simulate physics and address a host of problems on collective dynamics arising in diverse fields. In this work, we employ the lattice gas model defined on the sphere to investigate the curvature-driven dynamic structures and analyze the statistical behaviors in equilibrium. Under the simple propagation and collision rules, we show that the uniform collective movement of the particles on the sphere is geometrically frustrated, leading to several nonequilibrium dynamic structures not found in the planar lattice, such as the emergent bubble and vortex structures. With the accumulation of the collision effect, the system ultimately reaches equilibrium in the sense that the distribution of the coarse-grained speed approaches the two-dimensional Maxwell-Boltzmann distribution despite the population fluctuations in the coarse-grained cells. The emergent regularity in the statistical behavior of the system is rationalized by mapping our system to a generalized random walk model. This work demonstrates the capability of the spherical lattice gas automaton in revealing the lattice-guided dynamic structures and simulating the equilibrium physics. It suggests the promising possibility of using lattice gas automata defined on various curved surfaces to explore geometrically driven nonequilibrium physics.

  20. Dengue fever spreading based on probabilistic cellular automata with two lattices

    Science.gov (United States)

    Pereira, F. M. M.; Schimit, P. H. T.

    2018-06-01

    Modeling and simulation of mosquito-borne diseases have gained attention due to a growing incidence in tropical countries in the past few years. Here, we study the dengue spreading in a population modeled by cellular automata, where there are two lattices to model the human-mosquitointeraction: one lattice for human individuals, and one lattice for mosquitoes in order to enable different dynamics in populations. The disease considered is the dengue fever with one, two or three different serotypes coexisting in population. Although many regions exhibit the incidence of only one serotype, here we set a complete framework to also study the occurrence of two and three serotypes at the same time in a population. Furthermore, the flexibility of the model allows its use to other mosquito-borne diseases, like chikungunya, yellow fever and malaria. An approximation of the cellular automata is proposed in terms of ordinary differential equations; the spreading of mosquitoes is studied and the influence of some model parameters are analyzed with numerical simulations. Finally, a method to combat dengue spreading is simulated based on a reduction of mosquito birth and mosquito bites in population.