%0 Journal Article
%@ 0304-3975
%A Chen, Xiao Jun
%A De Nicola, Rocco
%D 2001
%F eprints:330
%I Elsevier
%J Theoretical Computer Science
%K Behavioural equivalences; Abstraction homomorphisms; Minimal representatives; Synchronization trees
%N 1-2
%P 337-361
%T Algebraic characterizations of trace and decorated trace equivalences over tree-like structures
%U http://eprints.imtlucca.it/330/
%V 254
%X Behavioural equivalences of labelled transition systems are characterized in terms of homomorphic transformations. This permits relying on algebraic techniques for proving systems properties and reduces equivalence checking of two systems to studying the relationships among the elements of their structures. Different algebraic characterizations of bisimulation-based equivalences in terms of particular transition system homomorphisms have been proposed in the literature. Here, it is shown that trace and decorated trace equivalences can neither be characterized in terms of transition system homomorphisms, nor be defined locally, i.e., only in terms of action sequences of bounded length and of root-preserving maps. However, results similar to those for bisimulation can be obtained for restricted classes of transition systems. For tree-like systems, we present the algebraic characterizations of trace equivalence and of three well-known decorated trace equivalences, namely ready, ready trace equivalence and failure.
%Z The extended abstract of this paper has been presented at ICALP’96 and appears in LNCS 1099, pp. 63–74.