Precongruence Formats for Decorated Trace Semantics
| dc.creator | Bloom, B. | |
| dc.creator | Fokkink, W. J. | |
| dc.creator | van Glabbeek, R. J. | |
| dc.date | 2002-04-17 | |
| dc.date.accessioned | 2026-07-07T03:18:20Z | |
| dc.date.available | 2026-07-07T03:18:20Z | |
| dc.description | 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. | |
| dc.description | 48 pages. More info at http://theory.stanford.edu/~rvg/abstracts.html#48 | |
| dc.identifier | https://arxiv.org/abs/cs/0204039 | |
| dc.identifier | http://arxiv.org/abs/cs/0204039 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31068 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.3.1; F.1.2; F.3.2 | |
| dc.title | Precongruence Formats for Decorated Trace Semantics | |
| dc.type | text |