Situations from events to proofs 1 Introduction
Situations from events to proofs 1 Introduction
Situations from events to proofs 1 Introduction
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
(P 1 ) e < e ′ implies not e ′ < e<br />
(P 2 ) e < e ′ < e ′′ implies e < e ′′<br />
(P 3 ) e ○ e<br />
(P 4 ) e ○ e ′ implies e ′ ○ e<br />
(P 5 ) e < e ′ implies not e ○ e ′<br />
(P 6 ) e 1 < e 2 ○ e 3 < e 4 implies e 1 < e 4<br />
(P 7 ) e < e ′ or e ○ e ′ or e ′ < e<br />
Table 2: Postulates for event structures ([KR93], page 667)<br />
in Table 2. 3<br />
equivalence<br />
By (P 7 ), (P 5 ) and (P 4 ), we can define ○ <strong>from</strong> < through the<br />
e ○ e ′ iff neither e < e ′ nor e ′ < e .<br />
In cases where ○ is = on E, < is a linear order. But in general, we<br />
(i)<br />
form sets of pairwise overlapping <strong>events</strong>, collecting them in<br />
O(○)<br />
def<br />
= {i ⊆ E | (∀e, e ′ ∈ i) e ○ e ′ }<br />
(ii)<br />
lift < existentially <strong>to</strong> O(○), defining for i, i ′ ∈ O(○),<br />
i < O i ′<br />
def<br />
⇔ (∃e ∈ i)(∃e ′ ∈ i ′ ) e < e ′<br />
(iii)<br />
equate temporal instants with ⊆-maximal elements of O(○)<br />
I(○)<br />
def<br />
= {i ∈ O(○) | (∀i ′ ∈ O(○)) i ⊆ i ′ implies i = i ′ }<br />
and say e occurs at i if e ∈ i.<br />
Theorem (Kamp). < O linearly orders I(○) and for each e ∈ E,<br />
{i ∈ I(○) | e ∈ i}<br />
is a < O -interval (i.e. for all i, j, k ∈ I(○), if e ∈ j, e ∈ k and j < O i < O k then<br />
e ∈ i).<br />
How do event structures and Kamp’s theorem above relate <strong>to</strong> Φ-points?<br />
Given a Φ-point p, let us form the triple 〈E p , < p , ○ p 〉 by collecting fluents with<br />
interval temporal profiles in<br />
E p<br />
def<br />
= {ϕ ∈ Φ | p({ϕ}) = ϕ }<br />
3 The first two postulates are superfluous. (P 1 ) is derivable <strong>from</strong> (P 2 ), (P 3 ) and (P 5 ); and<br />
(P 2) <strong>from</strong> (P 3) and (P 6).<br />
9