Academic Journals Database
Disseminating quality controlled scientific knowledge

Overview of Thirty Semantic Formalisms for Reo

ADD TO MY LIST
 
Author(s): S.-S. T.Q. Jongmans | F. Arbab

Journal: Scientific Annals of Computer Science
ISSN 1843-8121

Volume: 22;
Issue: 1;
Start page: 201;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: concurrency | coordination | Reo | semantics | constraint automata | connector coloring

ABSTRACT
Over the past decades, coordination languages have emerged for the specification and implementation of interaction protocols for communicating software components. This class of languages includes Reo, a platform for compositional construction of connectors. In recent years, many formalisms for describing the behavior of Reo connectors have emerged. In this paper, we give an overview of all these classes of semantic models. Furthermore, we investigate the expressiveness of two more prominent classes, constraint automata and coloring models, in detail.
RPA Switzerland

RPA Switzerland

Robotic process automation

    

Tango Rapperswil
Tango Rapperswil