Isabelle Linden

On the expressiveness of timed coordination models

Although very simple and elegant, Linda-style coordination models lack the notion of time, and are therefore not able to precisely model real-life coordination applications. Nevertheless, industrial proposals such as TSpaces and JavaSpaces, inspired from Linda, have incorporated time constructs.This paper aims at a systematic study of the introduction of time in coordination models. It builds upon previous work to study in a coherent framework the expressiveness of Linda extended with two notions of time, relative time and absolute time, and, for each notion, two types of features. On the one hand, with respect to relative time, we describe two extensions: (i) a delay mechanism to postpone the execution of communication primitives, and (ii) explicit deadlines on the validity of tuples and on the duration of suspension of communication operations. On the other hand, for absolute time, we introduce: (iii) a wait primitive capable of waiting till an absolute point of time, and (iv) time intervals, both on tuples in the data store and on communication operations.This expressiveness study points out a most expressive language for which an implementation is described, thereby allowing for the implementation of all the languages presented in the paper.

On the Expressiveness of Absolute-Time Coordination Languages

Although very simple and elegant, Linda-style coordination models lack the notion of time, and are therefore not able to precisely model real-life coordination applications. Nevertheless, industrial proposals such as TSpaces and JavaSpaces, inspired from Linda, have incorporated time constructs.

On the Expressiveness of Relative-Timed Coordination Models

Although very simple and elegant, Linda-style coordination models lack the notion of time, and are therefore not able to precisely model real-life coordination applications. Nevertheless, industrial proposals such as TSpaces and JavaSpaces, inspired from Linda, have incorporated time constructs. This paper aims at a systematic study of the introduction of relative time in coordination models. It builds upon previous work to study the expressiveness of Linda, Linda extended with a delay mechanism and Linda primitives extended to support the duration of tuples and of the suspension of communication operations.

On Modeling Coordination via Asynchronous Communication and Enhanced Matching

Abstract The paper proposes a theoretical study of a coordination language embodying Lindas asynchronous communication primitive with a refined matching mechanism based on pairs composed of attribute names associated with their values. Computations in this language are described by means of an operational semantics, reporting the whole traces of executions. The non-compositionality of this intuitive operational semantics motivates the design of a compositional and fully abstract denotational semantics, which is then exploited for studying program equivalence in this setting.

Blackboard Rules for Coordinating Context-aware Applications in Mobile Ad Hoc Networks

Thanks to improvements in wireless communication technologies and increasing computing power in hand-held devices, mobile ad hoc networks are becoming an ever-more present reality. Coordination languages are expected to become important means in supporting this type of interaction. To this extent we argue the interest of the Bach coordination language as a middleware that can handle and react to context changes as well as cope with unpredictable physical interruptions that occur in opportunistic network connections. More concretely, our proposal is based on blackboard rules that model declaratively the actions to be taken once the blackboard content reaches a predefined state, but also that manage the engagement and disengagement of hosts and transient sharing of blackboards. The idea of reactiveness has already been introduced in previous work, but as will be appreciated by the reader, this article presents a new perspective, more focused on a declarative setting.

On the Expressiveness of Timed Coordination via Shared Dataspaces

Since Linda, many differents coordination models using shared dataspaces have been developped. However, a few only have incorporated the notion of time. This paper builds upon previous work to study the expressive power of two families of timed coordination models based on shared dataspaces. The first one relies on Lindas communication primitives whereas the second relies on the more general notion of multi-set rewriting, incorporated, for instance, in Gamma. We analyse the expressiveness increase provided by the primitives in each of the two families and also compare the expressiveness power of the two families.

A framework for the operationalization of monitoring in business intelligence requirements engineering

Business intelligence (BI) is perceived as a critical activity for organizations and is increasingly discussed in requirements engineering (RE). RE can contribute to the successful implementation of BI systems by assisting the identification and analysis of such systems’ requirements and the production of the specification of the system to be. Within RE for BI systems, we focus in this paper on the following questions: (i) how the expectations of a BI system’s stakeholders can be translated into accurate BI requirements, and (ii) how do we operationalize specifically these requirements in a system specification? In response, we define elicitation axes for the documentation of BI-specific requirements, give a list of six BI entities that we argue should be accounted for to operationalize business monitoring, and provide notations for the modeling of these entities. We survey important contributions of BI to define elicitation axes, adapt existing BI notations issued from RE literature, and complement them with new BI-specific notations. Using the i* framework, we illustrate the application of our proposal using a real-world case study.

On Density in Coordination Languages

Coordination languages have been proved very suitable for modeling and programming service-oriented applications. In particular, those based on tuple spaces offer an elegant way of making different components of such applications interact smoothly through the deposit and retrieval of tuples in a shared space. However, in their basic form, these languages only allow one tuple to be put at a time and, when more than one tuple matches a required one, the selection is made non deterministically. This is obviously too weak to capture popularity or quality measures, which are nevertheless central in service oriented applications. To that end, we propose an extension of a Linda-like language aiming at promoting the notion of density and, based on De Boer and Palamidessi’s notion of modular embedding, establish that it strictly increases the expressiveness of Linda. Following our previous work, we also study the hiearchy of the sublanguages induced by considering subsets of tuple primitives.

Decision Support Systems V - Big Data Analytics for Decision Making: First International Conference, ICDSST 2015, Belgrade, Serbia, May 27-29, 2015

This book constitutes the refereed proceedings of the First International Conference on Decision Support Systems Technology, ICDSST 2015, held in Belgrade, Serbia, in May 2015. The theme of the event was Big Data Analytics for Decision-Making and it was organized by the EURO (Association of European Operational Research Societies) working group of Decision Support Systems (EWG-DSS).The eight papers presented in this book were selected out of 26 submissions after being carefully reviewed by at least three internationally known experts from the ICDSST 2015 Program Committee and external invited reviewers. The selected papers are representative of current and relevant research activities in the area of decision support systems, such as decision analysis for enterprise systems and non-hierarchical networks, integrated solutions for decision support and knowledge management in distributed environments, decision support system evaluations and analysis through social networks, and decision support system applications in real-world environments. The volume is completed by an additional invited paper on big data decision-making use cases.

Proposals for the integration of interactive dashboards in business process monitoring to support resources allocation decisions

Most commonly used business process management systems are focused on the control-flow management. Regarding resource management, the modelling languages mainly focus on role-defined human resources allocation. At run-time, the resource allocation is managed at case level. To answer a need for more global resource management capabilities, we propose the integration of interactive dashboards in a resource-aware business process management platform. This framework, associated with a formal design methodology, offers global views on resource occupation and aims to enhance decision support regarding both human and non-human resource management at run-time.