Automata on infinite words and their applications in formal verification

zbMATH Open1137.68040MaRDI QIDQ5447366FDOQ5447366

Orna Kupferman

Publication date: 6 March 2008

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (7)

• Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words
• Finite Automata and the Analysis of Infinite Transition Systems
• Title not available (Why is that?)
• Automatic Theorem-Proving in Combinatorics on Words
• Title not available (Why is that?)
• A note on the decomposition of infinite automata
• Tools and Algorithms for the Construction and Analysis of Systems

   Recommendations

• Automata Theory and Model Checking 👍 👎
• Finite-State Automata on Infinite Inputs 👍 👎
• Automata- and logic-based systems design 👍 👎
• Implementation and Application of Automata 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Automata on infinite words and their applications in formal verification

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