Precongruence Formats for Decorated Trace Semantics

Bard Bloom, W.J. Fokkink, R.J. van Glabbeek

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labeled 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)26-78
Number of pages53
JournalACM Transactions on Computational Logic
Issue number1
Publication statusPublished - 1 Jan 2004


Dive into the research topics of 'Precongruence Formats for Decorated Trace Semantics'. Together they form a unique fingerprint.

Cite this