|
Prikladnaya Diskretnaya Matematika, 2009, supplement № 1, Pages 6–7
(Mi pdm117)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Theoretical Foundations of Applied Discrete Mathematics
Solving parallel equations over $\omega$-regular languages
V. G. Bushkov, N. V. Evtushenko
Abstract:
We consider the problem of deriving a component of a system that combined with a known part of a system meets the given specification. We assume that the behavior of the overall system and of its parts is described by Buchi automata that accept $\omega$-regular languages, i.e. languages containing infinite words. The problem of deriving an unknown component can be casted into the problem of solving language equations over $\omega$-regular languages. However solving techniques for equations over regular languages cannot be directly applied to the case of $\omega$-regular languages.
Citation:
V. G. Bushkov, N. V. Evtushenko, “Solving parallel equations over $\omega$-regular languages”, Prikl. Diskr. Mat., 2009, supplement № 1, 6–7
Linking options:
https://www.mathnet.ru/eng/pdm117 https://www.mathnet.ru/eng/pdm/y2009/i10/p6
|
Statistics & downloads: |
Abstract page: | 236 | Full-text PDF : | 64 | References: | 46 |
|