Hierarchical state transition charts in synthesis of telecommunication state machines

This article describes a new approach to computation management for state machines. The proposed approach intended to simplify implementation of loosely specified algorithms of telecommunication state machines. It implies creation of hierarchical state-transition charts (STC) destined to resolve implicit states and transitions. The second target is strict serialization of computing on all levels of hierarchy built. Based on described approaches the authors create a language for specification of hierarchical STC which would allow to unambiguously implement state machines for various purposes.