# Finite-State Automata on Infinite Inputs

@inproceedings{Mukund2012FiniteStateAO,
title={Finite-State Automata on Infinite Inputs},
booktitle={Modern Applications of Automata Theory},
year={2012}
}
This paper is a self-contained introduction to the theory of finite-state automata on infinite words. The study of automata on infinite inputs was initiated by Buchi in order to settle certain decision problems arising in logic. Subsequently, there has been a lot of fundamental work in this area, resulting in a rich and elegant mathematical theory. In recent years, there has been renewed interest in these automata because of the fundamental role they play in the automatic verification of finite… Expand
22 Citations

#### Figures and Topics from this paper

Quantum ω-Automata over Infinite Words and Their Relationships
• Mathematics
• 2019
Inspired by the results of finite automata working on infinite words, we studied the quantum ω-automata with Büchi, Muller, Rabin and Streett acceptance condition. Quantum finite automata play aExpand
Computing the Width of Non-deterministic Automata
• Computer Science, Mathematics
• Log. Methods Comput. Sci.
• 2019
It is shown that computing the width of an automaton is EXPTime-complete, which implies EXPTIME-completeness for multipebble simulation games on NFAs, and shows that checking whether a coB\"uchi automata is determinisable by pruning is NP-complete. Expand
EFFICIENT ALGORITHM TO TRANSFORM MINIMALIST SUBSET OF LTL FORMULA INTO FINITE STATE MODELS
• Computer Science
• 2018
A subset of LTL formula is proposed which can be converted to Büchi automata whose the size is polynomial, which makes verification methods hard or even impossible to be implemented in practice. Expand
Converting A Subset of LTL Formula to Buchi Automata
• Engineering
• 2019
The translation of LTL formula into equivalent Buchi automata plays an important role in many algorithms for LTL model checking, which consist in obtaining a Buchi automaton that is equivalent to theExpand
Revisiting MITL to Fix Decision Procedures
• Computer Science
• VMCAI
• 2018
It is shown that both satisfiability and model checking for MITLare Open image in new window, as was previously claimed, and a fragment of MITL is identified, called MITL WI, that is richer than $$\texttt {MITL}_{0,\!\infty }$$, for which both satisfiable and model check are shown. Expand
Microcontroller Assembly Synthesis from Timed Automaton Task Specifications
• Computer Science
• FMICS
• 2012
A method for the automatic refinement of single-task timed automaton specifications into microcontroller assembly code is proposed, which copes with parallel inputs and outputs, but is restricted to timedAutomaton specifications with only one clock variable that is reset after each transition. Expand
Decidability and complexity for ω-regular properties of stochastic systems
• Mathematics, Computer Science
• Log. J. IGPL
• 2012
A strong and a weak SAT algorithm for PQLTL, which can reason about any semialgebraic constrain over probabilities of paths of a Markov chain satisfying a QLTL formulae, is devised and derived. Expand
A notion of dissipativity for discrete event systems
• Mathematics, Computer Science
• 2016 24th Mediterranean Conference on Control and Automation (MED)
• 2016
The concept of dissipativity is taken and applies to discrete event systems (DES) by replacing the notion of time with an event-based definition, and properties of dissipative DES are shown that connect with existing notions of stability for DES as would be expected from the classical definition. Expand
Modal Scenarios as Automata
• Mathematics, Computer Science
• Language, Culture, Computation
• 2014
Here MSSs are presented, in which the notion of temperature is adopted from LSCs, replacing traditional acceptance conditions, and may encode more general patterns than those inherent in LSC, such as loops, alternatives and breaks. Expand
Global Exponential Stabilization of Language Constrained Switched Linear Discrete-Time System Based on the S-procedure Approach
• Mathematics, Computer Science
• 2019 IEEE 58th Conference on Decision and Control (CDC)
• 2019
A technique in linear matrix inequalities called S-procedure is employed to provide sufficient conditions of GES which are less conservative than the existing Lyapunov-Metzler condition, and a more flexible result is obtained such that stabilization path at each moment might be multiple. Expand

#### References

SHOWING 1-10 OF 31 REFERENCES
Asynchronous Cellular Automata for Infinite Traces
• Computer Science
• ICALP
• 1992
This paper provides another characterization of this family of recognizable languages of infinite traces using asynchronous cellular automata (which carry the most intuitive idea of finite suite concurrent machines), and gives effective constructions for c-rational operations on these automata, which are of independent interest. Expand
Automata on Infinite Objects
• W. Thomas
• Computer Science, Mathematics
• Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
• 1990
This chapter discusses the formulation of two interesting generalizations of Rabin's Tree Theorem and presents some remarks on the undecidable extensions of the monadic theory of the binary tree. Expand
• Computer Science, Mathematics
• Inf. Comput.
• 1994
This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem. Expand
Testing and Generating Infinite Sequences by a Finite Automaton
Two apparently divergent areas of inquiry should give rise to the same problem, namely, that of describing the infinite history of finite automata, and it is this problem to which the remainder of this paper will address itself. Expand
Progress measures for complementation omega -automata with applications to temporal logic
• N. Klarlund
• Mathematics, Computer Science
• [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
• 1991
It is shown that a graph-theoretic approach based on the notion of progress measures is a potent tool for complementing omega -automata, and that the powerful temporal logic ETLs is much more tractable than previously thought. Expand
The Complementation Problem for Büchi Automata with Appplications to Temporal Logic
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 1987
This work uses a construction that involves only an exponential blow-up in the size of the automaton to prove a polynomial space upper bound for the propositional temporal logic of regular events and to prove the complexity hierarchy result for quantified propositionalporal logic. Expand
Decidability of second-order theories and automata on infinite trees
Introduction. In this paper we solve the decision problem of a certain secondorder mathematical theory and apply it to obtain a large number of decidability results. The method of solution involvesExpand
Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable
It is proved that the satisfiability problem for propositional dynamic logic of looping and converse is elementarily decidable and deterministic two- way automata on infinite trees are defined and it is shown how they can be simulated by nondeterministic one-way automata. Expand
Logical Definability on Infinite Traces
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 1996
The main results of the present paper are the equivalence of monadic second order logic and recognizability for real trace languages, and that first order definable, star-free, and aperiodic realExpand
On ω-automata and temporal logic
• Mathematics, Computer Science
• STOC '89
• 1989
The finding is that Büchi, Streett, and EL automata span a spectrum of succinctness, and it is shown that the decision problem for ETL, where temporal connectives are represented byEL automata, is EXPSPACE-complete, and the decision problems for ETRL and S are PSPACE- complete. Expand