Service orchestration in fog environments
A new era of automated services has permeated user's daily lives thanks to paradigms such
as Smart City and the Internet of Things. This shift from traditional applications is possible …
as Smart City and the Internet of Things. This shift from traditional applications is possible …
Towards using Reo for compliance-aware business process modeling
Business process modeling and implementation of process supporting infrastructures are
two challenging tasks that are not fully aligned. On the one hand, languages such as …
two challenging tasks that are not fully aligned. On the one hand, languages such as …
Symbolic model checking composite web services using operational and control behaviors
This paper addresses the issue of verifying if composite Web services design meets some
desirable properties in terms of deadlock freedom, safety (something bad never happens) …
desirable properties in terms of deadlock freedom, safety (something bad never happens) …
Every second counts: integrating edge computing and service oriented architecture for automatic emergency management
Emergency management has long been recognized as a social challenge due to the
criticality of the response time. In emergency situations such as severe traffic accidents …
criticality of the response time. In emergency situations such as severe traffic accidents …
Automatic code generation for the orchestration of web services with Reo
We present a compositional construction of Web Services, using Reo and Constraint
Automata as the main “glue” ingredients. Reo is a graphical and exogenous coordination …
Automata as the main “glue” ingredients. Reo is a graphical and exogenous coordination …
An optimal algorithm for the all-nearest-neighbors problem
PM Vaidya - 27th Annual Symposium on Foundations of …, 1986 - ieeexplore.ieee.org
Given a set V of n points in k-dimensional space, and an Lq-metric (Minkowski metric), the
All-Nearest-Neighbors problem is defined as follows: For each point p in V, find all those …
All-Nearest-Neighbors problem is defined as follows: For each point p in V, find all those …
Component connectors with QoS guarantees
Connectors have emerged as a powerful concept for composition and coordination of
concurrent activities encapsulated as components and services. Compositional coordination …
concurrent activities encapsulated as components and services. Compositional coordination …
Contingent durations in temporal CSPs: from consistency to controllabilities
Temporal Constraint Networks (TCSP) allow to express minimal and maximal durations
between time-points. Though being used in many research areas, this model disregards the …
between time-points. Though being used in many research areas, this model disregards the …
[PDF][PDF] Reo2PVS: Formal Specification and Verification of Component Connectors.
Compositional coordination models such as Reo provide powerful support for the
development of large-scale distributed systems by allowing construction of complex …
development of large-scale distributed systems by allowing construction of complex …
Channel-based coordination via constraint satisfaction
Coordination in Reo emerges from the composition of the behavioural constraints of
primitives, such as channels, in a component connector. Understanding and implementing …
primitives, such as channels, in a component connector. Understanding and implementing …