Conferences related to Automata

Back to Top

2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)

The conference is the primary forum for cross-industry and multidisciplinary research in automation. Its goal is to provide a broad coverage and dissemination of foundational research in automation among researchers, academics, and practitioners.


2018 14th International Workshop on Discrete Event Systems (WODES)

The interdisciplinary field of Discrete Event Systems (DES) combines different formalisms, methodologies and tools from control, computer science and operations research. The research activity in this field is driven by the needs of many different applications domains: manufacturing, process control, supervisory systems, software engineering, transportation, and so on. Discrete Event Systems is now a mature field and many interesting applications have been developed. This 14th International Workshop on Discrete Event Systems will be hosted at Hotel Stabiae Sorrento Coast, Sorrento Coast, Italy. It aims to 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 DES theory and applications.


2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)

ASP-DAC 2018 is the 23rd annual international conference on VLSI design automation in Asia and South Pacific regions, one of the most active regions of design and fabrication of silicon chips in the world. The conference aims at providing the Asian and South Pacific CAD/DA and Design community with opportunities of presenting recent advances and with forums for future directions in technologies related to Electronic Design Automation (EDA). The format of the meeting intends to cultivate and promote an instructive and productive interchange of ideas among EDA researchers/developers and system/circuit/device designers. All scientists, engineers, and students who are interested in theoretical and practical aspects of VLSI design and design automation are welcomed to ASP-DAC.


2018 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification.

  • 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

    Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification.

  • 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

    The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include:automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantic

  • 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

    Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, theory of automatic structures, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security, rewriting, type systems and type theory, and verification.

  • 2014 29th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS)

    Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, theory of automatic structures, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security, rewriting, type systems and type theory, and verification.

  • 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013)

    The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed.

  • 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.

  • 2011 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011)

    LICS is an annual international forum on topics that lie at the intersection of computer science and mathematical logic.

  • 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010)

    LICS is an annual international forum on topics that lie at the intersection of computer science and mathematical logic.

  • 2009 24th Annual IEEE Symposium on Logic in Computer Science (LICS 2009)

    LICS is an annual international forum on topics that lie at the intersection of computer science and mathematical logic.

  • 2008 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008)

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

  • 2007 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

  • 2006 21st Annual IEEE Symposium on Logic in Computer Science (LICS 2006)

  • 2005 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005)


2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

The conference program will consist of plenary lectures, symposia, workshops and invitedsessions of the latest significant findings and developments in all the major fields of biomedical engineering.Submitted papers will be peer reviewed. Accepted high quality papers will be presented in oral and postersessions, will appear in the Conference Proceedings and will be indexed in PubMed/MEDLINE


More Conferences

Periodicals related to Automata

Back to Top

Automatic Control, IEEE Transactions on

The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...


Automation Science and Engineering, IEEE Transactions on

The IEEE Transactions on Automation Sciences and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. We welcome results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, ...


Circuits and Systems I: Regular Papers, IEEE Transactions on

Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.


Circuits and Systems II: Express Briefs, IEEE Transactions on

Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.


Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


More Periodicals

Most published Xplore authors for Automata

Back to Top

Xplore Articles related to Automata

Back to Top

Model Checking Coordination of CPS Using Timed Automata

[{u'author_order': 1, u'full_name': u'Kaiqiang Jiang'}, {u'author_order': 2, u'full_name': u'Chunlin Guan'}, {u'author_order': 3, u'full_name': u'Jiahui Wang'}, {u'author_order': 4, u'full_name': u'Dehui Du'}] 2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC), None

The growing complexity of Cyber-Physical Systems (CPS) increasingly challenges the existing methods and techniques. The correctness of coordination between heterogeneous components of CPS is still a challenging problem. The coordination of CPS could be implemented with co-simulation technology, which uses Functional Mock-up Interface (FMI) techniques to generate simulations of heterogeneous components in CPS. However, the master algorithm for co- simulation ...


Particle automata model of renal cancer progression

[{u'author_order': 1, u'affiliation': u'Department of Computer Science, AGH University of Science and Technology, Kraków, Poland', u'full_name': u'M. Panuszewska'}, {u'author_order': 2, u'affiliation': u'Department of Computer Science, AGH University of Science and Technology, Kraków, Poland', u'full_name': u'B. Minch'}, {u'author_order': 3, u'affiliation': u'Department of Computer Science, AGH University of Science and Technology, Kraków, Poland', u'full_name': u'W. Dzwinel'}] 2018 International Interdisciplinary PhD Workshop (IIPhDW), None

Even though the cancer mortality rate is slowly decreasing, it is still one of the leading causes of morbidity and mortality worldwide. One of the most common types of this disease is renal cancer, occurring in kidneys. A total of 63,340 new renal cancer cases (42,680 in men and 22,660 in women) and 14,970 deaths from renal cancer (10,010 men ...


Applying GIS and multilayered interactive cellular automata to high-speed train control system modeling

[{u'author_order': 1, u'affiliation': u'National Research Center of Railway Safety Assessment, Beijing Jiaotong University, Beijing, China', u'full_name': u'Dalin Zhang'}, {u'author_order': 2, u'affiliation': u'School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA', u'full_name': u'Xiaokang Qiu'}] 2018 7th International Conference on Computers Communications and Control (ICCCC), None

China high-speed train control system is a safety-critical system which consists of computer, communication and control. Efficient high-speed train control system modeling, verification and testing remains the current challenge for both academia and industry. This paper presents a visual modeling method based on GIS and the multilayered interactive cellular automata. GIS is responsible for displaying the operational scenarios of train ...


Quality controlled image compressor using tiny block size encoding cellular automata

[{u'author_order': 1, u'affiliation': u'S.V University Tirupati, India', u'full_name': u'Trupti Ahir'}, {u'author_order': 2, u'affiliation': u'S.V University Tirupati, India', u'full_name': u'R V S Satyanrayana'}] 2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS), None

To overcome the problem of storage the researchers proposed multiple compression techniques which were helpful in storing the data efficiently. There were two types of compression proposed one if the lossy which was helping a lot in saving the memory whereas the lossless was slow and was not as efficient on storage. Therefore the quality of the compression came into ...


HyMn: Mining linear hybrid automata from input output traces of cyber-physical systems

[{u'author_order': 1, u'affiliation': u'iMPACT lab CISDE, Arizona State University, Tempe, AZ', u'full_name': u'Imane Lamrani'}, {u'author_order': 2, u'affiliation': u'iMPACT lab CISDE, Arizona State University, Tempe, AZ', u'full_name': u'Ayan Banerjee'}, {u'author_order': 3, u'affiliation': u'iMPACT lab CISDE, Arizona State University, Tempe, AZ', u'full_name': u'Sandeep K. S. Gupta'}] 2018 IEEE Industrial Cyber-Physical Systems (ICPS), None

Hybrid systems are versatile in modeling the interaction between the cyber and physical components of cyber-physical control systems (CPS) such as artificial pancreas (AP). They are typically used for analysis of safety of the human centric control systems which have serious consequences of failure. As such hybrid systems are parameterized and the variables often depend on the subject on which ...


More Xplore Articles

Educational Resources on Automata

Back to Top

eLearning

No eLearning Articles are currently tagged "Automata"

IEEE-USA E-Books

  • Application of Cellular Automata Algorithms to the Parallel Simulation of Laser Dynamics

    This chapter contains sections titled: Introduction Background Laser Dynamics Problem Algorithmic Proposal Experimental Analysis Parallel Implementation of the Algorithm Conclusions References

  • Finite Automata

    This chapter contains sections titled: Introduction, Finite Automata, Our First Machine, Alphabets and Languages, Finite Automata and Answering Questions, Omitting Traps from Diagrams, Some Basic Facts, Regular Expressions, Limitations of Finite Automata, Tapes and Configurations, Connection to the Correspondence Problem

  • The Theory of Timed I/O Automata, Second Edition

    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 requirements, which make it important to have methods for systematic design of systems and rigorous analysis of timing-dependent behavior. The TIOA framework also supports description and analysis of timed distributed algorithms -- distributed algorithms whose correctness and performance depend on the relative speeds of processors, accuracy of local clocks, or communication delay bounds. Such algori hms arise, for example, in traditional and wireless communications, networks of mobile devices, and shared-memory multiprocessors. The need to prove rigorous theoretical results about timed distributed algorithms makes it important to have a suitable mathematical foundation. An important feature of the TIOA framework is its support for decomposing timed system descriptions. In particular, the framework includes a notion of external behavior for a timed I/O automaton, which captures its discrete interactions with its environment. The framework also defines what it means for one TIOA to implement another, based on an inclusion relationship between their external behavior sets, and defines notions of simulations, which provide sufficient conditions for demonstrating implementation relationships. The framework includes a composition operation for TIOAs, which respects external behavior, and a notion of receptiveness, which implies that a TIOA does not block the passage of time. The TIOA f amework also defines the notion of a property and what it means for a property to be a safety or a liveness property. It includes results that capture common proof methods for showing that automata satisfy properties. Table of Contents: Introduction / Mathematical Preliminaries / Describing Timed System Behavior / Timed Automata / Operations on Timed Automata / Properties for Timed Automata / Timed I/O Automata / Operations on Timed I/O Automata / Conclusions and Future Work

  • The Theory of Timed I/O Automata

    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 requirements, which makes it important to have methods for systematic design of systems and rigorous analysis of timing-dependent behavior. An important feature of the TIOA framework is its support for decomposing timed system descriptions. In particular, the framework includes a notion of external behavior for a TIOA, which captures its discrete interactions with its environment. The framework also defines what it means for one TIOA to implement another, based on an inclusion relationship between their external behavior sets, and defines notions of simulations, which provide sufficient conditions for demonstrating implementation relationships. The framework includes a composition operation for TIOAs, which respects external behavior, and a notion of receptiveness, which implies that a TIOA does not block the passage of time.

  • Finite Automata

    This chapter contains sections titled: * Introduction * Deterministic Finite Automata * Converting a DFA to a Regular Expression * Java Code for a DFA * Nondeterministic Finite Automata * Using an NFA as an Algorithm * Converting an NFA to a DFA with the Subset Algorithm * Converting a DFA to a Regular Grammar * Converting a Regular Grammar to an NFA * Converting a Regular Expression to an NFA * Finding the Minimal DFA * Pumping Property of Regular Languages * Problems

  • Practical Aspects of Active Automata Learning

    This chapter contains sections titled: * Introduction * Regular Extrapolation * Challenges in Regular Extrapolation * Interacting with Real Systems * Membership Queries * Reset * Parameters and Value Domains * The NGLL * Conclusion and Perspectives * References

  • 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.

  • Modeling Multicellular and Tumorous Existence with Genetic Cellular Automata

    We model a population of cells using cellular automata with genetically-based rules. As in actual multicellular systems, each cell's state is based on environment and genetics. With imperfect reproduction and the accumulation of random mutations, tumorous behavior naturally emerges in a stochastic manner. We validate our model by reproducing results used to confirm other published models. We also demonstrate that our model exhibits both homeostatic and tumorous behavior using metrics based on clinical biopsy diagnosic techniques.

  • Evolving Insect Locomotion using Non-uniform Cellular Automata

    This article presents a model for the evolution of locomotion behavior in a simulated insect. In our model, locomotion is defined over a discrete state space using non-uniform cellular automata. The architecture of the model is inspired from the distributed model for leg coordination proposed by Cruse. We apply a genetic algorithm to a population of non-uniform cellular automata to evolve locomotion behaviors. We demostrate that this model can be used to evolve several commonly observed gaits of insects. Additionally, we show that the evolutionary process yielded periodic attractors which are invariant from the initial conditions

  • Celullar Automata

    This chapter contains sections titled: Von Neumann's Automaton, The Turing Machine, The Logic of Biological Systems, The Kinematic Self-Replicating Automaton, Cellular Automata, The Game of Life and Beyond, Are Cellular Automata Really Useful?



Standards related to Automata

Back to Top

No standards are currently tagged "Automata"


Jobs related to Automata

Back to Top