On the Modeling of Sequential Reactive Systems by Means of Real Time Automata

Sequential reactive systems include hardware devices and software programs which operate in continuous interaction with the external environment, from which they receive streams of input signals (data, commands) and in response to them form streams of output signals. Systems of this type include controllers, network switches, program interpreters, system drivers. The behavior of some reactive systems is determined not only by the sequence of values of input signals, but also by the time of their arrival at the inputs of the system and the delays in computing the output signals. These aspects of reactive system computations are taken into account by real-time models of computation which include, in particular, realtime finite state machines (TFSMs). However, in most works where this class of real-time automata is studied a simple variant of TFSM semantics is used: the transduction relation computed by a TFSM is defined so that the elements of an output stream, regardless oftheir timestamps, follow in the same order as the corresponding elements ofthe input stream. This straightforward approach makes the model easier to analyze and manipulate, but it misses many important features of real-time computation. In this paper we study a more realistic semantics of TFSMs and show how to represent it by means of Labeled Transition Systems. The use of the new TFSM model also requires new approaches to the solution of verification problems in the framework of this model. For this purpose, we propose an alternative definition of TFSM computations by means of Labeled Transition Systems and show that the two definitions of semantics for the considered class of real-time finite state machines are in good agreement with each other. The use of TFSM semantics based on Labeled Transition Systems opens up the possibility of adapting well known real-time model checking techniques to the verification ofsequential reactive systems.

1. A. Gill et al., «Introduction to the Theory of Finite-state Machines», 1962.

2. A. Y. Savelev, «Prikladnaya teoriya cifrovyh avtomatov», 1987, In Russian.

3. R. Alur and D. Dill, «A theory of timed automata», Theoretical computer science, vol. 126, no. 2, pp. 183-235, 1994.

4. E. Asarin, P. Caspi, and O. Maler, «Timed regular expressions», Journal of the ACM, vol. 49, no. 2, pp. 1-35, 2001.

5. E. Asarin, P. Caspi, and O. Maler, «A Kleene theorem for timed automata», in Proceedings of 12-th Annual IEEE Symposium on Logic in Computer Science (LICS'97), IEEE, 1997, pp. 160-171.

6. R. Alur and P. Madhusudan, «Decision Problems for Timed Automata: A Survey, Formal Methods for the Design of Real-Time Systems», in Proceedings of the 4-th International School on Formal Methods for the Design of Computer, Communication, and Software Systems (SFM'04), Springer, 2004, pp. 1-24.

7. S. Lasota and I. Walukiewicz, «Alternating timed automata», ACM Transactions on Computational Logic (TOCL), vol. 9, no. 2, pp. 1-26, 2008.

8. M. Gromov, K. El-Fakih, N. Shabaldina, and N. Yevtushenko, «Distinguing Non-deterministic Timed Finite State Machines», in Formal Techniques for Distributed Systems, Lecture Notes in Computer Science, vol. 5522, Springer, 2009, pp. 137-151.

9. M. G. Merayo, M. Nunez, and I. Rodriguez, «Formal testing from timed finite state machines», Computer networks, vol. 52, no. 2, pp. 432-460, 2008.

10. D. Bresolin, K. El-Fakih, T. Villa, and N. Yevtushenko, «Deterministic Timed Finite State Machines: Equivalence Checking and Expressive Power», Proceedings of the 5-th International Symposium on Games, Automata, Logics and Formal Verification, pp. 203-216, 2014.

11. A. Tvardovskii and N. Yevtushenko, «Minimizing timed Finite State Machines», Tomsk State University Journal of Controland Computer Science, vol. 29, no. 4, pp. 77-83, 2014.

12. A. S. Tvardovskii, N. V. Yevtushenko, and M. L. Gromov, «Minimizing finite state machines with time guards and timeouts», Proceedings of the Institute for System Programming of the RAS, vol. 29, no. 4, pp. 139-154, 2017.

13. A. S. Tvardovskii and N. V. Yevtushenko, «Deriving homing sequences for Finite State Machines with timed guards», Sistemnaya informatika, vol. 17, pp. 1-10, 2020.

14. N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, «OpenFlow: enabling innovation in campus networks», ACM SIGCOMM Computer Communication Review, vol. 38, no. 2, pp. 69-74, 2008.

15. E. Vinarskii, J. Lopez, N. Kushik, N. Yevtushenko, and D. Zeghlache, «A Model Checking Based Approach for Detecting SDN Races», in Proceedings of the 31-st IFIP WG 6.1 International Conference on Testing Software and Systems (ICTSS), Springer, 2019, pp. 194-211.

16. E. M. Vinarskii and V. A. Zakharov, «On the verification of strictly deterministic behavior of Timed Finite State Machines», Proceedings of ISP RAS, vol. 30, no. 3, pp. 325-340, 2018.

17. C. Baier and J.-P. Katoen, Principles ofmodel checking. Cambridge: MIT Press Cambridge, 2008.

18. G. Behrmann, A. David, and K. G. Larsen, «A tutorial on Uppaal», in Proceedings of the International School on Formal Methods for the Design of Computer, Communication, and Software Systems, Springer, 2004, pp. 200-236.