ω-automata is a variant of finite automata which accepts infinite strings. It represents the behaviour of the infinite systems (hardware, operating system and control systems) which are not expected ...

Weighted automata extend classical finite automata by assigning weights, typically drawn from algebraic structures such as semirings, to transitions. This quantitative enhancement enables the analysis ...

Recently, in an ongoing debate about informal provability, non-deterministic logics of informal provability BAT and CABAT were developed to model the notion. CABAT logic is defined as an extension of ...