Checking multi-view consistency of discrete systems with respect to periodic sampling abstractions

In multi-view modeling (MVM) the system under development is described by distinct models, called views, which capture different perspectives of the system. Possible overlaps of the views may give rise to inconsistencies. Following the formal MVM framework of [33], the view consistency problem asks to check the consistency of a given set of views with respect to a given set of abstraction functions. Existing work checks view consistency of discrete systems (transition systems or finite automata) with respect to two types of abstraction functions: (1) projections of state variables and (2) projections of an alphabet of events onto a subalphabet. In this paper, we study view consistency with respect to timing abstractions, specifically, periodic sampling, for automata and transition systems.