This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification base...
We present a sound and complete logic for reasoning about SimpleAPL programs. SimpleAPL is a fragment of the agent programming language 3APL designed for the implementation of cog...
Natasha Alechina, Mehdi Dastani, Brian Logan, John...
Messaging with new media should be fun, but sometimes participating in conversations can become a burden for users due to the effort required. In this paper, examples of such situ...
Ubiquitous computing requires a multitude of devices to have access ame services. Abstract specifications of user interfaces are designed to separate the definition of a user inter...
We present an anytime algorithm which computes policies for decision problems represented as multi-stage influence diagrams. Our algorithm constructs policies incrementally, start...