Abstract
The objective of the Arrowhead Framework is to efficiently support the development, deployment and operation of interconnected, cooperative systems. It is based on the Service Oriented Architecture philosophy. The building elements of the framework are systems that provide and consume services, and cooperate as systems of systems. Some commonly used systems, such as orchestration, authorization or service registry are considered as core. These can be used by any system of systems that follow the guidelines of the Arrowhead Framework. Within the framework, systems - using different information exchange technologies during collaboration - are helped through various approaches. These include the so-called Interoperability Layer, as well as systems and services for translation. Furthermore, one of the main problems of developing such highly interoperable systems is the lack of understanding between various development groups. Adequate development and service documentation methodologies can help to overcome this issue. The design, development and verification methodology for each service, system and system of systems within the Arrowhead Framework supports that these can be implemented, verified, deployed, and run in an interoperable way. This paper presents an overview of the framework together with its core elements - and provides guidelines for the design and deployment of interoperable, Arrowhead-compliant cooperative systems.

Abstract
Several methods have been proposed for performing schedulability analysis for both uni-processor and multi-processor real-time systems. Very few of these works use the power of formal logic to write unambiguous specifications and to allow the usage of theorem provers for building the proofs of interest with greater correctness guarantees. In this paper we address this challenge by: 1) defining a formal language that allows to specify periodic resource models; 2) describe a transformational approach to reasoning about timing properties of resource models by transforming the latter specifications into a satisfiability modulo theories problem.

Abstract

Abstract
Nowadays, the prevalence of computing systems in our lives is so ubiquitous that it would not be far-fetched to state that we live in a cyber-physical world dominated by computer systems. These systems demand for more and more computational performance to process large amounts of data from multiple data sources, some of them with guaranteed processing response times. In other words, systems are required to deliver their results within pre-defined (and sometimes extremely short) time bounds. Examples can be found for instance in intelligent transportation systems for fuel consumption reduction in cities or railway, or autonomous driving of vehicles. To cope with such performance requirements, chip designers produced chips with dozens or hundreds of cores, interconnected with complex networks on chip. Unfortunately, the parallelization of the computing activities brings many challenges, among which how to provide timing guarantees, as the timing behaviour of the system running within a many-core processor depends on interactions on shared resources that are most of the time not know by the system designer. P-SOCRATES (Parallel Software Framework for Time-Critical Many-core Systems) is an FP7 European project, which developed a novel methodology to facilitate the deployment of standardized parallel architectures for real-time applications. This methodology was implemented (based on existent models and components) to provide an integrated software development kit, the UpScale SDK, to fully exploit the huge performance opportunities brought by the most advanced many-core processors, whilst ensuring a predictable performance and maintaining (or even reducing) development costs of applications. The presentation will provide an overview of the UpScale SDK, its underlying methodology, and the results of its application on relevant industrial use-cases.

Abstract

Abstract