Schedulability analysis of timed CSP models using the PAT model checker

Timed CSP can be used to model and analyse real-time and concurrent behaviour of embedded control systems. Practical CSP implementations combine the CSP model of a real-time control system with prioritized scheduling to achieve efficient and orderly use of limited resources. Schedulability analysis of a timed CSP model of a system with respect to a scheduling scheme and a particular execution platform is important to ensure that the system design satisfies its timing requirements. In this paper, we propose a framework to analyse schedulability of CSP-based designs for non-preemptive fixed-priority multiprocessor scheduling. The framework is based on the PAT model checker and the analysis is done with dense-time model checking on timed CSP models. We also provide a schedulability analysis workflow to construct and analyse, using the proposed framework, a timed CSP model with scheduling from an initial untimed CSP model without scheduling. We demonstrate our schedulability analysis workflow on a case study of control software design for a mobile robot. The proposed approach provides non-pessimistic schedulability results

Autonomous service composition in symbiotic networks

Part 2: PhD Workshop: Autonomic Network and Service ManagementInternational audienceTo cope with the ever-growing number of wired and wireless networks, we introduce the notion of so-called symbiotic networks. These networks seamlessly operate across layers and over network boundaries, resulting in improved scalability, dependability, and energy efficiency. This particular Ph.D. research focuses on software services operating in such symbiotic networks. When two or more networks merge, the services provided on them may be combined into a service composition that is much more than the sum of its parts. Driven by two distinct use cases, we aim to enable fully autonomous service composition and resource provisioning. For the first use case, an in-building over-the-top service platform, we describe a software architecture and a set of generic resource provisioning algorithms. The second use case, which focuses on wireless body area networks, will allow us to expand our research domain into highly dynamic symbiotic network environments, where services appear and disappear more frequently

Evaluation of Kermeta for Solving Graph-based Problems

Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper,\ud we show that Kermeta is relatively suitable for solving three graph-based\ud problems. First, Kermeta allows the specification of generic model\ud transformations such as refactorings that we apply to different metamodels\ud including Ecore, Java, and Uml. Second, we demonstrate the extensibility\ud of Kermeta to the formal language Alloy using an inter-language model\ud transformation. Kermeta uses Alloy to generate recommendations for\ud completing partially specified models. Third, we show that the Kermeta\ud compiler achieves better execution time and memory performance compared\ud to similar graph-based approaches using a common case study. The\ud three solutions proposed for those graph-based problems and their\ud evaluation with Kermeta according to the criteria of genericity,\ud extensibility, and performance are the main contribution of the paper.\ud Another contribution is the comparison of these solutions with those\ud proposed by other graph-based tools