R.J. van Glabbeek (Stanford)
December 1993
This paper explores the connection between semantic
equivalences for concrete sequential processes, represented
by means of transition systems, and formats of transition
system specifications using Plotkin's structural approach.
For several equivalences in the linear time - branching
time spectrum a format is given, as general as possible,
such that this equivalence is a congruence for all
operators specifiable in that format. And for several
formats it is determined what is the coarsest congruence
with respect to all operators in this format that is finer
than partial or completed trace equivalence.
KEYWORDS: Concurrency, structural operational semantics, labelled
transition systems, semantic equivalences.
-
- Available at ftp://Boole.stanford.edu/pub/sos.ps.gz
- In: Proceedings of the Third International Conference on
Algebraic Methodology and Software Technology (AMAST'93),
Twente, The Netherlands, June 1993, (M. Nivat, C. Rattray,
T. Rus & G. Scollo, eds.), Workshops in Computing,
Springer-Verlag, 1993, pp. 77-84.