An algorithmic approach for checking closure properties of Ω-regular languages

DOI10.1007/3-540-61604-7_78zbMath1514.68109OpenAlexW1767070588MaRDI QIDQ6162107

Pierre Wolper, Doron A. Peled, Thomas Wilke

Publication date: 28 June 2023

Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61604-7_78

Mathematics Subject Classification ID

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

Related Items (3)

Stutter-invariant temporal properties are expressible without the next-time operator ⋮ An expressively complete linear time temporal logic for Mazurkiewicz traces ⋮ An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages

Cites Work

• A stubborn attack on state explosion
• Event fairness and non-interleaving concurrency
• Combining partial-order reductions with on-the-fly model-checking.
• A syntactic congruence for rational \(\omega\)-languages
• The complementation problem for Büchi automata with applications to temporal logic
• Automata-theoretic techniques for modal logics of programs
• Verification of distributed programs using representative interleaving sequences
• Proving partial order properties
• Reasoning about infinite computations
• Rational and recognizable complex trace languages
• Temporal logic can be more expressive
• The complexity of propositional linear temporal logics
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithmic approach for checking closure properties of Ω-regular languages