PCF-based formalization of the parallel composition of automata
Keyword(s):
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.
2009 ◽
Vol 34
(4)
◽
pp. 460-465
◽
Keyword(s):
Keyword(s):
2015 ◽
Vol 23
(6)
◽
pp. 2107-2121
◽
Keyword(s):
2020 ◽
Vol 17
(1)
◽
pp. 361-374
◽
2019 ◽
Vol 7
(3)
◽
pp. 217-232
Keyword(s):
2014 ◽
Vol 11
(4)
◽
pp. 1229-1247
◽
Keyword(s):