Patterns in model engineering 2015 - A workshop summary

The Patterns in Model Engineering (PAME) workshop5 was held on 21 July 2015 as part of the Software Technologies: Applications and Foundations (STAF) conference, in L'Aquila, Italy. The workshop focused on identification, analysis and presentation of patterns across all aspects of modelling and Model-Driven Engineering (MDE), including patterns for modelling, metamodelling, transformation, and in constraints. The workshop featured three invited presentations by Jordi Cabot (ICREA, Spain), Daniel Varro (BME, Hungary) and Antonio Cicchetti (MDH, Sweden), five full papers, and a significant discussion and debate about the roles that patterns can play in modelling. This paper summarises the workshop discussion and highlights some of the key research challenges in the field

Towards Generic Monitors for Object-Oriented Real-Time Maude Specifications

Non-Functional Properties (NFPs) are crucial in the design of software. Specification of systems is used in the very first phases of the software development process for the stakeholders to make decisions on which architecture or platform to use. These specifications may be an- alyzed using different formalisms and techniques, simulation being one of them. During a simulation, the relevant data involved in the anal- ysis of the NFPs of interest can be measured using monitors. In this work, we show how monitors can be parametrically specified so that the instrumentation of specifications to be monitored can be automatically performed. We prove that the original specification and the automati- cally obtained specification with monitors are bisimilar by construction. This means that the changes made on the original system by adding monitors do not affect its behavior. This approach allows us to have a library of possible monitors that can be safely added to analyze different properties, possibly on different objects of our systems, at will.Universidad de Málaga, Campus de Excelencia Internacional Andalucía Tech. Spanish MINECO/FEDER project TIN2014-52034-R, NSF Grant CNS 13-19109

Interface Contracts for Workflow+ Models: an Analysis of Uncertainty across Models

Workflow models are used to rigorously specify and reason about diverse types of processes. The Workflow+ (WF+) framework has been developed to support unified modelling of the control and data in processes that can be used to derive assurance cases that support certification. However, WF+ is limited in its support for precise contracts on workflow models, which can enable powerful forms of static analysis and reasoning. In this paper we propose a mechanism for adding interface contracts to WF+ models, which can thereafter be applied to tracing and reasoning about the uncertainty that arises when combining heterogeneous models. We specifically explore this in terms of design models and assurance case models. We argue that some of the key issues in managing some types of uncertainty can be partly addressed by use of interface contract

Patterns of cooperation: fairness and coordination in networks of interacting agents

We study the self-assembly of a complex network of collaborations among self-interested agents. The agents can maintain different levels of cooperation with different partners. Further, they continuously, selectively, and independently adapt the amount of resources allocated to each of their collaborations in order to maximize the obtained payoff. We show analytically that the system approaches a state in which the agents make identical investments, and links produce identical benefits. Despite this high degree of social coordination some agents manage to secure privileged topological positions in the network enabling them to extract high payoffs. Our analytical investigations provide a rationale for the emergence of unidirectional non-reciprocal collaborations and different responses to the withdrawal of a partner from an interaction that have been reported in the psychological literature.Comment: 20 pages, 8 figure

Moment-closure approximations for discrete adaptive networks

Moment-closure approximations are an important tool in the analysis of the dynamics on both static and adaptive networks. Here, we provide a broad survey over different approximation schemes by applying each of them to the adaptive voter model. While already the simplest schemes provide reasonable qualitative results, even very complex and sophisticated approximations fail to capture the dynamics quantitatively. We then perform a detailed analysis that identifies the emergence of specific correlations as the reason for the failure of established approaches, before presenting a simple approximation scheme that works best in the parameter range where all other approaches fail. By combining a focused review of published results with new analysis and illustrations, we seek to build up an intuition regarding the situations when existing approaches work, when they fail, and how new approaches can be tailored to specific problems. © 2013 Elsevier B.V. All rights reserved