Induction and coinduction are two complementary techniques used in mathematics and
computer science. These techniques occur together, for example, in control systems: On the …

Automata learning is a technique that has successfully been applied in verification, with the
automaton type varying depending on the application domain. Adaptations of automata …

Compositional methods are central to the verification of software systems. For concurrent
and communicating systems, compositional techniques based on behavioural type systems …

Abstract Automata learning has been successfully applied in the verification of hardware
and software. The size of the automaton model learned is a bottleneck for scalability, and …

Automata defined by monads in categories are introduced as special examples of monoids
actions on free T-algebras, where T is a monad in a category. Morphisms between monads …

Automata theory has given rise to a variety of automata models that consist of a finite-state
control and an infinite-state storage mechanism. The aim of this work is to provide insights …

We explore language semantics for automata combining probabilistic and nondeterministic
behaviors. We first show that there are precisely two natural semantics for probabilistic …

Regular languages-the languages accepted by deterministic finite automata-are known to
be precisely the languages recognized by finite monoids. This characterization is the origin …

This paper contributes to a theory of the behaviour of “finite-state” systems that is generic in
the system type. We propose that such systems are modeled as coalgebras with a finitely …

This paper contributes to a generic theory of behaviour of “finite-state” systems. Systems are
coalgebras with a finitely generated carrier for an endofunctor on a locally finitely …