07.01.2013 Views

Lecture Notes in Computer Science 3472

Lecture Notes in Computer Science 3472

Lecture Notes in Computer Science 3472

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

coffee<br />

co<strong>in</strong><br />

tea<br />

19 Model Check<strong>in</strong>g 563<br />

co<strong>in</strong> co<strong>in</strong><br />

coffee tea<br />

Fig. 19.3. Two vend<strong>in</strong>g mach<strong>in</strong>es<br />

where p ranges over a set of atomic propositions AP. Note that sometimes<br />

true is def<strong>in</strong>ed to be a special atomic proposition, which is valid for every state.<br />

The semantics [φ] of a formula φ is the set of all runs π for which the property<br />

holds: [φ] = {π | π |= φ}. The semantics is <strong>in</strong>ductively def<strong>in</strong>ed on the structure<br />

of the formula.<br />

π |= true<br />

π |= p ⇔ p ∈ I (π0)<br />

π |= ¬φ ⇔ π �|= φ<br />

π |= φ1 ∧ φ2 ⇔ π |= φ1 ∧ π |= φ2<br />

π |= X (φ) ⇔|π| > 1 ∧ π1 |= φ<br />

π |= φ1Uφ2 ⇔∃k ∈ [|π|−1] : � πk |= φ2 ∧∀i ∈ [k − 1] : πi �<br />

|= φ1<br />

Every run π satisfies true and every run π satisfies an atomic proposition, iff<br />

the first state π0 of the run does. The negation and conjunction is <strong>in</strong>terpreted<br />

as usual; further Boolean connectives may be <strong>in</strong>troduced as abbreviations. E.g.<br />

φ1 ∨ φ2, can be <strong>in</strong>troduced as ¬ (¬φ1 ∧¬φ2). The modality X (φ) is called “next<br />

time φ” and requires the property φ to hold for the next situation <strong>in</strong> the run.<br />

The modality φ1Uφ2 is also denoted as U (φ1,φ2). It is called “φ1 until φ2” and<br />

requires the property φ1 to hold for all situations on the run until f<strong>in</strong>ally the<br />

property φ2 holds for some situation.<br />

Besides abbreviations of further Boolean connectivities, the follow<strong>in</strong>g abbreviations<br />

are common:<br />

F (φ) :=U (true,φ)<br />

G (φ) :=¬F (¬φ)<br />

The modality F (φ) , called “f<strong>in</strong>ally φ”, requires φ to hold for some later situation.<br />

The modality G (φ) , called “globally φ”, requires φ to hold for all situations. The<br />

until modality φ1Uφ2 is sometimes called strong until because it requires φ2<br />

to become true f<strong>in</strong>ally. In contrast to this modality, there is a different variant,<br />

called weak until, which holds, even if φ2 never holds while φ1 holds forever.<br />

(φ1WUφ2 := φ1Uφ2 ∨ G (φ1)).<br />

S<strong>in</strong>ce <strong>in</strong> system verification one is typically <strong>in</strong>terested whether a specific state<br />

satisfies a certa<strong>in</strong> property, there is the follow<strong>in</strong>g convention: a state s ∈ S of a<br />

transition system satisfies a formula if every run start<strong>in</strong>g at s satisfies it.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!