Conferences related to Automata

Back to Top

2013 IEEE Symposium on Industrial Electronics & Applications (ISIEA)

The symposium covers the areas of industrial electronics and industrial applications in general, that include areas of electronics engineering and its applications, computer engineering and applications, processing, mechatronics, instrumentation, measurement, and their applications in the humanities & commercial

  • 2012 IEEE Symposium on Industrial Electronics and Applications (ISIEA 2012)

    This annual symposium is to bring together scientists, engineers and postgraduates who work in these fields; to share their ideas and experience. Papers are solicited on recent research results, new developments and technology trends in the field of power electronics, industrial electronics, industrial applications, life-science applications, computer & network applications, measurement systems, business applications and ocean applications related technology.

  • 2011 IEEE Symposium on Industrial Electronics and Applications (ISIEA 2011)

    This annual symposium is to bring together scientists, engineers and postgraduates who work in these fields; to share their ideas and experience. Papers are solicited on recent research results, new developments and technology trends in the field of power electronics, industrial electronics, industrial applications, life-science applications, computer & network applications, measurement systems, business applications and ocean applications related technology.

  • 2010 IEEE Symposium on Industrial Electronics and Applications (ISIEA 2010)

    This annual symposium is to bring together scientists, engineers and postgraduates who work in these fields; to share their ideas and experience. Papers are solicited on recent research results, new developments and technology trends in the field of power electronics, industrial electronics, industrial applications, life-science applications, computer & network applications, measurement systems, business applications and ocean applications related technology.

  • 2009 IEEE Symposium on Industrial Electronics and Applications (ISIEA 2009)

    This annual symposium is to bring together scientists, engineers and postgraduates who work in these fields to share their ideas and experience. Papers are solicited on recent research results, new developments and technology trends in the field of power electronics, industrial electronics, industrial applications, life-science applications and measurement systems.


2012 11th International Workshop on Discrete Event Systems - WODES

Discrete event systems theory and applications.

  • 2008 9th International Workshop on Discrete Event Systems - WODES

    The workshop will provide researchers from different fields (control theoreticians and control engineers, software engineers and computer scientists, operations research specialists) with an opportunity to exchange information and new ideas, and to discuss new developments in the field of Discrete Event Systems theory and application.


2012 27th Annual IEEE Symposium on Logic in Computer Science (LICS 2012)

The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic in a broad sense.


2008 9th International Conference for Young Computer Scientists (ICYCS)

Following the tradition and success of previous ICYCS conferences, ICYCS 2008 will provide an international forum for scientists and engineers in academia and industry to exchange and discuss their experiences, new ideas, research results, and applications on all aspects of Computer Science and Technology and its related disciplines. It will feature keynote speeches, technical presentations, panel discussions and symposiums/workshops .



Periodicals related to Automata

Back to Top

Evolutionary Computation, IEEE Transactions on

Papers on application, design, and theory of evolutionary computation, with emphasis given to engineering systems and scientific applications. Evolutionary optimization, machine learning, intelligent systems design, image processing and machine vision, pattern recognition, evolutionary neurocomputing, evolutionary fuzzy systems, applications in biomedicine and biochemistry, robotics and control, mathematical modelling, civil, chemical, aeronautical, and industrial engineering applications.


Software Engineering, IEEE Transactions on

Specification, development, management, test, maintenance, and documentation of computer software.


Systems, Man, and Cybernetics, Part B, IEEE Transactions on

The scope of the IEEE Transactions on Systems, Man and Cybernetics Part B: Cybernetics includes computational approaches to the field of cybernetics. Specifically, the transactions welcomes papers on communication and control across machines or between machines, humans, and organizations. The scope of Part B includes such areas as computational intelligence, computer vision, neural networks, genetic algorithms, machine learning, fuzzy systems, ...




Xplore Articles related to Automata

Back to Top

Formal analysis of a ZigBee-based routing protocol for smart grids using UPPAAL

Adnan Rashid; Osman Hasan; Kashif Saghar 2015 12th International Conference on High-capacity Optical Networks and Enabling/Emerging Technologies (HONET), 2015

Smart grid is an emerging technology which integrates the modern communication network to the traditional power grids. The performance and efficiency of the smart grid mainly depends on reliable communication between its different components and in turn on the routing protocols that establish this communication network. ZigBee protocol is a widely used routing protocol in the home area networks of ...


Heat Dissipation in Nanocomputing: Lower Bounds From Physical Information Theory

İlke Ercan; Neal G. Anderson IEEE Transactions on Nanotechnology, 2013

Computing circuits that irreversibly discard information unavoidably dissipate heat. Dissipative costs resulting from information loss, while insignificant in CMOS technology, may be dominant or even prohibitive in some dense, high- speed post-CMOS nanocomputing circuits that employ logically irreversible operations. In transistor-based paradigms, dissipation costs associated with logical irreversibility may be supplemented by additional unavoidable costs associated with particle supply required ...


On supervisor localization based distributed control of discrete-event systems under partial observation

Renyuan Zhang; Kai Cai 2016 American Control Conference (ACC), 2016

Recently we developed supervisor localization, a top-down approach to distributed control of discrete-event systems. Its essence is the allocation of monolithic (global) control action among the local control strategies of individual agents. In this paper, we extend supervisor localization by considering partial observation; namely not all events are observable. Specifically, we employ the recently proposed concept of relative observability to ...


A Polynomial Algorithm for Minimizing Communication in a Distributed Discrete Event System with a Central Station

Weilin Wang; Stephane Lafortune; Feng Lin Proceedings of the 45th IEEE Conference on Decision and Control, 2006

The problem of minimizing communication in distributed systems is considered in a discrete-event formalism where the system is modeled as a finite-state automaton. There are a central station and a set of N communicating local agents observing the behavior of the system. The central station needs to know exactly the state of the system, whereas local agents need to disambiguate ...


In time alone: on the computational power of querying the history

A. Lisitsa; I. Potapov Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06), 2006

Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic data interchange. In this paper we study the computational power of referring to the past primitive. To do that we propose a refined formal model, history dependent machine (RDM), which uses querying the history as its ...


More Xplore Articles

Educational Resources on Automata

Back to Top

eLearning

Formal analysis of a ZigBee-based routing protocol for smart grids using UPPAAL

Adnan Rashid; Osman Hasan; Kashif Saghar 2015 12th International Conference on High-capacity Optical Networks and Enabling/Emerging Technologies (HONET), 2015

Smart grid is an emerging technology which integrates the modern communication network to the traditional power grids. The performance and efficiency of the smart grid mainly depends on reliable communication between its different components and in turn on the routing protocols that establish this communication network. ZigBee protocol is a widely used routing protocol in the home area networks of ...


Heat Dissipation in Nanocomputing: Lower Bounds From Physical Information Theory

İlke Ercan; Neal G. Anderson IEEE Transactions on Nanotechnology, 2013

Computing circuits that irreversibly discard information unavoidably dissipate heat. Dissipative costs resulting from information loss, while insignificant in CMOS technology, may be dominant or even prohibitive in some dense, high- speed post-CMOS nanocomputing circuits that employ logically irreversible operations. In transistor-based paradigms, dissipation costs associated with logical irreversibility may be supplemented by additional unavoidable costs associated with particle supply required ...


On supervisor localization based distributed control of discrete-event systems under partial observation

Renyuan Zhang; Kai Cai 2016 American Control Conference (ACC), 2016

Recently we developed supervisor localization, a top-down approach to distributed control of discrete-event systems. Its essence is the allocation of monolithic (global) control action among the local control strategies of individual agents. In this paper, we extend supervisor localization by considering partial observation; namely not all events are observable. Specifically, we employ the recently proposed concept of relative observability to ...


A Polynomial Algorithm for Minimizing Communication in a Distributed Discrete Event System with a Central Station

Weilin Wang; Stephane Lafortune; Feng Lin Proceedings of the 45th IEEE Conference on Decision and Control, 2006

The problem of minimizing communication in distributed systems is considered in a discrete-event formalism where the system is modeled as a finite-state automaton. There are a central station and a set of N communicating local agents observing the behavior of the system. The central station needs to know exactly the state of the system, whereas local agents need to disambiguate ...


In time alone: on the computational power of querying the history

A. Lisitsa; I. Potapov Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06), 2006

Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic data interchange. In this paper we study the computational power of referring to the past primitive. To do that we propose a refined formal model, history dependent machine (RDM), which uses querying the history as its ...


More eLearning Resources

IEEE-USA E-Books

  • Evolving Memory: Logical Tasks for Cellular Automata

    We present novel experiments in the evolution of Cellular Automata (CA) to solve nontrivial tasks. Using a genetic algorithm, we evolved CA rules that can solve non-trivial logical tasks related to the density task (or majority classification problem) commonly used in the literature. We present the particle catalogs of the new rules following the computational mechanics framework. We know from Crutchfield et al (2002) that particle computation in CA is a process of information processing and integration. Here, we discuss the type of memory that emerges from the evolving CA experiments for storing and manipulating information. In particular, we contrast this type of evolved memory with the type of memory we are familiar with in Computer Science, and also with the type of biological memory instantiated by DNA. A novel CA rule obtained from our own experiments is used to elucidate the type of memory that one-dimensional CA can attain.

  • Complex Genetic Evolution of Self-Replicating Loops

    lt is generally believed that self-replication models constructed on cellular automata have quite limited evolutionary dynamics in both diversity and adaptative behavior. Contrary to this view, we show that complex genetic diversification and adaptation processes may occur in self-replicating loop populations. Applying newly developed tools for detailed genetic identification and genealogy tracing to evoloop populations, we uncovered a genotypic permutation space that expands combinatorially with replicator size. Within this space populations demonstrate broad behavioral diversity and non- trivial genetic adaptation, maximizing colony density while enhancing sustainability against other species. We also found a set of non-mutable subsequences enabling genetic operations that alter fitness differentials and promote long-term evolutionary exploration. These results reveal the amazing potential of cellular automata to re-create complex genetic evolution of selfreplicators in a simple, deterministic framework.

  • Simulate

    This chapter contains sections titled: Motion, Particle systems, Springs, Cellular automata, Autonomous agents

  • Synthetic Harmonies: an approach to musical semiosis by means of cellular automata

    This paper deals with a software environment based on cellular automata devoted to musical experimentation, realised through a methodology by which, mathematical structures, produced by AL models, the general theory of signs, as proposed by Charles Peirce and music, which Consists of acoustic and perceptual relationships are connected. The main features of this environment are the following: 1. semiotics and musical language as tools for reading and interpreting mathematical configurations generated by cellular automata and other AL models; 2. musical expression as creative artefacts; 3. artificial universes as contexts in which to detect perceptual patterns and the correlated emotions music produces; 4. experimentations in aural perception in humans as a method for evolving musical artefacts. We can know the real world which is near us and the artificial world which is in the computer only by means of thought. Artificial worlds can be equivalent to the phenomenological world and both could be manipulated and organised by thought. We have to apply to artificial worlds the same method humans have developed in organising and giving meanings to the physical world. It'll be necessary to detect patterns generated by Artificial Life machines and to give them meanings. We are trying to apply this methodology through mathematics and music, combining them in a semiotic approach.

  • Redrawing the Boundary between Organism and Environment

    In this position paper, I argue that a fruitful, and as yet largely unexplored, avenue for artificial life research lies in modelling organisms (specifically, phenotypes) and environment as a single dynamical system. From this perspective, the origin and evolution of life is the progressive control of the dynamical system at a local level by constraints which are represented on an organism's genome. Such an approach shifts the focus of artificial life models away from the design of individuals, towards the interaction of an individual with its dynamic environment. It also blurs the boundary between organism and environment; the most important modelling distinction is no longer between an organism's body and its external environment, but rather between the genome (which is treated as an essentially symbolic structure) and phenotype-plus-environment combined. An evolutionary cellular automata system, called EvoCA, is introduced as a tool to explore these ideas. To demonstrate how this approach differs from traditional studies, two example applications of EvoCA are presented. One concerns sensor and effector evolution; the other concerns the origin of life, and in particular the evolution of genome- regulated self-stabilising dynamics. Advantages of the new approach are swmnarised, and sorne potential criticisms are considered. The paper concludes with a discussion of some implications of this shift in perspective.

  • Diffusion and equilibrium

    This chapter contains sections titled: Noise-driven diffusion, Expansion and thermalization, Self-diffusion, Mean free path, A tour de force, A tuneable noise source, Diffusion-limited aggregation

  • Fluid dynamics

    This chapter contains sections titled: Sound waves, Hydrodynamics, Tracing the flow, Flow past an obstacle, Other lattice gases, Autocorrelations, Wave optics

  • The Margolus neighborhood

    This chapter contains sections titled: Block rules, Particles in motion, Collisions, How to turn a block rule into a cell rule, The Margolus neighbors, Even/odd grid selection, phase-sensitive gas, Examples

  • Simple Stable Encodings of FiniteState Machines in Dynamic Recurrent Networks

    This chapter contains sections titled: Introduction Definitions Encoding Encoding of Mealy Machines in DRN Encoding of Moore Machines in DRN Encoding of Deterministic Finite-State Automata in DRN Conclusion Acknowledgments

  • DiscreteEvent Systems and Their Optimization

    Classical control technology has by and large focused on continuous-time systemsï¿¿-ï¿¿including their digitized and sampled equivalents. The unequivocal success in this arena has resulted in a broadening of interests and in explorations of the application of control concepts to other problems, even those that are not readily amenable to the techniques of traditional control. This chapter focuses on one such topic: discrete-event systems. Whereas control technology is mostly concerned with systems with internal dynamics that can be mediated by continuous-valued inputs, discrete-event systems (DES) exhibit dynamics that evolve in accordance with external eventsï¿¿-ï¿¿the state of the system changes only when an event occurs. Many problems in communication networks, manufacturing systems, transportation and traffic, and numerous other domains can be seen as DES applications. In the first case, for example, events of interest can be the arrival of packets of information at a node in the network. (Connections between DES and communication networks are further elaborated in Chapter 19.) Modeling approaches for DES include state machines and automata, Markov chains, and timed models using event clocks. Simple examples are shown for each, drawn from computer systems with on, off, and failed states and single- server queues. Some of these models are also discussed in Chapter 7 which deals with systems that combine discrete-event and continuous-time dynamics. This chapter also discusses the topic of optimization of DESs: how control parameters of a DES (for example, the mean service time for jobs in a queue) can be selected to optimize some performance measure. To use gradient-based optimization methods for discrete-event systems, gradient information must be estimated; since the systems and their representations are not continuous, gradients cannot be a nalytically calculated. Stochastic approximation algorithms are an effective option and can even allow DES optimization to be performed on-line, while the system is operating.



Standards related to Automata

Back to Top

No standards are currently tagged "Automata"


Jobs related to Automata

Back to Top