860 research outputs found
Comprehension of spacecraft telemetry using hierarchical specifications of behavior ⋆
Abstract. A key challenge in operating remote spacecraft is that ground operators must rely on the limited visibility available through spacecraft telemetry in order to assess spacecraft health and operational status. We describe a tool for processing spacecraft telemetry that allows ground operators to impose structure on received telemetry in order to achieve a better comprehension of system state. A key element of our approach is the design of a domain-specific language that allows operators to express models of expected system behavior using partial specifications. The language allows behavior specifications with data fields, similar to other recent runtime verification systems. What is notable about our approach is the ability to develop hierarchical specifications of behavior. The language is implemented as an internal DSL in the Scala programming language that synthesizes rules from patterns of specification behavior. The rules are automatically applied to received telemetry and the inferred behaviors are available to ground operators using a visualization interface that makes it easier to understand and track spacecraft state. We describe initial results from applying our tool to telemetry received from the Curiosity rover currently roving the surface of Mars, where the visualizations are being used to trend subsystem behaviors, in order to identify potential problems before they happen. However, the technology is completely general and can be applied to any system that generates telemetry such as event logs.
Land for Maine’s Future Program: Increasing the Return on a Sound Public Investment
An assessment of the Land for Maine\u27s Future Program prepared by the New England Environmental Finance Center at USM’s Muskie School of Public Service and the Margaret Chase Smith Center for Public Policy at the University of Maine to engage with them in an assessment of the LMF in 2003
Runtime verification of parametric properties using SMEDL
Parametric properties are typical properties to be checked in runtime verification (RV). As a common technique for parametric monitoring, trace slicing divides an execution trace into a set of sub traces which are checked against non-parametric base properties. An efficient trace slicing algorithm is implemented in MOP. Another RV technique, QEA further allows for nested use of universal and existential quantification over parameters. In this paper, we present a methodology for parametric monitoring using the RV framework SMEDL. Trace slicing algorithm in MOP can be expressed by execution of a set of SMEDL monitors. Moreover, the semantics of nested quantifiers is encoded by a hierarchy of monitors for aggregating verdicts of sub traces. Through case studies, we demonstrate that SMEDL provides a natural way to monitor parametric properties with more potentials for flexible deployment and optimizations
An inexpensive economical solar heating system for homes
A low-cost solar home heating system to supplement existing warm-air heating systems is described. The report is written in three parts: (1) a brief background on solar heating, (2) experience with a demonstration system, and (3) information for the homeowner who wishes to construct such a system. Instructions are given for a solar heating installation in which the homeowner supplies all labor necessary to install off-the-shelf components estimated to cost $2,000. These components, which include solar collector, heat exchanger, water pump, storage tank, piping, and controls to make the system completely automatic, are available at local lumber yards, hardware stores, and plumbing supply stores, and are relatively simple to install. Manufacturers and prices of each component used and a rough cost analysis based on these prices are included. This report also gives performance data obtained from a demonstration system which was built and tested at the Langley Research Center
Runtime Verification of Temporal Properties over Out-of-order Data Streams
We present a monitoring approach for verifying systems at runtime. Our
approach targets systems whose components communicate with the monitors over
unreliable channels, where messages can be delayed or lost. In contrast to
prior works, whose property specification languages are limited to
propositional temporal logics, our approach handles an extension of the
real-time logic MTL with freeze quantifiers for reasoning about data values. We
present its underlying theory based on a new three-valued semantics that is
well suited to soundly and completely reason online about event streams in the
presence of message delay or loss. We also evaluate our approach
experimentally. Our prototype implementation processes hundreds of events per
second in settings where messages are received out of order.Comment: long version of the CAV 2017 pape
An updated assessment of indigenous cover remaining and legal protection in New Zealand’s land environments
FWN – Publicaties zonder aanstelling Universiteit Leide
Ex vivo expansion and differentiation of erythroblasts: From culture dishes to stirred tank reactors for the production of red blood cells
Please click Additional Files below to see the full abstract
Runtime Verification of Temporal Patterns for Dynamic Reconfigurations of Components
International audienceDynamic reconfigurations increase the availability and the reliability of component-based systems by allowing their architectures to evolve at runtime. Recently we have proposed a temporal pattern logic, called FTPL, to characterize the correct reconfigurations of component-based systems under some temporal and architectural constraints. As component-based architectures evolve at runtime, there is a need to check these FTPL constraints on the fly, even if only a partial information is expected. Firstly, given a generic component-based model, we review FTPL from a runtime verification point of view. To this end we introduce a new four-valued logic, called RV-FTPL (Runtime Verification for FTPL), characterizing the "potential" (un)satisfiability of the architectural constraints in addition to the basic FTPL semantics. Potential true and potential false values are chosen whenever an observed behaviour has not yet lead to a violation or satisfiability of the property under consideration. Secondly, we present a prototype developed to check at runtime the satisfiability of RV-FTPL formulas when reconfiguring a Fractal component-based system. The feasability of a runtime property enforcement is also shown. It consists in supervising on the fly the reconfiguration execution against desired RV-FTPL properties. The main contributions are illustrated on the example of a HTTP server architecture
- …