A new NFA algorithm for SPC switching systems

Author

Wanq Yingxu ; Wei Jia

Author_Institution

Res. Inst. for Telecommun. & Automatic Control, Lanzhou Inst. of Railway Technol., China

Volume

3

fYear

1993

fDate

19-21 Oct. 1993

Firstpage

609

Abstract

The paper presents a new approach for the formal description of the software of stored program controlled (SPC) telephone switching systems. An event-driven algorithm based on nondefined finite automaton (NFA) are created. By using the algorithm, a new SPC 1+1 call processing technique for a party-line telephone switching system are implemented, and the problems which the traditional party-line technique find difficult to resolve, such as communication in secret, separate ringing, no-answer call forward and transferring call forward, are implemented.<>

Keywords

electronic switching systems; finite automata; formal specification; telephone systems; telephone traffic; NFA algorithm; SPC 1+1 call processing technique; SPC switching systems; event-driven algorithm; formal description; no-answer call forward; nondefined finite automaton; party-line telephone switching system; secret; separate ringing; software; stored program control; telephone switching systems; transferring call forward; Switching systems;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on

Conference_Location

Beijing, China

Print_ISBN

0-7803-1233-3

Type

conf

DOI

10.1109/TENCON.1993.328061

Filename

328061