\(\infty\)-regular temporal logic and its model checking problem

DOI10.1016/0304-3975(92)90012-5zbMath0762.03011OpenAlexW2022371068MaRDI QIDQ1199535

Shuzo Yajima, Kiyoharu Hamaguchi, Hiromi Hiraishi

Publication date: 16 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90012-5

zbMATH Keywords

complexityfairnessmodel checkingexpressive power\(\omega\)-regular setsformal verification of finite state machinesinfinitary regular temporal logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Other applications of logic (03B80)

Related Items

A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic Verification of Sequential Circuits Using Temporal Logic
• Hardware Specification with Temporal Logic: An Example
• Testing and generating infinite sequences by a finite automaton