there have been many researches on object grasping in cooperating systems assuming no object slippage and stable grasp and the control system is designed to keep the contact force inside the friction cone to prevent the slippage. however undesired slippage can occur due to environmental conditions and many other reasons. in this research, dynamic analysis and control synthesis of a cooperating ...

We consider bidirectional cooperating distributed (BCD) grammar systems in the sense of Asveld. Independently of their mode , , =, , or t, BCD grammar systems with two components characterize the re-cursively enumerable languages even with right-linear rules and without-productions. This sharply contrasts earlier results on solely generating or accepting grammars, where right-linear rules alway...

An architecture and a procedure for communicating scheduling expert systems based on fuzzy set theory is proposed. Fuzzy sets are used to express and to exchange constraints and their potential relaxation with the cooperating scheduling system that can interpret these constraints. The procedure is intended to optimize the global evaluation among the communicating systems. An example from steel ...

Performing computation using networks of workstations is increasingly becoming an alternative to using a supercomputer This approach is motivated by the vast quantities of un used idle time available in workstation networks Unlike computing on a tightly coupled parallel computer where a xed number of processor nodes is used within a computation the number of usable nodes in a workstation networ...

The reachability problem in cooperating systems is known to be PSPACE-complete. We show here that this problem remains PSPACE-complete when we restrict the communication structure between the subsystems in various ways. For this purpose we introduce two basic and incomparable subclasses of cooperating systems that occur often in practice and provide respective reductions. The subclasses we cons...

MetiTarski, an automatic theorem prover for real-valued special functions, is briefly introduced. Its architecture is sketched, with a focus on the arithmetic reasoning systems that it invokes. Finally, the paper describes some applications where MetiTarski is itself invoked by other tools.

Subclasses of grammar systems that can facilitate parser construction appear to be of interest. In this paper, some syntactical conditions considered for strict deterministic grammars are extended to cooperating distributed grammar systems, restricted to the terminal derivation mode. Two variants are considered according to the level to which the conditions address. The local variant, which int...