An algorithmic approach for checking closure properties of temporal logic specifications and ω-regular languages (original) (raw)

This paper introduces a novel algorithmic approach for assessing the closure properties of temporal logic specifications, particularly focusing on ω-regular languages and regular expressions. The authors explore the decidability of closure under various equivalence relations, establishing that many closure properties—including trace closedness, stutter closedness, and projective closedness—can be verified in PSPACE. The findings demonstrate practical implications for state-space exploration in verification processes, allowing for a more efficient representation of equivalent execution sequences.