Temporal Logic
摘要
For the formal verification of concurrent programs, classical logic needs to be extended to handle time. This chapter introduces a temporal logic, which is an extension of propositional logic with several modal operators. The semantics of temporal logic is presented, as well as the extended semantic tableaux method. The chapter shows by example how concurrent programs can be verified (e.g., via model checking).