Electrical computers and digital data processing systems: input/ – Intrasystem connection
Reexamination Certificate
2006-11-14
2006-11-14
Cottingham, John R. (Department: 2111)
Electrical computers and digital data processing systems: input/
Intrasystem connection
C710S305000, C710S315000, C716S030000
Reexamination Certificate
active
07136947
ABSTRACT:
A system and method for enabling Intellectual Property (IP) Blocks to be reused at a system level. The present invention represents the IP blocks as blocks that exchange messages without needing to represent the functionality of the IP blocks. The implementations of these IP blocks exchanges messages through complex signaling protocols. In conventional systems, interfacing between IP blocks that use different signaling protocols is a tedious and error prone design task. The present invention uses regular expression based protocol descriptions to show how to map the message onto a signaling protocol. Given two protocols, the present invention builds an interface machine that automatically labels data referenced by all protocols. The present invention is capable of generating the interface even when the data sequencing of the two protocols differs.
REFERENCES:
patent: 5327544 (1994-07-01), Lee et al.
patent: 5450598 (1995-09-01), Kaplan et al.
patent: 5663666 (1997-09-01), Chu et al.
patent: 5680552 (1997-10-01), Netravali et al.
patent: 5845107 (1998-12-01), Fisch et al.
patent: 5862251 (1999-01-01), Al-Karmi et al.
patent: 6018736 (2000-01-01), Gilai et al.
patent: 6223274 (2001-04-01), Catthoor et al.
patent: 6308147 (2001-10-01), Keaveny
patent: 6715107 (2004-03-01), Beer et al.
Chapman, Matt, The Finite State Machine Explorer, 1996, htp://www.belgarath, demon.co.uk/java/fsme.html.
National Institute of Standards and Technology (NIST), http://www.nist.gov.
Network Innovation Laboratories, Register Transfer Level Design, 1998, http://www.onlab
tt.co.jp/member/imlig/sem98/tuthtm
ode6.htm.
H.H.Ehrenburg and H.A.N. van Maanen, A finite Automaton learning system using genetic programming, 1994, CWI Centrum Voor Wiskunde en Informatica Report Rapport.
Jerry M. Rosenberg, Computers, Information Processing & Telecommunications, 1983, John Wiley & Sons, Inc. 2nd Ed., p. 480.
Andrew S Tanenbaum, Structured Computer Organization, 1990, Prentice-Hall, Inc., 3rd Ed., pp. 11-13.
Young, James Shin, Synchronization of Java Threads Using Rendezvous, 1997, http://www-cad.eecs.berkeley.edu/˜jimy/java/rendezvous.
Cohen, Daniel I.A., Introduction to Computer Theory, 1997, John Wiley & Sons, 2nd Edition, chapter 6.
Marc Bumble, Lee Coraor, Architecture for a Non-Deterministic Simulation Machine, 1998, Computer Science and Engineering, The Pennsylvania State University, p. 1600.
T. Funkhouser, COS 126 lecture: Formal Languages, Spring 1999, http://www.cs.princeton.edu/courses/archive/spr99/cs126/comments/16homsky.html.
Morris Mano, “Computer System Architecture”, 1982, Prentice-Hall, Inc., 2ndEd., pp. 440-441.
Wikipedia, “Finite State Machine”, Wikipedia, http://www.fact-index.com/f/fi/finite—state—machine.html.
Lam, S.S., “Protocol Conversion”, Mar. 1988, Software Engineering, IEEE Transactions on , vol. 14 , Issue: 3 , pp. 353-362.
Yao, Y.-W.; Chen, W.-S.; Liu, M.T.; “A Modular approach to constructing Protocol Converters”, Jun. 1990, INFOCOM '90. Ninth Annual Joint Conference of the IEEE Computer and Communication Societies, pp. 572-579.
Ville Laurikari, “NFAs with Tagged Transitions, their Conversions to Deterministic Automata and Application to Regular Expressions”, 2000, IEEE, SPIRE 2000, Proceedings. international Symposium on Sep. 27-29, 2000 pp. 181-187.
Stephen A Fenner et al., “Inverting Onto Functions”, 1996, IEEE, 11th Annual IEEE Conferrence, May 24-27, 1996, pp. 213-222.
Answer.Com, definitions for “nondeterministic finite state machine” and “IP block”.
Wikipedia, definition for “Finite State Machine”.
Aho, A. V. et al. “Compilers Principles, Techniques and Tools,”Addison-Wesley, pp. 83, 94-98, 107, 113, 121-125, 129, 135-141, 148, 172-173, 268-269, Reading, MA, 1988.
Akella, J. et al. “Synthesizing converters between finite state protocols,”Proceedings of the International Conference on Computer Design, pp. 410-413, Cambridge, MA, Oct. 15-15, 1991.
Alfaro, L., et al. “Interface Theories for Component-based Design,” University of California, Santa Cruz,University of California, Berkeley, (EMSOFT), 2001 (19 pp).
Alfaro, L., et al. “Interface Automata,”Dept. of Electrical Engineering and Computer Sciences, University of California, Berkeley, (FSE), 2001 (17 pp).
Borriello, G. “A new Interface Specification Methodology and its Applications to Transducer Synthesis,”Ph.D. thesis, University of California at Berkeley, pp. 116-136, Berkeley, CA, 1988.
Borriello, G. et al. “Synthesis and optimization of interface transducer logic,”Proceedings of the International Conference on Computer Aided Design, pp. 274-277, Nov. 1987.
Brzozowski, J. A.. “Derivatives of regular expressions,”Journal of the Association for Computing Machinery, 11(4): pp. 481-494, Oct. 1964.
Burch, J.R., et al. “Modeling Hierarchical Combinational Circuits”IEEE1063-6757/93pp. 612-617 1993.
Coelho, C. N. et al. “Analysis and synthesis of concurrent digital circuits using control-flow expressions,”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,15(8): pp. 854-876, Aug. 1996.
Filo, D. et al. “Interface Optimization for Concurrent Systems Under Timing Constraints,”1 IEEE Transactions on VLSI Systems, pp. 172-185 (Sep. 1993).
Hopcroft, J. E. et al. “Introduction to Automata Theory, Languages, and Computation,”Addison Wesley, pp. 19-46, 217-220, 250-253, Reading, MA, 1986.
Narayan, S. et al. “Interfacing Incompatible protocols using interface process generation,”Proceedings of the 32ndDesign Automation Conference, pp. 468-473, San Francisco, CA, Jun. 12-16, 1995.
Öberg, J. et al. “Grammar-based hardware synthesis of data communication protocols,”Proceedings of the 9thInternational Symposium on System Synthesis, pp. 14-19, La Jolla, CA, Nov. 5-8, 1996.
Passerone, R. “Automatic Synthesis of Interfaces between Incompatible Protocols,” M.S. Thesis, University of California at Berkeley, 1997.
Passerone, R., et al. “Convertibility Verification and Converter Synthesis: Two Faces of the Same Coin,” Cadence Berkeley Laboratories; University of California, Santa Cruz; University of California, Berkeley. 2002.
Rowson, J. A. et al. “Interface-based design,”Proceedings of the 34thDesign Automation Conference, pp. 178-183, Anaheim, CA, Jun. 9-13, 1997.
Seawright, A. et al. “Clairvoyant: A synthesis system for production-based specification,”IEEE Transactions on VLSI Systems, 2: pp. 172-185, Jun. 1994.
Sun, J. S. et al. “Design of system interface modules,”Proceedings of International Conference on Computer Aided Design, pp. 478-481, 1992.
Passerone Roberto
Rowson James A.
Sangiovanni-Vincentelli Alberto
Cottingham John R.
King Justin
LandOfFree
System and method for automatically synthesizing interfaces... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for automatically synthesizing interfaces..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for automatically synthesizing interfaces... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3665450