Precongruence Formats for Decorated Trace Semantics
Logic in Computer Science
2007-05-23 v1
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 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
Cite
@article{arxiv.cs/0204039,
title = {Precongruence Formats for Decorated Trace Semantics},
author = {B. Bloom and W. J. Fokkink and R. J. van Glabbeek},
journal= {arXiv preprint arXiv:cs/0204039},
year = {2007}
}
Comments
48 pages. More info at http://theory.stanford.edu/~rvg/abstracts.html#48