Distributed software is becoming more and more dynamic to support applications able to respond and adapt to the changes of their execution environment. For instance, service-oriented computing (SOC) envisages applications as services running over globally available computational resources where discovery and binding between them is transparently performed by a middleware. Asynchronous Relational Networks (ARNs) is a well-known formal orchestration model, based on hypergraphs, for the description of service-oriented software artefacts. Choreography and orchestration are the two main design principles for the development of distributed software. In this work, we propose Communicating Relational Networks (CRNs), which is a variant of ARNs, but relies on choreographies for the characterisation of the communicational aspects of a software artefact, and for making their automated analysis more efficient.
[1]
Daniel Brand,et al.
On Communicating Finite-State Machines
,
1983,
JACM.
[2]
Emilio Tuosto,et al.
From Communicating Machines to Graphical Choreographies
,
2015,
POPL.
[3]
Nobuko Yoshida,et al.
Multiparty Session Types Meet Communicating Automata
,
2012,
ESOP.
[4]
Emilio Tuosto,et al.
From Orchestration to Choreography through Contract Automata
,
2014,
ICE.
[5]
A. Pnueli.
The Temporal Semantics of Concurrent Programs
,
1979,
Theor. Comput. Sci..
[6]
José Luiz Fiadeiro,et al.
A Logic-Programming Semantics of Services
,
2013,
CALCO.
[7]
C. Peltz,et al.
Web Services Orchestration and Choreography
,
2003,
Computer.
[8]
Zohar Manna,et al.
A Decision Algorithm for Full Propositional Temporal Logic
,
1993,
CAV.