Reactive Systems: Modelling, Specification and Verification - Cs.ioc.ee

List of Figures
2.1 The interface for process CS . . . . . . . . . . . . . . . . . . . . 10
2.2 The interface for process CM | CS . . . . . . . . . . . . . . . . . 13
2.3 The interface for process CM | CS | CS ′ . . . . . . . . . . . . . . 14
2.4 The interface for process CM | CS | CM ′ . . . . . . . . . . . . . . 15
2.5 The interface for process SmUni | CS ′ . . . . . . . . . . . . . . . 16
2.6 Labelled transition system with initial state p . . . . . . . . . . . 22
3.1 P R Q implies that C[P ] R C[Q] . . . . . . . . . . . . . . . . . . 39
3.2 A bisimulation showing B 2 0 ∼ B1 0 | B1 0 . . . . . . . . . . . . . . 59
6.1 Two processes . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
6.2 A process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123
6.3 The processes p and pn . . . . . . . . . . . . . . . . . . . . . . . 141
6.4 The coffee machine gkm . . . . . . . . . . . . . . . . . . . . . . 143
6.5 Simple infinite process p . . . . . . . . . . . . . . . . . . . . . . 145
7.1 The pseudocode for Hyman’s algorithm . . . . . . . . . . . . . . 162
10.1 Light switch . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
10.2 Clock constraint in the guard vs in the invariant . . . . . . . . . . 203
10.3 A small Jobshop . . . . . . . . . . . . . . . . . . . . . . . . . . . 204
10.4 The lazy Worker and his demanding Employer . . . . . . . . . . . 210
11.1 A simple timed automaton . . . . . . . . . . . . . . . . . . . . . 226
11.2 Partitioning of the valuations for the automaton on Figure 11.1 . . 227
11.3 Symbolic exploration of the timed automaton on Figure 11.1 . . . 240
12.1 A simple timed automaton . . . . . . . . . . . . . . . . . . . . . 248
12.2 Regions for cx = 2 and cy = 3 . . . . . . . . . . . . . . . . . . . 255
13.1 The timed automaton Ai for process i . . . . . . . . . . . . . . . 276
vii