This paper explores the realization of robotic motion planning, especially Findpath problem, which is a basic motion planning problem that arises in the development of robotics. Findpath means: Give the initial and desired final configurations of a robotic arm in 3-dimensionnl space, and give descriptions of the obstacles in the space, determine whether there is a continuous collision-free motion of the robotic arm from one configure- tion to the other and find such a motion if it exists. There are several …

This is a sequel of [1] to give a temporal semantics to a full version of CSP, including hiding operator and nested parallelism. The semantic definition is of denotational style, and employs set of temporal formulas as denotations. The continuity is proved, when the hiding operator is restricted to channels only with finite possible messages.

A Linear Feedback Shift Register (LFSR)can be used to compress test response data as a Signature Analyzer(SA). Parallel Signature Analyzers (PSAs) implemented as multiple input LFSRs are faster and re- quire less hardware overhead than Serial Signature Analyzers (SSAs)for compacting test response data for Built-In Serf-Test (BIST)in IC or hoard-testing environments. However, the SAs are prone to aliasing errors because of some specific types of error patterns. An alias is a faulty output signature that is i…

Given a hypergraph, this paper provides three algorithms for finding all its minimal cutsets, minimal link cutsets and the least cutsets. The result not only set up a new studying field on cutsets of hypergraph, but also lay a foundation of analyzing the performance of multibus systems. The algorithm for determining all the least cutsets in a hypergraph is polynomial complex and more efficient than that in [2].

This paper presents the design and implementation of a message-based distributed operating system kernel NDOS. The main purpose of the kernel is to support a distributed data processing system and a distributed DBMS. It uses the abstraction of communication between processes as basic mechanism. In NDOS, services and facilities such as message passing and process synchronization, which are related to IPC and may cause the change of the state of a process, are integrated into a single concept, an event. The i…

A distribution theory of the roots of a polynomial and a parallel algorithm for finding roots of a complex polynomial based on that theory are developed in this paper. With high parallelism, the algorithm is an im- provement over the Wilf algorithm.

The development of a formal semantics for a given programming language can proceed in several stages. At each stage we give an alternative semantic definition of the language, and each definition embodies successively more and more implementation details. Then we formulate and prove at each stage the congruence conditions between successive definitions in the sequence. This paper presents two formal semantics for Prolog with “cut” and shows the congruence condition between them.

Based on the first order predicate logic, in this paper, we present a new approach to generalizing the syn- tax of ordinary Horn clause rules to establish a fuzzy proof theory. First of all, each Horn clause rule is associ- ated with a numerical implication strength f. Therefore we obtain f-Horn clause rules. Secondly, Herbrand in- terpretations can be generalized to fuzzy subsets of the Herbrand base in the sense of Zadeh. As a result the proof theory for Horn clause rules can be developed in much the same…