311 research outputs found

    Step-wise development of resilient ambient campus scenarios

    Get PDF
    This paper puts forward a new approach to developing resilient ambient applications. In its core is a novel rigorous development method supported by a formal theory that enables us to produce a well-structured step-wise design and to ensure disciplined integration of error recovery measures into the resulting implementation. The development method, called AgentB, uses the idea of modelling database to support a coherent development of and reasoning about several model views, including the variable, event, role, agent and protocol views. This helps system developers in separating various modelling concerns and makes it easier for future tool developers to design a toolset supporting this development. Fault tolerance is systematically introduced during the development of various model views. The approach is demonstrated through the development of several application scenarios within an ambient campus case study conducted at Newcastle University (UK) as part of the FP6 RODIN project. © 2009 Springer Berlin Heidelberg

    Developing Topology Discovery in Event-B

    Get PDF
    We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and is the problem of each node in a network discovering and maintaining information on the network topology. One of the key challenges is specifying the problem itself. Our specification includes both safety properties, formalizing invariants that should hold in all system states, and liveness properties that characterize when the system reaches stable states. We establish these by appropriately combining proofs of invariant preservation, event refinement, event convergence, and deadlock freedom. The combination of these features is novel and should be useful for formalizing and developing other kinds of semi-reactive systems, which are systems that react to, but do not modify, their environment

    Event-B Patterns for Specifying Fault-Tolerance in Multi-Agent Interaction

    No full text
    Interaction in a multi-agent system is susceptible to failure. A rigorous development of a multi-agent system must include the treatment of fault-tolerance of agent interactions for the agents to be able to continue to function independently. Patterns can be used to capture fault-tolerance techniques. A set of modelling patterns is presented that specify fault-tolerance in Event-B specifications of multi-agent interactions. The purpose of these patterns is to capture common modelling structures for distributed agent interaction in a form that is re-usable on other related developments. The patterns have been applied to a case study of the contract net interaction protocol

    Refining Nodes and Edges of State Machines

    No full text
    State machines are hierarchical automata that are widely used to structure complex behavioural specifications. We develop two notions of refinement of state machines, node refinement and edge refinement. We compare the two notions by means of examples and argue that, by adopting simple conventions, they can be combined into one method of refinement. In the combined method, node refinement can be used to develop architectural aspects of a model and edge refinement to develop algorithmic aspects. The two notions of refinement are grounded in previous work. Event-B is used as the foundation for our refinement theory and UML-B state machine refinement influences the style of node refinement. Hence we propose a method with direct proof of state machine refinement avoiding the detour via Event-B that is needed by UML-B

    Freshwater plastic pollution:Recognizing research biases and identifying knowledge gaps

    Get PDF
    The overwhelming majority of research conducted to date on plastic pollution (all size fractions) has focused on marine ecosystems. In comparison, only a few studies provide evidence for the presence of plastic debris in freshwater environments. However, owing to the numerous differences between freshwater studies (including studied species and habitats, geographical locations, social and economic contexts, the type of data obtained and also the broad range of purposes), they show only fragments of the overall picture of freshwater plastic pollution. This highlights the lack of a holistic vision and evidences several knowledge gaps and data biases. Through a bibliometric analysis we identified such knowledge gaps, inconsistencies and survey trends of plastic pollution research within freshwater ecosystems. We conclude that there is a continued need to increase the field-data bases about plastics (all size fractions) in freshwater environments. This is particularly important to estimate river plastic emissions to the world´s oceans. Accordingly, data about macroplastics from most polluted and larger rivers are very scarce, although macroplastics represent a huge input in terms of plastics weight. In addition, submerged macroplastics may play an important role in transporting mismanaged plastic waste, however almost no studies exist. Although many of the most plastic polluted rivers are in Asia, only 14% of the reviewed studies were carried out in this continent (even though the major inland fisheries of the world are located in Asia´s rivers). The potential damage caused by macroplastics on a wide range of freshwater fauna is as yet undetermined, even though negative impacts have been well documented in similar marine species. We also noted a clear supremacy of microplastic studies over macroplastic ones, even though there is no reason to assume that freshwater ecosystems remain unaffected by macro-debris. Finally, we recommend focusing monitoring efforts in most polluted rivers worldwide, but particularly in countries with rapid economic development and poor waste management.Fil: Blettler, Martin Cesar Maria. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto Nacional de Limnología. Universidad Nacional del Litoral. Instituto Nacional de Limnología; ArgentinaFil: Abrial, Elie. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto Nacional de Limnología. Universidad Nacional del Litoral. Instituto Nacional de Limnología; ArgentinaFil: Khan, Farhan R.. Roskilde University;Fil: Sivri, Nuket. Istanbul Üniversitesi;Fil: Espínola, Luis Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto Nacional de Limnología. Universidad Nacional del Litoral. Instituto Nacional de Limnología; Argentin

    Towards a method for rigorous development of generic requirements patterns

    No full text
    We present work in progress on a method for the engineering, validation and verification of generic requirements using domain engineering and formal methods. The need to develop a generic requirement set for subsequent system instantiation is complicated by the addition of the high levels of verification demanded by safety-critical domains such as avionics. Our chosen application domain is the failure detection and management function for engine control systems: here generic requirements drive a software product line of target systems. A pilot formal specification and design exercise is undertaken on a small (twosensor) system element. This exercise has a number of aims: to support the domain analysis, to gain a view of appropriate design abstractions, for a B novice to gain experience in the B method and tools, and to evaluate the usability and utility of that method.We also present a prototype method for the production and verification of a generic requirement set in our UML-based formal notation, UML-B, and tooling developed in support. The formal verification both of the structural generic requirement set, and of a particular application, is achieved via translation to the formal specification language, B, using our U2B and ProB tools

    Modular Verification for a Class of PLTL Properties

    No full text
    The verification of dynamic properties of a reactive systems by model-checking leads to a potential combinatorial explosion of the state space that has to be checked. In order to deal with this problem, we define a strategy based on local verifications rather than on a global verification. The idea is to split the system into subsystems called modules, and to verify the properties on each module in separation. We prove for a class of PLTL properties that if a property is satisfied on each module, then it is globally satisfied. We call such properties modular properties. We propose a modular decomposition based on the B refinement process. We present in this paper an usual class of dynamic properties in the shape of G (p -> Q), where `p' is a proposition and `Q' is a simple temporal formula, such as `X q', `F q', or `q U r' (with `q' and `r' being propositions). We prove that these dynamic properties are modular. For these specific patterns, we have exhibited some syntactic conditions of modularity on their corresponding Buchi automata. These conditions define a larger class which contains other patterns such as `G (p -> X (q U r))'. Finally, we show through the example of an industrial Robot that this method is valid in a practical way

    A robust semantics hides fewer errors

    Get PDF
    In this paper we explore how formal models are interpreted and to what degree meaning is captured in the formal semantics and to what degree it remains in the informal interpretation of the semantics. By applying a robust approach to the definition of refinement and semantics, favoured by the event-based community, to state-based theory we are able to move some aspects from the informal interpretation into the formal semantics

    Spherical 3D Isotropic Wavelets

    Full text link
    Future cosmological surveys will provide 3D large scale structure maps with large sky coverage, for which a 3D Spherical Fourier-Bessel (SFB) analysis in spherical coordinates is natural. Wavelets are particularly well-suited to the analysis and denoising of cosmological data, but a spherical 3D isotropic wavelet transform does not currently exist to analyse spherical 3D data. The aim of this paper is to present a new formalism for a spherical 3D isotropic wavelet, i.e. one based on the SFB decomposition of a 3D field and accompany the formalism with a public code to perform wavelet transforms. We describe a new 3D isotropic spherical wavelet decomposition based on the undecimated wavelet transform (UWT) described in Starck et al. 2006. We also present a new fast Discrete Spherical Fourier-Bessel Transform (DSFBT) based on both a discrete Bessel Transform and the HEALPIX angular pixelisation scheme. We test the 3D wavelet transform and as a toy-application, apply a denoising algorithm in wavelet space to the Virgo large box cosmological simulations and find we can successfully remove noise without much loss to the large scale structure. We have described a new spherical 3D isotropic wavelet transform, ideally suited to analyse and denoise future 3D spherical cosmological surveys, which uses a novel Discrete Spherical Fourier-Bessel Transform. We illustrate its potential use for denoising using a toy model. All the algorithms presented in this paper are available for download as a public code called MRS3D at http://jstarck.free.fr/mrs3d.htmlComment: 9 pages + appendices. Public code can be downloaded at http://jstarck.free.fr/mrs3d.html Corrected typos and updated references. Accepted for publication in Astronomy and Astrophysic
    corecore