Precongruence Formats for Decorated Trace Preorders

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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 (1981) 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
Title of host publicationProceedings of the Fifteenth Annual IEEE Symposium on Logic in Computer Science
PublisherIEEE Computer Society Press
Pages107-118
Number of pages12
ISBN (Print)0-7695-0725-5
DOIs
Publication statusPublished - 28 Jun 2000
EventThe 15th Annual Symposium on Logic in Computer Science, 2000 - Santa Barbara, United States
Duration: 26 Jun 200028 Jun 2000
Conference number: 15

Publication series

NameAnnual Symposium on Logic in Computer Science
PublisherIEEE
ISSN (Print)1043-6871

Symposium

SymposiumThe 15th Annual Symposium on Logic in Computer Science, 2000
Abbreviated titleLICS 2000
Country/TerritoryUnited States
CitySanta Barbara
Period26/06/0028/06/00

Fingerprint

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

Cite this