Precongruence formats for decorated trace semantics-Reference-Cited by-同舟云学术

Precongruence formats for decorated trace semantics

Published:2004-01 Issue:1 Volume:5 Page:26-78
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Bloom Bard¹,Fokkink Wan²,van Glabbeek Rob J.³

Affiliation:

1. IBM T.J. Watson Research Center, Hawthorne, NY

2. CWI and Free University Amsterdam, Amsterdam, The Netherlands

3. Stanford University, Stanford, CA

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/963927.963929

Reference40 articles.

1. A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces

2. Syntax and defining equations for an interrupt mechanism in process algebra;Baeten J. C. M.;Fundam. Informat.,1986

3. Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator

4. Bergstra J. A. and Klop J. W. 1984. Process algebra for synchronous communication. Inf. Contr. 60 1/3 109--137. Bergstra J. A. and Klop J. W. 1984. Process algebra for synchronous communication. Inf. Contr. 60 1/3 109--137.

Cited by 48 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Back to the format: A survey on SOS for probabilistic processes;Journal of Logical and Algebraic Methods in Programming;2024-02

2. The Way We Were: Structural Operational Semantics Research in Perspective;Electronic Proceedings in Theoretical Computer Science;2023-09-14

3. A logical characterization of differential privacy;Science of Computer Programming;2020-03

4. Probabilistic divide & congruence: Branching bisimilarity;Theoretical Computer Science;2020-01

5. Congruence from the operator’s point of view;Acta Informatica;2019-12-02