Precongruence Formats for Decorated Trace Semantics

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
48 pages. More info at http://theory.stanford.edu/~rvg/abstracts.html#48

Keywords

Logic in Computer Science, D.3.1; F.1.2; F.3.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31068

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0204039
 http://arxiv.org/abs/cs/0204039

Collections

arXiv