Finite Automata and the Analysis of Infinite Transition Systems

DOI10.1142/9789814271059_0016MaRDI QIDQ4907868zbMATH OpenOpenAlexFDO

Authors Wolfgang Thomas

Publication date 26 February 2013

Published in Modern Applications of Automata Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/d2b44987c210c25a4a1792d5f8d5216f5d4a932f

zbMATH Keywords

Caucal hierarchyinfinite transition systemsmodel checking

Mathematics Subject Classification ID

Temporal logic (03B44) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Implementation and Application of Automata
• An automata-theoretic approach to infinite-state systems
• scientific article; zbMATH DE number 1670767
• Finite-state automata on infinite inputs
• Automata on infinite words and their applications in formal verification
• Theory of finite automata
• THEORY OF FINITE AUTOMATA
• scientific article; zbMATH DE number 3876597
• scientific article; zbMATH DE number 4037202
• Finite automata over algebraic structures: models and some methods of analysis

Cited in

(17)

• scientific article; zbMATH DE number 1670767 (Why is no real title available?)
• Finite automata-models for the investigation of dynamical systems
• Automata-based presentations of infinite structures
• scientific article; zbMATH DE number 3876597 (Why is no real title available?)
• The Reachability Problem over Infinite Graphs
• An automata-theoretic approach to infinite-state systems
• Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
• CHARACTERIZATION OF FINITE STATE AUTOMATA—TOPOLOGICAL APPROACH
• scientific article; zbMATH DE number 177252 (Why is no real title available?)
• scientific article; zbMATH DE number 2087217 (Why is no real title available?)
• scientific article; zbMATH DE number 1903366 (Why is no real title available?)
• Finite-state automata on infinite inputs
• Presburger arithmetic with algebraic scalar multiplications
• Implementation and Application of Automata
• Developments in Language Theory
• An internal presentation of regular graphs by prefix-recognizable graphs
• Decidability bounds for Presburger arithmetic extended by sine

This page was built for publication: Finite Automata and the Analysis of Infinite Transition Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907868)