Object-centric Predictive Monitoring has recently gained attention due to advances in machine learning and rise of Object-Centric Event Logs (OCELs), which comprehensively capture object interactions. This paper presents a modular framework supporting customizable pipelines for predictive analysis across diverse event logs. The framework comprises three core components: Preprocessing (preserving object relationships via graph structures), Graph Embedding Model, and Prediction Model. We experimentally evaluated various combinations of embeddings and predictors on three public OCELs. Results show that no single configuration consistently dominates. However, GAT and Graph Transformer models perform best for predicting remaining time and the number of events. Performance improves with larger embedding and subgraphs, particularly for neuralbased models. Finally, GAT delivered the most stable and highperforming results across all event logs in generalization tests.

Using package managers is a simple and common method for reusing code through project dependencies. However, these, direct, dependencies can themselves rely on additional packages, resulting in indirect dependencies. It may then become complex to get a grasp of the whole set of dependencies of a project. Beyond studying individual projects, a deep understanding of software ecosystems is also a critical prerequisite for achieving sustained success in software development. This paper presents the 2025 edition of the MSR conference mining challenge. This year’s mining challenge focuses on dependencies and dependency ecosystem analysis using the Goblin framework that has been presented at the previous edition of the MSR conference. Goblin is composed of a Neo4j Maven Central dependency graph and a tool called Weaver for on-demand metric weaving into dependency graphs. As a whole, Goblin is a customizable framework for ecosystem and dependency analysis.

Keeping dependencies up to date is a crucial software maintenance task that requires significant effort. Developers must choose which dependencies to update, select appropriate target versions, and minimize the impact of updates in terms of breaking changes and incompatibilities. Several factors influence the choice of a new dependency version, including its freshness, popularity, absence of vulnerabilities, and compatibility.

Dependency graphs support software maintenance and software ecosystem analysis. Several metrics can be used on top of these graph models but the set of such metrics is to evolve over time. Further, some metrics have a dynamic nature, requiring being able to "rewind" dependency graphs at some point in time. To address these issues we propose the Goblin framework. It is composed of a dependency graph metamodel with time-related information, a miner to retrieve the graph from Maven Central, and a tool for on-demand metric weaving into dependency graphs. As a whole, Goblin is a customizable framework for ecosystem and dependency analysis. This is illustrated with a set of complementary experiments. Our tools, datasets, and experiments are freely available online.

International audience

Summary The ACID transaction model has played a cornerstone role in service composition to guarantee that composite services (CSs) have transactional support and consistent outcomes even in presence of failures. However, the classical ACID properties are too restrictive for independent and multi‐proprietors services running on distributed environments, such clouds. Transactional properties allow a relaxed atomicity and isolation, providing an “all‐or‐(almost)nothing” model. In previous works, we proposed a model to relax atomicity, calledfuzzyatomicity, according user requirements (acceptable fuzzy atomicity). In this article, we extend that model and propose an approach to measure thefuzzyatomicity. Our model allows to self‐adapt the CS execution, taking into account the state of the CS execution and user preferences (ie, theacceptable fuzzy atomicityexpressed in the user requirements). Thisfuzzyatomicity measure is applied in a self‐adaptive CS execution model based on the transactional properties (pivot, compensatable, and retriable) of its component services and on a checkpointing mechanism. It is suitable to cloud computing, which offers cloud services on demand and in which CS execution should preserve the self‐organizing and self‐adaptivity properties of such environment, specially in the presence of failures. We show how it is possible to relax the retriable property in CSs execution, based on ourfuzzyatomicity model. Additionally, in this work, we present a comparative analysis of the most recent works in the context of ACID properties relaxation for CS.

An important problem in Web services composition process is optimal selection of services meeting the user functional requirements (tasks of a workflow) and ensuring a reliable execution of the composition. Therefore, non-functional properties of services such as their transactional behavior as well as their Quality of Service (QoS) must be considered. In this context, a challenging objective is to assist users in integrating on the fly the operations of services to realize their required tasks by further meeting their transactional and QoS preferences. Towards this purpose, we present SPLTQSSS, a Software Product Line based approach for Stateful (conversation-based) Service Selection problem with Transactional and QoS support. SPL-TQSSS considers the set of functionally-equivalent services as part of a service family by modeling their internal operations using Feature Models. Then, SPL-TQSSS chooses the best services, from the service families matching with every task of the workflow, which fit with the user transactional preference and satisfy QoS constraints.

Web Services are the most famous implementation of service-oriented architectures that has brought some challenging research issues. One of these is the composition, i.e., the capability to recursively construct a composite Web service as a workflow of other existing Web services, which are developed by different organizations and offer diverse functionalities (e.g., ticket purchase, payment), transactional properties (e.g., compensatable or not), and Quality of Service (QoS) values (e.g., execution price, success rate). The selection of a Web service, for each activity of the workflow, meeting the user's requirements, is still an important challenge. Indeed, the selection of one Web service among a set of them that fulfill some functionalities is a critical task, generally depending on a combined evaluation of QoS. However, the conventional QoS-aware composition approaches do not consider the transactional constraints during the composition process. This paper addresses the issue of selecting and composing Web services not only according to their functional requirements but also to their transactional properties and QoS characteristics. We propose a selection algorithm that satisfies user's preferences, expressed as weights over QoS criteria and as risk levels defining semantically the transactional requirements. Proofs and experimental results are presented.

Web services composition has been gaining interest over the last years as it leverages the capabilities to offer complex operations resulting from the aggregation of Web services offered by different organizations. As composite Web services are often long-running, loosely coupled and cross-organizational applications, advanced transactional support is required to ensure reliable execution. In addition, in the presence of multiple Web services with equivalent functionality, users will discriminate the alternatives based on their quality of service (QoS). This paper address the issue of selecting and composing Web services not only according to their functional requirements but also to their transactional properties and QoS characteristics defined using a quality model. In this model, Web services are selected in a way that satisfies user preferences. These preferences are expressed as weights over QoS criterion and as risk level defining semantically the transactional requirements.

The recent approaches for Web services composition tend to integrate heterogeneous business processes executed in Peer-to-Peer networks. In such networks, component Web services are invoked on independent peers and are orchestrated according to the transactional requirements defined by the designers or the users of the composite Web service. Since component Web services can be dynamically invoked and are generally implemented as black boxes, concurrency between them may appear. This paper presents the transactional execution model of composite Web services exploiting the transactional properties of their component Web services. The proposed concurrency control is ensured by a decentralized serialization graph based on an optimistic protocol and on the hierarchical structure of the composition. The globally correct execution of the composite Web service is achieved by communication among dependent subtrans-actions and the peers they have accessed.