The Internet of Things (IoT) paradigm is defined as a complex large scale and distributed, and dynamic infrastructure composed of a huge number of heterogeneous devices. Identifying particular services provided by a massive number of IoT devices remains a challenging problem. The classical centralized discovery approaches are no more suitable. In our previous work, we have proposed an avatar-based Fog-Cloud architecture to support IoT object management. The avatars are defined as virtual entities of heterogeneous IoT objects. They are endowed with reasoning capabilities that make them able to coordinate with each other to accomplish an IoT application. Through this paper, we propose to extend our previous work by a new distributed mechanism for efficient discovery of IoT services relying on Social Networking (SN) and clustering methods. This is particularly interesting in large scale IoT systems since it allows to reduce the search space so that only the neighboring social avatars most apt to participate in the collaboration to accomplish an IoT application are considered. The proposed solution has been evaluated in connected vehicles context.

Summary Modeling Cyber‐physical systems (CPS) is a challenging step that requires a lot of background from both the cyber and physical fields. However, there is a lack of studies in the existing literature that discuss the state of the art in modeling CPS or explore the research gaps in this area. In this paper, we survey existing approaches to modeling CPS. We focus on studying the considered CPS properties. Based on this study, we classify these properties and discuss their importance in different application domains. Moreover, research directions are presented to address key challenges in the specification of CPS models.

Cyber‐physical systems (CPSs) are characterized by a multitude of physical and software. Particularly time‐related properties are of paramount importance and they can impact the behaviour of these systems. Designing and verifying CPS while tackling time‐related and physical properties are very important steps in the CPS life cycle development. Indeed, it is necessary to capture and characterize the different features and their dependencies with time through expressive models. Then, these models must be verified to prove their correctness. Existing process modelling languages such as business process modelling notation (BPMN) has been widely used to model business processes. However, BPMN lacks several features for modelling rich CPS processes such as those related to time and physical properties. In this study, the authors propose a verification framework for collaborative time‐aware CPS processes. In this context, they propose to extend BPMN to support the various CPS concepts and properties. Based on this extension, they propose a consistency verification approach, which aims to verify that the time‐related and physical properties associated with each process do not give rise to conflicts. Finally, they propose a compatibility verification approach, which aims to verify that the set of involved CPS processes form consistent inter‐CPS processes.

The Internet of Things (IoT) continues to expand undeniably fast to reach billions of connected heterogeneous devices. This is changing the way systems are built: new applications integrating software and physical devices are emerging in different domains, such as health, smart building, and smart cities. This brings opportunities to enable new added value services. Nevertheless, building and managing such highly dynamic and heterogeneous infrastructures built upon a multitude of mobile and resource-limited devices is challenging. In this paper, we propose a semantic based autonomic management approach for service oriented IoT systems. The aim is to support building and managing highly dynamic new value added IoT services. The proposed approach relies on a semantic based model to characterize the system properties and then enables semantic reasoning, and graph grammars to enable its management and evolution. A use case is proposed to show the related features of the proposed approach and an evaluation study is presented.

Cyber-physical systems (CPS) enable the development of complex real-world applications through the integration of computational and physical processes. The resulting processes are usually constrained by hard timing and physical requirements. These requirements are of paramount importance and must be handled at the different steps of the CPS process life cycle: from modeling until execution. Business Process Modeling Notation (BPMN) enables us to model processes in general. Even if BPMN provides a rich notation to cater for relevant features of process modeling, its capabilities are limited to capturing specific CPS processes properties, particularly physical and temporal properties. On the other hand, it is necessary to verify these properties to ensure that CPS can operate in a provably correct manner. In this paper, we focus on the problem of modeling and verifying CPS processes according to physical and temporal properties. To do so, we first propose to extend BPMN to handle specific CPS processes. Based on this extension, we propose a verification approach which relies on a constraint satisfaction model to check the consistency of the considered properties.

Modeling is one of the most important topics in the area of Cyber-Physical Systems (CPS). By using BPMN4CPS [1], a designer can model CPS and their temporal properties as a set of collaborative and communicating processes organized in three parts: a cyber part, a controller part, and a physical part. However, the designer might specify a faulty combination of properties that can cause temporal violations. To address this problem and to check the consistency of the given properties, our tool automatically translates a CPS process model to a constraint satisfaction model. In this paper, we illustrate how to implement the BPMN4CPS approach and we demonstrate the capabilities of our tool.

Cyber-physical systems (CPS) are a set of physical entities controlled by software systems to reach a specific goal under temporal and physical resource constraints. Existing research pays little attention to the modeling of CPS at the business process layer, and is lacking in considering the temporal dimension. In this paper, we present a set of time patterns applied to the cyber and physical elements of CPS processes. We model this process using a directed graph with associated time and time-dependent constraints.

Modeling is one of the most important topics in the domain of Cyber-Physical Systems (CPS). In the field of process modelling, Business Process Modeling and Notation (BPMN) is the most used standard. However, BPMN remains limited to cater for the specific characteristics and properties of CPS such as real world properties. In this paper, we propose BPMN4CPS, which provides a set of extensions for BPMN to properly and accurately model CPS processes. In order to illustrate the applicability of BPMN4CPS, we present a case study of an ambulance drone system.

QoS-based service selection is one of the important requirements in Service Oriented Computing (SOC). A challenging task towards this purpose is the selection of the best combination of services that fulfils user's requirements while meeting quality of service (QoS) constraints. This challenge becomes more complex when dealing with time-dependent QoS values and temporal properties. Indeed, during the selection, mutual dependencies between the different temporal constraints may arise so that the selection of each service may influence or be influenced by the selection of other services. On other side, to find the best solution, all potential combinations must be compared. However, the number of these combinations may be very high, which can present a barrier for enabling effective service selection. In this paper, we present a heuristic based time-aware service selection approach to efficiently select a close-to-optimal combination of services. First, pruning techniques are adopted to reduce the search space. Second, a novel heuristic approach is proposed based on service clustering, constraints decomposition and local selection while considering both QoS and temporal constraints. Finally, experiments which confirm the feasibility and effectiveness of the proposed approach in terms of its timeliness and optimality, are conducted.

The fourth track of MADYNE continues to look after models of relationship between enterprises seen from business process management perspective. This track aims to promote concepts, solutions, and approaches for automating dynamic management, interoperability and integration of networked collaborative enterprise applications. Several models and technologies are being developed and deployed to consolidate system integration of networked collaborative enterprises which evolve in dynamic environments. The selected papers present reviews and analysis of existing and ongoing solutions for the challenging problem of management of dynamic enterprises.

Dynamic selection of the best services to execute abstract tasks of business processes is very important. Indeed, it enables to cope with complex user's requirements that require the collaboration of several more elementary services. However, with the increasing amount of candidate services of each business task that offer different QoS (Quality of Service) values, the selection of the optimal combination of services becomes a very hard task. This problem is more complex when dealing with temporal properties of business processes associated with time-dependent QoS parameters that can change according to the execution time. Unlike static QoS which have been deeply studied in the existing service selection approaches, time-dependent QoS are insufficiently taken into consideration. In this paper, we are interested in the problem of service selection to satisfy a given business process while considering temporal properties associated to time-dependent QoS. The selection approach that we propose relies on a new service pruning approach that is applied prior to our selection algorithm to reduce the number of candidate services while guaranteeing that the optimal solution still be found.

The third track of MADYNE continues to look after models of relationship between enterprises seen from business process management perspective. This track aims to promote concepts, solutions, and approaches for automating dynamic management, interoperability and integration of networked collaborative enterprise applications. Several models and technologies are being developed and deployed to consolidate system integration of networked collaborative enterprises which evolve in dynamic environments. The selected papers present reviews and analysis of existing and ongoing solutions for the challenging problem of management of dynamic enterprises.

With the proliferation of data, components and services on the internet, cyber-physical systems are growing up these last years. Machine-to-Machine (M2M) is an example of a cyber-physical system where mobile communication is enabled between sensors, gateways and application services. M2M is used in several domains and in particular, in critical ones such as the healthcare domain. In such domain, requirements in term of Quality of Service (QoS) and particularly time related requirements in mobile environments must be rigorously respected. It is important to define an approach to ensure and validate these systems against these requirements. In this paper, we are interested in Publish/ Subscribe M2M communication based model. Our goal is to define a formal approach that aims at designing and validating M2M systems where we consider M2M mobile sensors and time related requirements. We define a graph based model to characterize Publish/ Subscribe M2M systems and model checking mechanisms to enable verification techniques.

Business-to-business (B2B) e-commerce market is expected to expand rapidly in coming years. In this context, organizations tend to rely more on business process management (BPM) to streamline their operations. The business process field is influenced by a wide range of temporal constraints which rise from legal, regulatory, and managerial rules. One of the most promising standards for business process modeling, namely the Business process Model and notation BPMN poorly addresses the time dimension so far. In this paper, we elaborate an extension to BPMN 2.0 to handle the time dimension. The aim of this BPMN extensions is to support business analysts and modellers in easily including the needed temporal constraints in their processes. We motivate and justify our proposed extensions by means of illustrative case studies. Furthermore, based on the proposed extensions, a verification approach based on the model checking technique is used to diagnose potential temporal violations of the process model. The work presented in this paper sets foundation for later automation of these constraints through process execution engines.

In this paper, we propose an approach for analyzing and validating a composition of services with respect to real time properties. We consider services defined using an extension of the Business Process Execution Language (BPEL) where timing constraints can be associated to the execution of an act

Web services are the main pillar of the Service Oriented Computing (SOC) paradigm which enables the application integration within and across business organizations. One of the important features of the Web services is the choreography aspect which allows to capture collaborative processes involving multiple services. In this context, one of the important investigations is the choreography compatibility analysis. We mean by the choreography compatibility the capability of a set of Web services of actually interacting by exchanging messages in a proper manner. Whether a set of services are compatible depends not only on their sequences of messages but also on quantitative properties such as timed properties. In this paper, we investigate a model checking based approach that deals with checking the compatibility of a choreography in which the Web services support asynchronous timed communications. Particularly, in this paper we are using the model checker UPPAAL. We propose a set of required abstractions that allow to use the model checker UPPAAL to deal with timed asynchronous communicating services.

Web service composition enables businesses to compile value-added services from elementary ones to build new complex services. Usually, Web service composition is needed when a client request cannot be fulfilled by one elementary service. In this paper, we propose a client data flow-tailored composition. The client request is defined by the sequences of data flow the client can provide and the sequences of data flow the client claims. Then, according to the client request, by defining the set of the available services, we aim at combining the services with the client request so that this later is satisfied.

Web services are becoming one of the main technologiesfor designing and building complex inter-enterprise businessapplications. Usually, a business application cannot be fulfilled by one Web service but by a combination of severalones. Hence, there is an obvious need for mechanisms allowing Web services composition. In this paper, we are interested in the automatic composition of Web services. Ourcomposition framework is based on the coordination of Webservices having the capability to communicate via the exchange of messages. Web services are modeled as conversational automata, where transitions are possibly guarded according to the values of exchanged or produced data. If the coordination does not satisfy the business application, we synthesize a new service called mediator. The mediator aims at generating the missing messages which are required to complete the cartesian product so that it mimics the goal service representing the business application to implement.

Business protocols are becoming a necessary part ofWeb services description [4]. The work presented in [4] investigates mechanisms for analyzing the compatibility and the substitution (i.e., replaceability) of Web services based on their functional properties. In this paper, we focus on the replaceability analysis.Whether a service can replace another depends not only on their functional properties but also on non functional requirements (e.g., privacy policies). We propose a privacy-aware protocol replaceability approach to extend the work presented in [4] by privacy properties. We introduce a rule-based privacy model and we extend business protocols, leading to what we call private business protocols. Finally, a private replaceability analysis of private business protocols is discussed. We mainly investigate compatibility issues, that is whether one private business protocol can support the same set of conversations with respect to the privacy requirements.