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. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.