A flexible notation for both propositional and first-order reasoning about periods of time found in descriptions of hardware and software systems. A paper by Antonio Cau, Ben Moszkowski and Hussein Zedan.

A BDD based tool for the formal verification of concurrent systems using a propositional branching-time temporal logic: action computation tree logic (ACTL). It runs under different OS, including Linux and Windows 95/98/NT.

JMCA is an Java application for formally verifying finite-state concurrent systems using temporal logic formulas (ltl formulas).

A survey of the field by Jan Chomicki and David Toman. From the 1997 BRICS Lecture Series.

First in a series of posts to the www-math mailing list on using TL operators in web pages. Clicking [Prev] will continue through the series.

Provides automatic verification of protocols and reactive systems through temporal logic specifications.

The Stanford Encyclopedia of Philosophy entry on the subject, with a detailed description, application areas and a bibliography.

A general tool for verifying the correctness of distributed software (designs) in a rigorous and mostly automated fashion. Can be used as a full linear temporal logic model checking system.

The annual International Workshop on Temporal Representation and Reasoning covers temporal representation and reasoning, including temporal logic.

A case study applying temporal logic to specify the operation of a bank of identical elevators servicing a number of floors in a building.