Precongruence formats for decorated trace preorders

Bard Bloom, Wan Fokkink, Rob Van Glabbeek

Research output: Contribution to JournalArticleAcademicpeer-review

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.

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

Fingerprint

Preorder
Semantics
Trace
Concretes
Specifications
Labeled Transition System
Transition Systems
Branching
Linear Time
Equivalence
Specification
Operator

Cite this

@article{bb73fa0252e043aeab3ce57492a94a72,
title = "Precongruence formats for decorated trace preorders",
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.",
author = "Bard Bloom and Wan Fokkink and {Van Glabbeek}, Rob",
year = "2000",
month = "1",
day = "1",
doi = "10.1109/LICS.2000.855760",
language = "English",
pages = "107--118",
journal = "Proceedings - Symposium on Logic in Computer Science",
issn = "1043-6871",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Precongruence formats for decorated trace preorders. / Bloom, Bard; Fokkink, Wan; Van Glabbeek, Rob.

In: Proceedings - Symposium on Logic in Computer Science, 01.01.2000, p. 107-118.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - Precongruence formats for decorated trace preorders

AU - Bloom, Bard

AU - Fokkink, Wan

AU - Van Glabbeek, Rob

PY - 2000/1/1

Y1 - 2000/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0033698076&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033698076&partnerID=8YFLogxK

U2 - 10.1109/LICS.2000.855760

DO - 10.1109/LICS.2000.855760

M3 - Article

SP - 107

EP - 118

JO - Proceedings - Symposium on Logic in Computer Science

JF - Proceedings - Symposium on Logic in Computer Science

SN - 1043-6871

ER -