50documents trouvés
Out-of-order evaluation of timed petri nets for distributed monitoring
O.BALDELLON, M.ROY, J.C.FABRE
TSF
Rapport LAAS N°11612, Novembre 2011, 10p.
Lien : http://hal.archives-ouvertes.fr/hal-00643683/fr/
Diffusable
Plus d'informations
Abstract
Modern embedded systems for safety critical applications, found in planes or cars, are based on real-time distributed networks and require high level of robustness, reliability and adaptability. In order to complement static off-line validation of such systems, this paper introduces a novel approach for on-line verification of behavioral properties expressed as a sub-family of timed Petri nets. We show that, for the subclass of acyclic safe nets, whose expressivity matches real-time systems constraints, it is possible to define a commutative and associative operation on states that enables out-of-order evaluation of the state of the Petri net, and thus a fully distributed evaluation of the behavior of the system under supervision. Additionally, when provided with a mapping between events and nodes of the distributed system, we show how to efficiently distribute the monitoring system on top of the applicative system, and provide algorithms for local evaluation and merging of information in order to detect as soon as possible when the system deviates from its specification.
Architecting resilient computing systems: overall approach and open issues
M.STOICESCU, J.C.FABRE, M.ROY
TSF
Manifestation avec acte : International Workshop on Software Engineering for Resilient Systems (SERENE 2011), Genève (Suisse), 29-30 Septembre 2011, pp.48-62 , N° 11230
Diffusable
125422A simple primary-backup replication design pattern: development in UML and application
P.ANDRE, J.C.FABRE, C.FAYOLLAS, J.GUIOCHET, M.ROY, M.STOICESCU
TSF
Rapport LAAS N°11476, Septembre 2011, 26p.
Diffusable
125276Distributed monitoring of real-time properties: an introduction to abstraction trees
O.BALDELLON, M.ROY
TSF
Rapport LAAS N°11386, Juillet 2011, 7p.
Diffusable
124985The ARUM experimentation platform : an open tool to evaluate mobile systems applications
M.O.KILLIJIAN, M.ROY, G.SEVERAC
TSF, 2I
Manifestation avec acte : International Symposium on Autonomous Minirobots for Research and Edutainment (AMiRE 2011), Bielefeld (Allemagne), 23-25 Mai 2011, 15p. , N° 11804
Lien : http://hal.archives-ouvertes.fr/hal-00667832
Diffusable
Plus d'informations
Abstract
This paper present the ARUM robotic platform. Inspired by the needs of realism in mobile networks simulation, this platform is composed of small mobiles robots using real, but attenuated, Wi-Fi communication interfaces. To reproduce at a laboratory scale mobile systems, robots are moving in an 100 square meters area, tracked by a precise positioning system. In this document we present the rational of such simulation solution, provide its complete description, and show how it can be used for evaluation by briefly explaining how to implement specific algorithms on the computers embedded by the robots. This work is an application of multi-robotics to research, presenting solutions to important problems of multi-robotics.
Towards a system architecture for resilient computing
M.STOICESCU, J.C.FABRE, M.ROY
TSF
Manifestation sans acte : Journée Sécurité des Systèmes & Sureté des Logiciels (3SL), Saint malo (France), 10 Mai 2011, 2p. , N° 11269
Lien : http://hal.archives-ouvertes.fr/hal-00595115/fr/
Diffusable
Plus d'informations
Abstract
Nowadays, systems are not only becoming increasingly complex and heterogeneous but are also opened towards their environment by means of context-awareness. Furthermore, in the vast majority of cases, their specifications periodically evolve, leading to new versions. As resilient systems are expected to continuously provide trustworthy services, they must cope with changes coming from the environment or from the specifications and reconfigure in order to adapt to them. We propose a framework for designing and developing such systems.
Further privacy mechanisms
A.ABOU EL KALAM, C.AGUILAR-MELCHOR, S.BERTHOLD, J.CAMENISCH, S.CLAUSS, Y.DESWARTE, M.KOHLWEISS, A.PANCHENKO, L.PIMENIDIS, M.ROY
IRIT-ENSEEIHT, TSF, DRESDES, IBM Zurich, KU Leuven, RWTH
Ouvrage (contribution) : Digital Privacy. PRIME - Privacy and Identity Management for Europe, N°ISBN 978-3-642-19049-0, Avril 2011, Chapter 18, pp.495-556 , N° 10543
Diffusable
124151Data backup for mobile nodes: a cooperative middleware and an experimentation platform
M.O.KILLIJIAN, M.ROY
TSF
Ouvrage (contribution) : Architecting Dependable Systems VII, N°ISBN 978-3642172441, Janvier 2011, pp.53-73 , N° 10560
Diffusable
123822Early error detection for fault tolerance strategies
T.ROBERT, M.ROY, J.C.FABRE
TSF, LTCI
Manifestation avec acte : International Conference on Real-Time Systems (RTNS 2010), Toulouse (France), 4-5 Décembre 2010, 10p. , N° 10786
Lien : http://hal.archives-ouvertes.fr/hal-00546945/fr/
Diffusable
Plus d'informations
Abstract
Integrated Modular Avionics (IMA) architectures employ a high-integrity, partitioned environment that hosts multiple avionics functions of different criticalities on a shared computing platform. IMA provides benefits of flexibility and scalability and allow for weight savings. However the complexity of the integration process is increased due to the sharing of resources. One of the main problem encountered during the integration process is to find a proper scheme for scheduling avionics functions onto offered processing units while ensuring at the same time execution, resource and safety demands. In this paper, we present a MILP formulation for the scheduling of avionics functions on the resources of an IMA architecture. This mixed integer linear programming formulation takes into account resource constraints as well as temporal constraints related to ensuring a feasible schedule for the strictly periodic avionics functions. The objective function is to maximize the evolution margin for the functions, so that spare resources can be allocated to meet the resource demand growth of the hosted functions.
A framework for proving the self-organization of dynamic systems
E.ANCEAUME, X.DEFAGO, M.POTOP-BUTUCARU, M.ROY
IRISA, JAIST, LIP6-CNRS, TSF
Rapport LAAS N°10746, Décembre 2010, 28p.
Lien : http://hal.archives-ouvertes.fr/inria-00534372/fr/
Diffusable
Plus d'informations
Abstract
This paper aims at providing a rigorous definition of self- organization, one of the most desired properties for dynamic systems (e.g., peer-to-peer systems, sensor networks, cooperative robotics, or ad-hoc networks). We characterize different classes of self-organization through liveness and safety properties that both capture information regarding the system entropy. We illustrate these classes through study cases. The first ones are two representative P2P overlays (CAN and Pastry) and the others are specific implementations of © (the leader oracle) and one-shot query abstractions for dynamic settings. Our study aims at understanding the limits and respective power of existing self-organized protocols and lays the basis of designing robust algorithm for dynamic systems.