Propositional temporal logic

CCTL is a propositional temporal logic similar to QCTL. However, CCTL allows intervals, both in the formulas and the timed structures. Furthermore, the concept of time progress differs from (JCTL. 

In addition, effort has been spent on formal verification itself, especially regarding timing issues for control-flow-dominated systems. A study of propositional temporal logic has shown its feasibility to verify correctness of sequential logic circuits, CMOS transistor circuits, and finite state machine diagrams against each other [16]. This work has been received with great interest in the worldwide research community, since verifications were done that previously seemed untractable. It has been applied in the context of performance-driven controller synthesis, as described in chapter 10. 

Figure 4 presents the syntax of the propositional temporal logic we use in Backus-Naur form, and also hints at the intended semantics [13]. The truth of a temporal formula is defined with respect to a so-called model, which is an... 

Our selection of ITL is based on a number of points. It is a flexible notation for both propositional and first-order reasoning about periods of time found in descriptions of hardware and software systems. Unlike most temporal logics, ITL can handle both sequential and parallel composition and offers powerful and extensible specifi-... 

In our polymodal logic, there are two independent dimensions time and state. For each of the five PTL temporal operators, there is one operator for time and one for state, and the two are distinguished by an overscore for the state operator (e.g. o for next time and o for next state). Propositions take on values that may be different for each < time, state > pmr. 

---