Precongruence formats for decorated trace preorders

Bard Bloom, Wan Fokkink, Rob Van Glabbeek

Research output: Contribution to JournalArticleAcademicpeer-review


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.

Original languageEnglish
Pages (from-to)107-118
Number of pages12
JournalProceedings - Symposium on Logic in Computer Science
Publication statusPublished - 1 Jan 2000


Dive into the research topics of 'Precongruence formats for decorated trace preorders'. Together they form a unique fingerprint.

Cite this