Mapping Dooley Graphs and Commitment Causality to the "-Calculus

  • Authors:
  • Feng Wan;Munindar P. Singh

  • Affiliations:
  • North Carolina State University;North Carolina State University

  • Venue:
  • AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Commitments among agents can be used to model business processes in a manner that preserves the autonomy and heterogeneity of the interacting parties. Dooley graphs are widely used in conversation-based multiagent system design. Commitments and their causal relationships can be inferred from Dooley graphs to flexibly model business processes. We present a theoretical foundation for Dooley graphs, commitments, and causality in terms of the 驴-calculus, a process algebra for specifying concurrent systems, which has found application in business process modeling. This paper expresses the key elements of Dooley graphs (roles, characters, conversations) and of our approach (commitments and causal diagrams) using the 驴-calculus. Further, we accommodate a new variety of primitives for exception handling termed reentrant connectors. The 驴-calculus enables us to derive useful properties from a given model and to validate its correctness. We show how these properties assist in building an entire business process model in which agents interact flexibly.