The Finite State Machine (FSM) has proven to be a classical model for description of input-output reactive discreteġ This work is supported by the grant for the basic research №16-49-03012 of Russian Scientific Foundation.Įvent systems. To analyze and synthesize such systems one needs an adequate formal model. are targeted on interaction with each other. DOI: 10.15514/ISPRAS-2017-29(3)-13ĭifferent systems, for example web-services, telecommunication protocols digital networks etc. Experiments on Parallel Composition of Timed Finite State Machines. Keywords: Timed finite state machine parallel composition BALM-II. In the experiments, we do not consider global automata with the huge number of states (more then 10000). We also estimate the size of the global automaton and the composed TFSM. Results of the experiments show significant amount (around 50 %) of TFSMs with infinite number of output delays. As it was suggested in earlier works, we describe the infinite sets of output delays by linear functions, and it is important to know how often these sets of linear functions appear to justify the importance of future investigations of the TFSM parallel compositions (especially for deriving cascade composition). To conduct these experiments we have created two tools: the first one for converting TFSMs into automata (this tool is integrated into BALM-II), the second one for converting the global automaton of the composition into TFSM. We held experiments in order to estimate how often parallel composition of nondeterministic TFSMs (with and without timeouts) has infinite sets of output delays. We consider the composition of TFSMs with timeouts and output delays.

In this paper, we continue our work that is devoted to the parallel composition of Timed Finite State Machines (TFSMs). Shabaldina MM, Gromov Tomsk State University, 36, Lenin ave., Tomsk, 634050, RussiaĪbstract. Experiments on Parallel Composition of Timed Finite State Machines1Ī.P.

How often does parallels update