Constrained global types for dynamic checking of protocol conformance in multi-agent systems

Authors:
Davide Ancona;Matteo Barbieri;Viviana Mascardi
Affiliations:
DIBRIS - Università di Genova, Genova, Italy;DIBRIS - Università di Genova, Genova, Italy;DIBRIS - Università di Genova, Genova, Italy
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 3
Cited 0

Modeling component connectors in Reo by constraint automata

Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Programming Multi-Agent Systems in AgentSpeak using Jason (Wiley Series in Agent Technology)

Programming Multi-Agent Systems in AgentSpeak using Jason (Wiley Series in Agent Technology)
Structured communication-centred programming for web services

ESOP'07 Proceedings of the 16th European conference on Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Global types are behavioral types for specifying and verifying multiparty interactions between distributed components, inspired by the process algebra approach. In this paper we extend the formalism of global types in multi-agent systems resulted from our previous work with a mechanism for easily expressing constrained shuffle of message sequences; accordingly, we extend the semantics to include the newly introduced feature, and show the expressive power of these "constrained global types".