Algorithm for representing component connectivity

Excavating

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

371 151, 395916, G01R 3128

Patent

active

051877856

ABSTRACT:
The present invention, in one embodiment, is a method for representing component connectivity of components which compose a system. The method comprises the steps of creating a diagram composed of blocks representing components of the system, representing connectivity of the components on the diagram, selected a first start component, assigning a first label to the start component, identifying respective children components of the start component, assigning the respective children components of start component respective labels, the respective labels being unique for each component and representing the component connectivity, selecting another start component if any components in the diagram are unlabelled, and then repeating the above steps for the second start component. The process is repeated until the components and component connectivity are represented in a respective label. The assigned component labels are then stored.

REFERENCES:
patent: 4821211 (1989-04-01), Torres
patent: 4835709 (1989-05-01), Tsai
patent: 4953106 (1990-08-01), Gansner et al.
patent: 4964125 (1990-10-01), Kim
Cantone et al., "IN-ATM.TM.: Fault Diagnosis as Expert System Guided Search", paper to appear in Computer Expert Systems, L. Boleand, M. J. Coombs (eds.), Springer-Verlag, Heidelberg, 1987.
Pipitone, "The FIS Electronics Troubleshooting System", Computer 19 (1986) pp. 120-128.
Ben-Bassat et al., "AI-Test A Real Life Expert System for Electronic Trouble-Shooting (A Description and a Case Study)". Proceedings of the Fourth Conference on Artificial Intelligence Applications, San Diego, 1987, pp. 2-10.
de Kleer et al., "Diagnosing Multiple Faults", Artificial Intelligence, 32 (1987) 97-130.
Tong et al., "Diagnosing An Analog Feedback System Using Model-Based Reasoning", to appear in Proceeding of the 1989 AI Systems in Government Conference, Washington, D.C.
Sussman et al., "Constraints-A Language for Expressing Almost-Hierarchical Descriptions", Artificial Intelligence, vol. 14, (1980) pp. 1-39.
"An Algorithm For Identifying Tests To Perform For Fault Isolation" by R. P. Shah is being filed concurrently herewith.
"An Algorithm For Fault Isolation" by R. P. Shah et al. is being filed concurrently herewith.
"An Algorithm for Identifying Highly Suspect Components in Fault Isolation" by R. P. Shah is being filed concurrently herewith.
"An Algorithm For Identifying Components of a Loop/String" by R. P. Shah is being concurrently herewith.
"Method and System for Delineation of Structure and Linkages Between Knowledge Base Modules" by R. P. Shah.
Declaration of Rasiklal P. Shah dated Nov. 14, 1990.
"Constraint Propagation Control" by David W-S Tong et al.
"Method and Apparatus for Generation of Multi-Branched Diagnostic Trees" by David W-S Tong et al.
Wulf, W., "Reliable Hardware/Software Architecture", IEEE Transactions on Software Engineering, vol. SE-1, No. 2, Jun. 1975, pp. 233-240.
DePree, R., "Pattern Recognition in Software Engineering", Computer, May 1983, pp. 48-53.
Cantone, R. et al., "Model-Based Probabilistic Reasoning for Electronics Troubleshooting", Proc. Eighth Int'l. Joint Conf. on Artificial Intelligence, Aug. 1983, pp. 207-211.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Algorithm for representing component connectivity does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Algorithm for representing component connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithm for representing component connectivity will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2154069

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.