A temporal proof methodology for reactive systems

A minimal proof theory that is adequate for proving the main important temporal properties of reactive programs is presented. The properties considered consist of the classes of invariance and response properties. For each of these classes a small set of rules that is complete for verifying properties belonging to the class is given. The application of these rules is illustrated by several examples. Concise presentations of complex proofs using the devices of transition tables and proof diagrams are discussed.<
>