Abstract We consider the notion of a constant length queue automaton —i.e., traditional with built-in limit on its queue—as formalism for representing regular languages. show that descriptional power automata greatly outperforms finite state automata, height pushdown and straight line programs expressions, by providing optimal exponential double-exponential size gaps. Moreover, we prove can be ...

We develop a generic framework to extend the logics LTL, CTL\(^+\) and CTL\(^*\) by automata-based connectives from formal language classes analyse this with regard regular languages, visibly pushdown languages (deterministic) context-free languages. More precisely, we consider how use of different automata changes expressive power provide algorithms for satisfiability model checking problems i...

We propose a new algorithm for checking language equivalence of non-deterministic Büchi automata. start from construction proposed by Calbrix, Nivat and Podelski, which makes it possible to reduce the problem that automata on finite words. Although this generates large highly automata, we show how exploit their specific structure apply state-of-the art techniques based coinduction state-space h...

Abstract We present algorithms for model checking and controller synthesis of timed automata, seeing a automaton as parallel composition large finite-state machine relatively smaller automaton, using compositional reasoning on this composition. use automata learning to learn finite approximations the component, in order reduce problem at hand or synthesis. an experimental evaluation our approach.

General automata are considered with respect to normal-ization over semirings. Possibilistic automata are deened as normal pessimistic fuzzy automata. Possibilistic automata are analogous to stochas-tic automata where stochastic (+=) semirings are replaced by possi-bilistic (_=^) semirings; but where stochastic automata must be normal, fuzzy automata may be (resulting in possibilistic automata)...