Dr Shields is visiting on Thursday only, hosted by Stuart Anderson.

Abstract

In this talk we describe a class of automata called hybrid transition systems. We explain how from some initial state, each hybrid transition system determines a discrete behavioural presentation. We argue that every discrete behavioural presentation arises in this way. As an illustration, we sketch a non-interleaving semantics for a process algebra.