Lecture 7: From LTL and CTL to CTL*

2 February 2010

Review and comparison of the syntax and semantics of temporal logics LTL and CTL. Distinction between the direct observability of individual runs, and the assessment of alternative possibilities in branching-time logics like CTL. Valuation of CTL formulae on specific transition systems. Distinct expressiveness of LTL and CTL: example to show AF AG is not AFG.

Link: Slides (with CTL valuation table corrected)


Two items to read for Thursday:

The first of these is an invited conference talk, giving an overview of some work on applying model-checking to problems in systems biology. The second is a more detailed article on the material.

Lecture 6: Branching Time and CTL

28 January 2010

Update: Revised reference to Fages and Rizk time series paper — see below.

The slides for this lecture review Linear Temporal Logic (LTL), with several examples of LTL formulae for expressing properties of Petri Net behaviour.

Boardwork then gave the expansion from linear time to branching time, the syntax for CTL formulae, and some small discussion of their interpretation.

The final slide gives some further reading, reproduced below. All articles are linked to web pages where you should be able to download copies: you may be asked to log in with the EASE authentication service along the way.

Read the rest of this entry »

Lecture 5: Linear Temporal Logic

25 January 2010

The slides for this lecture review the notions of labelled transition systems, runs and traces, and give examples of the expansion of Petri net behaviour into labelled transition systems.

Boardwork then gave definitions of LTL formula, their meaning, and some small examples of application to LTS runs and Petri net behaviours.

Heiner et al. discuss how even finite reachability graphs for Petri nets may blow up very fast (§4(5)). However, they then jump straight to branching-time with CTL.

Huth and Ryan present the syntax and semantics of LTL (§3(2)) as well as some motivation on model checking.

The SPIN tool is based on LTL model checking.