An on-the-fly tableau construction for a real-time temporal logic
An on-the-fly tableau construction for a real-time temporal logic
An on-the-fly tableau construction for a real-time temporal logic
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
4. The Tableau Algorithm<br />
L0 := {((s, Now, Next), TS(¯0)) | (TS, Now, Next) ∈ NFs({ϕ})}<br />
LNew := {(s, Now, Next) | ((s, Now, Next), TS) ∈ L0 }<br />
L := ∅, E := ∅<br />
while LNew = ∅ do<br />
Let (it, Now, Next) ∈ LNew<br />
LNew := LNew\{(it, Now, Next)}<br />
L := L ∪ {(it, Now, Next)}<br />
<strong>for</strong> every (TS ′ , Now ′ , Next ′ ) ∈ NF it (Next) do<br />
E := E ∪ {((it, Now, Next), TS ′ , (it, Now ′ , Next ′ ))}<br />
if (it, Now ′ , Next ′ ) /∈ L <strong>the</strong>n<br />
LNew := LNew ∪ {(it, Now ′ , Next ′ )}<br />
od<br />
od<br />
A 29