Automated Synthesis of Distributed Self-Stabilizing Protocols

In this paper, we introduce an SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and network topology. Unlike existing approaches, where synthesis algorithms require the explicit description of the set of legitimate states, our technique only needs the temporal behavior of the protocol. We extend our approach to synthesize ideal-stabilizing protocols, where every state is legitimate. We also extend our technique to synthesize monotonic-stabilizing protocols, where during recovery, each process can execute an most once one action. Our proposed methods are fully implemented and we report successful synthesis of well-known protocols such as Dijkstra's token ring, a self-stabilizing version of Raymond's mutual exclusion algorithm, ideal-stabilizing leader election and local mutual exclusion, as well as monotonic-stabilizing maximal independent set and distributed Grundy coloring

Verification and Synthesis of Symmetric Uni-Rings for Leads-To Properties

This paper investigates the verification and synthesis of parameterized protocols that satisfy leadsto properties $R \leadsto Q$ on symmetric unidirectional rings (a.k.a. uni-rings) of deterministic and constant-space processes under no fairness and interleaving semantics, where $R$ and $Q$ are global state predicates. First, we show that verifying $R \leadsto Q$ for parameterized protocols on symmetric uni-rings is undecidable, even for deterministic and constant-space processes, and conjunctive state predicates. Then, we show that surprisingly synthesizing symmetric uni-ring protocols that satisfy $R \leadsto Q$ is actually decidable. We identify necessary and sufficient conditions for the decidability of synthesis based on which we devise a sound and complete polynomial-time algorithm that takes the predicates $R$ and $Q$, and automatically generates a parameterized protocol that satisfies $R \leadsto Q$ for unbounded (but finite) ring sizes. Moreover, we present some decidability results for cases where leadsto is required from multiple distinct $R$ predicates to different $Q$ predicates. To demonstrate the practicality of our synthesis method, we synthesize some parameterized protocols, including agreement and parity protocols

Industry workshop on large space structures: Executive summary

A NASA-sponsored Industry Workshop on Large Space Structures was convened at Langley Research Center on 24-26 February 1976. A number of structures specialists from seven major aerospace companies participated. Predictions about the future structures to be fabricated/assembled/erected in space are presented along with a composite appraisal of what the Aerospace Industry views as the critical structural technology developments needed to support NASA space missions in the 1985-2000 time frame

RS Landers: Lunar lander

The future of the U.S. space program outlined by President Bush calls for a permanently manned lunar base. A payload delivery system will be required to support the buildup and operation of that lunar base. In response to this goal, RS Landers developed a conceptual design of a self-unloading, unmanned, reusable lunar lander. The lander will deliver a 7000-kg payload, with the same dimensions as a space station logistics module, from low lunar orbit (LLO) to any location on the surface of the Moon

2020 NASA Technology Taxonomy: 2015 Technology Areas to 2020 Taxonomy Areas Crosswalk

To help users of the 2020 Taxonomy navigate changes from the 2015 Technology Area Breakdown Structure (TABS), this companion document provides a crosswalk between the 2015 Technology Areas (TAs) and the updated 2020 Taxonomy areas (TXs)

Index to NASA Tech Briefs, 1975

This index contains abstracts and four indexes--subject, personal author, originating Center, and Tech Brief number--for 1975 Tech Briefs

Index to 1984 NASA Tech Briefs, volume 9, numbers 1-4

Short announcements of new technology derived from the R&D activities of NASA are presented. These briefs emphasize information considered likely to be transferrable across industrial, regional, or disciplinary lines and are issued to encourage commercial application. This index for 1984 Tech B Briefs contains abstracts and four indexes: subject, personal author, originating center, and Tech Brief Number. The following areas are covered: electronic components and circuits, electronic systems, physical sciences, materials, life sciences, mechanics, machinery, fabrication technology, and mathematics and information sciences

A menu of self-administered microcomputer-based neurotoxicology tests

This study examined the feasibility of repeated self-administration of a newly developed battery of mental acuity tests. Researchers developed this battery to be used to screen the fitness for duty of persons in at-risk occupations (astronauts, race car drivers), or those who may be exposed to environmental stress, toxic agents, or disease. The menu under study contained cognitive and motor tests implemented on a portable microcomputer including: a five-test core battery, lasting six minutes, which had demonstrable reliabilities and stability from several previous repeated-measures studies, and also 13 new tests, lasting 42 minutes, which had appeared in other batteries but had not yet been evaluated for repeated-measures implementation in this medium. Sixteen subjects self-administered the battery over 10 repeated sessions. The hardware performed well throughout the study and the tests appeared to be easily self-administered. Stabilities and reliabilities of the test from the core battery were comparable to those obtained previously under more controlled experimental conditions. Analyses of metric properties of the remaining 13 tests produced eight additional tests with satisfactory properties. Although the average retest reliability was high, cross-correlations between tests were low, indicating factorial richness. The menu can be used to form batteries of flexible total testing time which are likely to tap different mental processes and functions

Localization in Unstructured Environments: Towards Autonomous Robots in Forests with Delaunay Triangulation

Autonomous harvesting and transportation is a long-term goal of the forest industry. One of the main challenges is the accurate localization of both vehicles and trees in a forest. Forests are unstructured environments where it is difficult to find a group of significant landmarks for current fast feature-based place recognition algorithms. This paper proposes a novel approach where local observations are matched to a general tree map using the Delaunay triangularization as the representation format. Instead of point cloud based matching methods, we utilize a topology-based method. First, tree trunk positions are registered at a prior run done by a forest harvester. Second, the resulting map is Delaunay triangularized. Third, a local submap of the autonomous robot is registered, triangularized and matched using triangular similarity maximization to estimate the position of the robot. We test our method on a dataset accumulated from a forestry site at Lieksa, Finland. A total length of 2100\,m of harvester path was recorded by an industrial harvester with a 3D laser scanner and a geolocation unit fixed to the frame. Our experiments show a 12\,cm s.t.d. in the location accuracy and with real-time data processing for speeds not exceeding 0.5\,m/s. The accuracy and speed limit is realistic during forest operations