• DocumentCode
    397088
  • Title

    Formal description of an ATM system by RTPA

  • Author

    Wang, Yingxu ; Zhang, Yanan

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Calgary Univ., Alta., Canada
  • Volume
    2
  • fYear
    2003
  • fDate
    4-7 May 2003
  • Firstpage
    1255
  • Abstract
    An automated teller machine (ATM) is a safety-critical and real-time system. The modeling and description of an ATM is a classical real-world case because its conceptual model is well known as a working project in real-time system design. For ensuring correctness and dependability, real-time process algebra (RTPA) is adopted to specify a formal model of the ATM. By using RTPA, the architecture, static and dynamic behaviors of the ATM can be described formally, precisely, and consistently. This paper describes the conceptual and formal models of the ATM. The conceptual model of the ATM is described by a finite state machine (FSM), and the formal model is specified by RTPA. This paper demonstrates that the ATM can be formally described by a set of real-time processes in RTPA. It also shows the relationship between the RTPA model and the FSM model of the ATM system.
  • Keywords
    automatic teller machines; finite state machines; process algebra; real-time systems; ATM; FSM; RTPA; automated teller machine; distributed systems; finite state machine; formal description; real-time process algebra; real-time system; Algebra; Automata; Computer languages; Controllability; Drives; Maintenance; Mathematical model; Process design; Real time systems; Software engineering;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electrical and Computer Engineering, 2003. IEEE CCECE 2003. Canadian Conference on
  • ISSN
    0840-7789
  • Print_ISBN
    0-7803-7781-8
  • Type

    conf

  • DOI
    10.1109/CCECE.2003.1226127
  • Filename
    1226127