Abstract

ion in Structural Operational Semantics (extended abstract) Rob van Glabbeek Computer Science Department, Stanford University Stanford, CA 94305, USA rvg@cs.stanford.edu Abstract 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. 1 Preorders and equivalences on labelled transition systems Definition 1 A labelled transition system (LTS) is a pair (IP; \Gamma!) with IP a set (of processes) and \Gamma!` IP \Theta A \Theta IP for A a se...

Citations

1182	A structural approach to operational semantics - Plotkin - 1981
259	The Linear Time-Branching Time Spectrum - Glabbeek - 1990
183	Structured operational semantics and bisimulation as a congruence - Groote, Vaandrager - 1992
107	Transition System Specification with Negative Premises - Groote - 1990
69	The Meaning of Negative Premises in Transition System Specifications - Bol, Groote - 1996
58	R.: Higher-Level Synchronising Devices in Meije-SCCS - Simone - 1985
51	Bisimulation can't be traced: Preliminary Report - BLOOM, ISTRAIL, et al. - 1988
16	The tyft/tyxt format reduces to tree rules - Fokkink - 1994
5	set, go: Structural operational semantics for linear-time process algebras - Ready - 1993