Precongruence Formats for Decorated Trace Preorders

Authors:
Bard Bloom;Wan Fokkink; Rob Van Glabbeek
Affiliations:
-;-;-
Venue:
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Year:
2000

Citing 18
Cited 2

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Specification-oriented semantics for communicating processes

Acta Informatica
Refusal testing

Theoretical Computer Science
Ready-trace semantics for concrete process algebra with the priority operator

The Computer Journal
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Structured operational semantics and bisimulation as a congruence

Information and Computation
Transition system specifications with negative premises

Theoretical Computer Science
Bisimulation can't be traced

Journal of the ACM (JACM)
Ntyft/ntyxt rules reduce to ntree rules

Information and Computation
The meaning of negative premises in transition system specifications

Journal of the ACM (JACM)
The algebra of communicating processes with empty process

ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Language preorder as a precongruence

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
Linear and Branching Structures in the Semantics and Logics of Reactive Systems

Proceedings of the 12th Colloquium on Automata, Languages and Programming
The Linear Time-Branching Time Spectrum (Extended Abstract)

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Meaning of Negative Premises in Transition System Specifications II

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Full Abstraction in Structural Operational Semantics (Extended Abstract)

AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Ready, Set, Go: Structural Operational Semantics for Linear-Time Process Algebras

Ready, Set, Go: Structural Operational Semantics for Linear-Time Process Algebras

A comparison of Statecharts step semantics

Theoretical Computer Science
Precongruence formats for decorated trace semantics

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.01

Visualization

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.