27.01.2014 Views

Multiagent Systems

Multiagent Systems

Multiagent Systems

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

Prof. Dr. Jürgen Dix · Department of Informatics, TUC <strong>Multiagent</strong> <strong>Systems</strong>, WS 06/07 541/731<br />

8. Action/Time as Modalities 2. Action: Dynamic Logic<br />

“;” means sequential composition,<br />

∪ means nondeterministic choice,<br />

∗ means finite iteration (regular expr.),<br />

[φ?] means test.<br />

Thus we assume that the labels obey the<br />

following conditions:<br />

s a;b<br />

−→ t iff s<br />

s a∪b<br />

−→ t iff s<br />

ab<br />

−→ t,<br />

−→ a<br />

t or s<br />

b<br />

−→ t,<br />

s −→ a∗<br />

t is the reflexive and transitive closure of<br />

s −→ a<br />

t,<br />

s −→ φ?<br />

t iff s |= M φ.

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

Saved successfully!

Ooh no, something went wrong!