Deterministic Finite-Automata Abstractions of Time-Variant Sequential Behaviours

摘要

Asequential behaviouris a set of infinite length words. Following J.C. Willemsbehavioural systems theory, we interpret the behaviour as the relevant outcome when modelling a phenomenon w.r.t. the progress of discrete time. We propose the notion of anexperimentas a particular form of inspecting a provided behaviour and ask for a strongest model that can be derived therefrom. The overall construct establishes a behavioural abstraction from the original model which, for finite signal ranges, can be realised as a deterministic finite automaton. The proposed method includes a flexible scheme for abstraction refinement that can be tailored to meet application requirements.