TY - JOUR
T1 - Precongruence formats for decorated trace preorders
AU - Bloom, Bard
AU - Fokkink, Wan
AU - Van Glabbeek, Rob
PY - 2000/1/1
Y1 - 2000/1/1
N2 - This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin's structural approach. For several preorders in the linear time - branching time spectrum a format is given, as general as possible, such that this preorder is a precongruence for all operators specifiable in that format. The formats are derived using the modal characterizations of the corresponding preorders.
AB - This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin's structural approach. For several preorders in the linear time - branching time spectrum a format is given, as general as possible, such that this preorder is a precongruence for all operators specifiable in that format. The formats are derived using the modal characterizations of the corresponding preorders.
UR - http://www.scopus.com/inward/record.url?scp=0033698076&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033698076&partnerID=8YFLogxK
U2 - 10.1109/LICS.2000.855760
DO - 10.1109/LICS.2000.855760
M3 - Article
AN - SCOPUS:0033698076
SN - 1043-6871
SP - 107
EP - 118
JO - Proceedings - Symposium on Logic in Computer Science
JF - Proceedings - Symposium on Logic in Computer Science
ER -