DocumentCode
2221706
Title
Precongruence formats for decorated trace preorders
Author
Bloom, Bard ; Fokkink, Wan ; Van Glabbeek, Rob
Author_Institution
IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA
fYear
2000
fDate
2000
Firstpage
107
Lastpage
118
Abstract
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 (1981) 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
Keywords
bisimulation equivalence; process algebra; concrete sequential processes; decorated trace preorders; labelled transition systems; linear time-branching time spectrum; precongruence formats; process algebra; semantic equivalence; structural approach; transition system specifications; Chromium;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 2000. Proceedings. 15th Annual IEEE Symposium on
Conference_Location
Santa Barbara, CA
ISSN
1043-6871
Print_ISBN
0-7695-0725-5
Type
conf
DOI
10.1109/LICS.2000.855760
Filename
855760
Link To Document