Страница публикации

PCF-based formalization of the parallel composition of automata

Авторы: Davydov A., Larionov A., Nagul N.

Журнал: CEUR Workshop Proceedings: Proc. of 1st Intern. Workshop on Information, Computation, and Control Systems for Distributed Environments (ICCS-DE'2019)

Том: 2430


Год: 2019

Отчётный год: 2019


Местоположение издательства:


Аннотация: The paper demonstrates how the automatic theorem proving technique of the PCF calculus is applied to construct parallel composition of automata. Parallel composition plays an essential role in the supervisory control theory at different stages of systems and supervisors design. Improved formalization of discrete event systems as positively-constructed formulas along with auxiliary predicates, serving for accessibility of the automaton checking, simplify parallel composition construction.

Индексируется WOS: 0

Индексируется Scopus: 1

Индексируется РИНЦ: 0

Публикация в печати: 0

Добавил в систему: