Advertisement

Mission Critical Intelligent Systems

  • Tolety Siva Perraju
  • Garimella Uma

Abstract

Our lives have depended on mathematical calculations from time immemorial (e.g. navigation tables) and advances in computational methods and in device technology have led to the applications of the ‘computer’ that pervade our lives. We accomplish a variety of missions with the help of such applications. An application whose correct functioning is critical to the success of a mission, is a mission critical application and the systems (hardware and software) used in running such an application are mission critical systems. An embedded computer system, in a car, controlling the braking function is an example of a mission critical system. The ability of this system to successfully detect adverse road conditions, driver’s braking behavior and apply the brakes is critical to safe driving in harsh environments like a snow storm. Its failure can result in catastrophe. There are many examples of mission critical applications. When we drive they control the engine of our car and traffic signals; when we fly they schedule and monitor the takeoff and landing of our plane and help it fly without crashing with any other plane; when we are sick, they may monitor and regulate our body’s vital functions; and when satellites are launched for space exploration, they monitor the complete mission. Such applications have to deliver valuable services on time.

Keywords

Expert System Multi Agent System Fault Tolerance Intelligent System Task Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Anderson and F. Ygge. Managing large scale computational markets. Technical report, http://www. enersearch.se/ygge.Google Scholar
  2. [2]
    S. Bhattacharya, A. Onama, and F. Bastani. High assurance systems. Communications of the ACM, 40(1): 67, Jan. 1997.CrossRefGoogle Scholar
  3. [3]
    P. R. Cohen, M. Greenberg, D. M. Hart, and A. E. Howe. Trial by fire: Understanding the design requirements for agents in complex environments. AI Magazine, 10(3), 1989.Google Scholar
  4. [4]
    S. E. Conry, R. Meyer, and V. Lesser. Multi stage negotiation protocol in distributed planning. Technical report, University of Massachusetts Amherst, Dec. 1986.Google Scholar
  5. [5]
    P.-J. Courtois. On time and space decomposition of complex structures. Communications of the ACM, 28(6):590–604, 1985.CrossRefGoogle Scholar
  6. [6]
    F. Cristian. Understanding fault-tolerant distributed systems. Communications of the ACM, 34(2):32–40, Feb. 1991.CrossRefGoogle Scholar
  7. [7]
    U. Dayal, B. Blaustien, A. Buchmann, U. Chakravarthy, M. Hsu, R. Ledin, D. McCarthy, A. Rosenthal, S. Sarin, M. J. Carey, M. Linvy, and R. Jauhari. The hipac project: Combining active databases and timing constraints. ACM SIGMOD Record, 17(1):51–70, Mar. 1988.CrossRefGoogle Scholar
  8. [8]
    K. S. Decker, K. Sycara, and M. Williamson. Cloning for intelligent adaptive information agents. In Multi Agent Systems, pages 63–75. Springer Verlag, 1997.Google Scholar
  9. [9]
    Y. Demazeau and J. S. Sichman. Exploiting social reasoning to enhance adaptation in open multi-agent systems. In Proceedings of the International Conference on Multi Agent Systems ICMAS95, 1995.Google Scholar
  10. [10]
    E. H. Durfee, D. L. Kiskis, and W. P. Birmingham. The agent architecture of university of michigan digital library. IEEE Transactions on Software Engineering, 144(1):61–71, 1997.Google Scholar
  11. [11]
    R. J. Ellison, D. A. Fisher, R. C. Linger, H. F. Lipson, T. A. Longstaff, and N. R. Mead. Survivable systems: An emerging discipline. In Proceedings of 11 th Canadian Information Technology Security Symposium, May 1999.Google Scholar
  12. [12]
    S. Fatima. An Adaptive Organizational Policy for Multi-Agent Systems. Ph.D. thesis, Department of Computer and Information Science, University of Hyderabad, India, Dec. 1999.Google Scholar
  13. [13]
    S. Fatima and G. Uma. Trace-an adaptive organization policy for mas. In Proceedings of the Database and Expert Systems Applications (DEXA) Workshop 2000. IEEE CS Press, Sept. 2000.Google Scholar
  14. [14]
    P. Fenelon, J. A. M. Dermid, M. Nicolson, and D. J. Pumfrey. Towards integrated safety analysis and design. ACM SIGAPP Applied Computing Review, 2(1):21–32, Mar. 1994.CrossRefGoogle Scholar
  15. [15]
    FIPA. Fipa abstract architecture specification. Technical report, Foundation of Intelligent Physical Agents, 2002.Google Scholar
  16. [16]
    C. Forgy. Rete: A fast match algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19(1):17–37, 1982.CrossRefGoogle Scholar
  17. [17]
    C. Gu and T. Ishida. Analyzing the social behavior of contract net protocol. In Lecture Notes in Artificial Intelligence, 1038, pages 116–127. Springer Verlag, 1996.Google Scholar
  18. [18]
    A. E. Howe. Improving the reliability of ai systems by analyzing their failure recovery. IEEE Transactions on Knowledge and Data Engineering, 7(1):14–25, 1995.CrossRefGoogle Scholar
  19. [19]
    F. Jakob and P. Suslenschi. Situation assessment in process control. IEEE Expert, 5(2):49–59, Apr. 1990.CrossRefGoogle Scholar
  20. [20]
    J. Bernussou and A. Titli. Complex systems and large scale systems: Associated methods of analysis and control, in interconnected dynamical systems: stability, decomposition and decentralization.Google Scholar
  21. [21]
    O. N. Kumari, G. Uma, and B. E. Prasad. Reasoning with incomplete information in distributed forward chaining systems. In Proceedings of the Eurpoean Conference on Artificial Intelligence (ECAI) Workshop on Distributed AI 94, 1994.Google Scholar
  22. [22]
    O. N. Kumari, G. Uma, and B. E. Prasad. Subproblem allocation in distributed production systems. Journal of the Institution of Electronics and Telecommunication Engineers (IETE), 42(3):117–120, May–June 1996.Google Scholar
  23. [23]
    J. C. Laprie. Dependability: a unifying concept for reliable computing and fault tolerance. In T. Anderson, editor, Dependability of Resilient Cmoputers, pages 1–28. Blackwell Scientific Publications, Oxford UK, 1989.Google Scholar
  24. [24]
    J. C. Laprie. Dependability: basic concepts and terminology. Springer-Verlag, 1991.Google Scholar
  25. [25]
    H. F. Lipson and D. A. Fisher. Survivability—a new technical and business perspective on security. In http://www.cert.org/research.Google Scholar
  26. [26]
    D. P. Miranker. Treat: A better match algorithm for ai production systems. In Proceedings of the 6 th National Conference on Artificial Intelligence AAAI87, pages 42–47. AAAI Press, 1987.Google Scholar
  27. [27]
    N. H. Narayanan and N. Viswahadham. A methodology for acquisition and reasoning in failure analysis of systems. IEEE Transactions on Systems, Man and Cybernetics, 17(2):274–288, 1987.CrossRefGoogle Scholar
  28. [28]
    S. Ohsuga. How can knowledge based systems solve large scale problems? model based decomposition and problem solving. Knowledge based systems, 6(1):38–62, Mar. 1993.CrossRefGoogle Scholar
  29. [29]
    C. Owens. Representing abstract plan failures. In Proceedings of the 12 th Cognitive Science Conference, Boston MA USA, pages 277–284. Cognitive Science Society, 1990.Google Scholar
  30. [30]
    W. A. Perkins and A. Austin. Adding temporal reasoning to expert system building environments. IEEE Expert, 5(1):23–30, Feb. 1990.CrossRefGoogle Scholar
  31. [31]
    T. S. Perraju. Specifying fault tolerance in mission critical intelligent systems. Knowledge based Systems, 14(7):385–396, Nov. 2001.CrossRefGoogle Scholar
  32. [32]
    T. S. Perraju and B. E. Prasad. An algorithm to mantain working memory consistency in multiple rule firing systems. Data and Knowledge Engineering, 32(2):181–198, Feb. 2000.MATHCrossRefGoogle Scholar
  33. [33]
    T. S. Perraju and B. E. Prasad. Interference analysis in multiple rule firing systems. Knowledge based Systems, 13(4):171–176, June 2000.CrossRefGoogle Scholar
  34. [34]
    T. S. Perraju, G. Uma, and B. E. Prasad. A scheme for knowledge representation, verification and reasoning in real time asynchronous production systems. In Proceedings of the IEEE International Conference on Tools with Artificial Intelligence TAI 94, pages 647–653. IEEE CS Press, 1994.Google Scholar
  35. [35]
    T. S. Perraju, G. Uma, B. E. Prasad, and S. P. Rana. Match algorithm for a real time expert system. In Proceedings if the 7 th Conference on Databases and Expert System Applications DEXA96. Springer-Verlag, 1996.Google Scholar
  36. [36]
    V. A. Pham and A. Karmouch. Mobile software agents: An overview. IEEE Communications Magazine, pages 26–37, July 1998.Google Scholar
  37. [37]
    B. E. Prasad, T. S. Perraju, G. Uma, and P. Umarani. An expert system shell for aerospace applications. IEEE Expert, 9(4):56–64, Aug. 1994.CrossRefGoogle Scholar
  38. [38]
    K. Ramamritham and J. A. Stankovic. Scheduling algorithms and operating systems support for realtime systems. Proceedings of the IEEE, 82(1):55–76, Jan. 1994.CrossRefGoogle Scholar
  39. [39]
    B. Randell. Reliable computing systems. In Operating Systems: An Advanced Course, pages 282–391. Springer-Verlag, New York, 1979.Google Scholar
  40. [40]
    A. Rao and M. Georgeff. Bdi agents: From theory to practice. In Proceedings of the First International Conference on Multi-Agent Systems ICMAS95, 1995.Google Scholar
  41. [41]
    B. Sandeep and S. Sinha. Minute: A protocol for multi issue negotiation under time constrained environment. Technical report, VNRVJ Institute of Technology, Hyderabad, India, Mar. 2003.Google Scholar
  42. [42]
    T. Sandholm and V. Lesser. Issues in automated negotiation and electronic commerce: Extending the contract net framework. In Proceedings of First International Conference on Multiagent Systems ICMAS95, 1995.Google Scholar
  43. [43]
    A. Z. Shamsuddin and T. S. Dhillon. Knowledge with real-time semanitcs. In Proceedings of the 1992 IEEE International Conference on Tools with AI, pages 464–466. IEEE CS Press, 1992.Google Scholar
  44. [44]
    M. Singhal and N. Shivaratri. Advanced Concepts in Operating Systems. McGraw Hill, 1994.Google Scholar
  45. [45]
    R. Smith and R. Davis. Frameworks for cooperation in distributed problem solving. IEEE Transactions on Systems, Man and Cybernetics, 11(1), 1981.Google Scholar
  46. [46]
    R. G. Smith. Contract net protocol: High level communication and control in distributed problem solvers. IEEE Transactions on Computers, 29(12):1104–1113, 1980.CrossRefGoogle Scholar
  47. [47]
    Y. P. So and E. Durfee. A distributed problem solving infrastructure for computer network management. International Journal of Intelligent and Cooperative Information Systems, 1(2):363–392, 1992.CrossRefGoogle Scholar
  48. [48]
    K. Sycara. Multi-agent compromise via negotiation. In Distributed Artificial Intelligence Volume 2. Morgan Kaufmann, 1989.Google Scholar
  49. [49]
    K. P. Sycara. Retsina—reusable environment for task structured intelligent network agents, http:// www.cs.cmu.edu/softagents/retsina/retsina.html. Technical report, Carnegie Mellon University.Google Scholar
  50. [50]
    S. Tubbs. ASystem Approach to Small Group Interaction. Addison-Wesley, Reading, MA, 1994.Google Scholar
  51. [51]
    G. Uma, L. O. Alvares, and Y. Demazeau. On decomposition methodology. Journal of the Institution of Electronics and Telecommunication Engineers (IETE), 42(3):111–116, May–June 1996.Google Scholar
  52. [52]
    G. Uma and B. E. Prasad. Reachability trees for petri nets: a hueristic approach. Journal of Knowledge based Systems, 6(3):174–177, Sep. 1993.CrossRefGoogle Scholar
  53. [53]
    G. Uma, B. E. Prasad, and O. N. Kumari. Distributed intelligent systems-issues, perspectives and approaches. Journal of Knowledge based Systems, 6(2):77–86, Jun. 1993.CrossRefGoogle Scholar
  54. [54]
    G. Uma, B. E. Prasad, and O. N. Kumari. Distributed intelligent systems-issues, perspectives and approaches. Knowledge based systems, 6(2):77–86, 1993.CrossRefGoogle Scholar
  55. [55]
    G. Uma, B. E. Prasad, and P. G. Reddy. Framework for modelling and analysis of distributed problem solving systems. Journal of Knowledge Based Systems, 5(4):295–304, Dec. 1992.CrossRefGoogle Scholar
  56. [56]
    W. Walsh and M. Wellman. A market protocol for decentralized task allocation. In Proceedings of International Conference on Multi Agent Systems ICMAS98, pages 325–332, 1998.Google Scholar
  57. [57]
    M. P. Wellman, W. P. Birmingham, and E. H. Durfee. The digital library as a community of information agents. IEEE Expert, 11(3):10–11, 1996.CrossRefGoogle Scholar
  58. [58]
    F. Ygge and H. Akkermans. On resource oriented multi commodity market computation. In Proceedings of International Conference on Multi Agent Systems ICMAS98, pages 365–371, 1998.Google Scholar

Copyright information

© Kluwer Academic Publishers 2005

Authors and Affiliations

  • Tolety Siva Perraju
    • 1
  • Garimella Uma
    • 2
  1. 1.Verizon CommunicationsWalthamUSA
  2. 2.South Asia International InstituteHyderabadIndia

Personalised recommendations