Büchi automata, ω-regular languages, and fairness constraints. Specify and verify infinite-execution liveness properties over hardware that runs forever.
Part of Mathematical Foundations of Model Checking on formal.org.