## Propositional dynamic logic for reasoning about first-class agent interaction protocols (2010)

Venue: | Computational Intelligence |

Citations: | 2 - 2 self |

### BibTeX

@ARTICLE{Miller10propositionaldynamic,

author = {Tim Miller and Peter Mcburney},

title = {Propositional dynamic logic for reasoning about first-class agent interaction protocols},

journal = {Computational Intelligence},

year = {2010}

}

### OpenURL

### Abstract

For agents to fulfill their potential of being intelligent and adaptive, it is useful to model their interaction protocols as executable entities that can be referenced, inspected, composed, shared and invoked between agents, all at runtime. We use the term first-class protocol to refer to such protocols. Rather than having hard-coded decision making mechanisms for choosing their next move, agents can inspect the protocol specification at runtime to do so, increasing their flexibility. In this paper, we show that propositional dynamic logic (PDL) can be used to represent and reason about the outcomes of first-class protocols. We define a proof system for PDL that permits reasoning about recursively-defined protocols. The proof system is divided into two parts: one for reasoning about terminating protocols, and one for reasoning about non-terminating protocols. We prove that proofs about terminating protocols can be automated, while proofs about non-terminating protocols are unable to be automated in some cases. We prove that, for a restricted class of non-terminating protocols, proofs about them can be transformed to proofs about terminating protocols, making them automatable. Key words: multi-agent systems, agent interaction protocols, propositional dynamic logic, first-class protocols.