TY  - CHAP
EP  - 74
ID  - eprints357
N2  - A possible approach to studying behavioural equivalences in labelled transition systems is that of characterizing them in terms of homomorphic transformations. This characterization 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 systems homomorphisms have been proposed in the literature. Here we show, by an example, that trace-based equivalences are not locally characterizable and thus that the above results cannot be extended to these equivalences. However, similar results can be obtained if we confine ourselves to restricted classes of transition systems. Here, the algebraic characterizations of three well known decorated-trace equivalences (ready trace, ready and failure equivalence) for tree-like structures are presented.
ED  - Meyer auf der Heide, Friedhelm
ED  - Monien, Burkhard
SN  - 3-540-61440-0
T2  - Automata, Languages and Programming (ICALP 1996)
PB  - Springer
T3  - Lecture Notes in Computer Science
TI  - Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures
SP  - 63
AV  - none
Y1  - 1996///
M1  - 1099
A1  - Chen, Xiao Jun
A1  - De Nicola, Rocco
UR  - http://dx.doi.org/10.1007/3-540-61440-0_117
ER  -