Seamless Implementation of a Telephone Switching System Based on Formal Specifications in RTPA

  • Authors:

  • Yingxu Wang;Yousheng Tian

  • Affiliations:

  • University of Calgary, Canada;University of Calgary, Canada

  • Venue:
  • International Journal of Software Science and Computational Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Telephone Switching Systems TSS is a typical real-time system that is highly complicated in design and implementation. In order to deal with the extreme complexity in real-world settings, a suitable and efficient mathematical means is required beyond any programming language. To this purpose, an efficient and precise denotational mathematics known as the Real-Time Process Algebra RTPA and the RTPA methodology for system modeling are introduced. Empirical experimental results are reported in this paper on the implementation of TSS based on formal models of the system in RTPA. Three phases of experiments are designed on TSS conceptual modeling, system interface design, and programming implementation and testing. All groups in the experiments with 7 to 8 members have been able to efficiently understood, design, and implement the TSS system in a simplified version in four weeks, which has been estimated as a 10+ person-year project in the industry. The efficiency and expressiveness of RTPA are empirically demonstrated base on the case studies in the experiments.