Precongruence formats for decorated trace semantics

B. Bloom; W.J. Fokkink; R.J. van Glabbeek

doi:10.1145/963927.963929

Precongruence formats for decorated trace semantics

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

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

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 language	English
Pages (from-to)	26-78
Journal	ACM Transactions on Computational Logic
Volume	5
Issue number	1
DOIs	https://doi.org/10.1145/963927.963929
Publication status	Published - 2004

Bibliographical note

DBLP:journals/tocl/BloomFG04

Access to Document

10.1145/963927.963929

Persistent URL (handle)

Persistent link

Cite this

@article{dd33642bbd7c45b48dda5b8f75aac55f,

title = "Precongruence formats for decorated trace semantics",

abstract = "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.",

author = "B. Bloom and W.J. Fokkink and \{van Glabbeek\}, R.J.",

note = "DBLP:journals/tocl/BloomFG04 ",

year = "2004",

doi = "10.1145/963927.963929",

language = "English",

volume = "5",

pages = "26--78",

journal = "ACM Transactions on Computational Logic",

issn = "1529-3785",

publisher = "Association for Computing Machinery (ACM)",

number = "1",

}

TY - JOUR

T1 - Precongruence formats for decorated trace semantics

AU - Bloom, B.

AU - Fokkink, W.J.

AU - van Glabbeek, R.J.

N1 - DBLP:journals/tocl/BloomFG04

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

U2 - 10.1145/963927.963929

DO - 10.1145/963927.963929

M3 - Article

SN - 1529-3785

VL - 5

SP - 26

EP - 78

JO - ACM Transactions on Computational Logic

JF - ACM Transactions on Computational Logic

IS - 1

ER -

Precongruence formats for decorated trace semantics

Abstract

Bibliographical note

Access to Document

Persistent URL (handle)

Fingerprint

Cite this