Full abstraction for series-parallel pomsets

Abstract

In this paper, we provide a behavioural characterization of the class of finite, seriesparallel pomsets by showing that this simple model based on partial orders is fully-abstract with respect to the behavioural equivalence obtained by applying Abramsky's testing scenario for bisimulation equivalence, [Ab87], in all refinement contexts, [AH89]. This casts the observability of series-parallel pomsets in a purely interleaving framework. Moreover, we prove that the order structure of a series-parallel pomset is completely revealed by its set of ST-traces, [G190], and provide a complete axiomatization of ST-trace equivalence over the class of series-parallel pomsets.