eprintid: 330
rev_number: 8
eprint_status: archive
userid: 32
dir: disk0/00/00/03/30
datestamp: 2011-05-31 12:34:16
lastmod: 2011-07-11 14:36:26
status_changed: 2011-05-31 12:34:16
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: Chen, Xiao Jun
creators_name: De Nicola, Rocco
creators_id: 
creators_id: r.denicola@imtlucca.it
title: Algebraic characterizations of trace and decorated trace equivalences over tree-like structures
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords: Behavioural equivalences; Abstraction homomorphisms; Minimal representatives; Synchronization trees
note: The extended abstract of this paper has been presented at ICALP’96 and appears in LNCS 1099, pp. 63–74.
abstract: 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.
date: 2001
date_type: published
publication: Theoretical Computer Science
volume: 254
number: 1-2
publisher: Elsevier
pagerange: 337-361
id_number: 10.1016/S0304-3975(99)00300-X
refereed: TRUE
issn: 0304-3975
official_url: http://www.sciencedirect.com/science/article/pii/S030439759900300X
citation:   Chen, Xiao Jun and De Nicola, Rocco  Algebraic characterizations of trace and decorated trace equivalences over tree-like structures.  Theoretical Computer Science, 254 (1-2).  pp. 337-361.  ISSN 0304-3975      (2001)