Unification Algorithm for Control Systems Modeled by Parametrized Finite State Machines

Авторы: Tang Tianxiang, Zakharov Vladimir A.
Сборник: 2024 10th International Conference on Systems and Informatics (ICSAI)
Серия: International Conference on Systems and Informatics
Год издания: 2024
Место издания: IEEE
Первая страница: 1
Последняя страница: 6
DOI: 10.1109/icsai65059.2024.10893783
Аннотация: In mathematics, the unification problem is that of computing the parameters of two models (formulas, automata, programs, etc.) in such a way that these models have the same behavior. We study the unification problem for parameterized finite state machines that are used as discrete models of control and information processing systems, such as controllers, drivers, converters, routers, and many other reactive systems. In this paper, we present an efficient unification algorithm for parameterized finite state machines, prove its correctness and estimate its time complexity. This algorithm can be used to verify control systems, check the compatibility of alternative designs of such systems, and also to refine the values of their parameters.
Добавил в систему: Тан Тяньсян

	ИСТИНА	Войти в систему Регистрация
	ИСТИНА ПсковГУ
	Главная Поиск Статистика О проекте Помощь

ИСТИНА