Brown Clarke and Grumberg gave the formula that characterized these constructs up to bisimulation.  These structures are considered "fair" when their definition is made a quadruple by the inclusion of fairness  constraints. In computation tree logic, these are the M in formulas of the form M comma s bar equals p where s is a  state and p is a state formula. The transition relation in these constructs is defined for each state and each state is  labeled with the boolean propositions that hold in that state. For 10 points, name these structures in model checking  derived from the semantics of th
Brown Clarke and Grumberg gave the formula that characterized these constructs up to bisimulation.  These structures are considered "fair" when their definition is made a quadruple by the inclusion of fairness  constraints. In computation tree logic, these are the M in formulas of the form M comma s bar equals p where s is a  state and p is a state formula. The transition relation in these constructs is defined for each state and each state is  labeled with the boolean propositions that hold in that state. For 10 points, name these structures in model checking  derived from the semantics of the man who wrote Naming and Necessity.
Brown Clarke and Grumberg gave the formula that characterized these constructs up to bisimulation.  
Kripke structure [or Kripke semantics; or Kripke model; prompt on temporal structure]