Chen, Xiao Jun and De Nicola, Rocco Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures. In: Automata, Languages and Programming (ICALP 1996). Lecture Notes in Computer Science, 1099 . Springer, pp. 63-74. ISBN 3-540-61440-0 (1996)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Funders:||This work has been partially founded by EEC, HCM Project EXPRESS, and by CNR: Progetto "Specifica ad Alto Livello e Verifica di Sistemi Digitali".|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||13 Jun 2011 14:27|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)