Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||
|
|
Rensink, A.
(1995)
An Event-Based SOS for a Language with Refinement.
In: Structures in Concurrency Theory, Berlin, Germany.
pp. 294-309.
Workshops in Computing.
Springer Verlag.
ISBN 3-540-19982-9
Full text available as:
AbstractThe notion of action refinement has been studied intensively in the past few years. It is usually introduced in the form of an operator in a process algebraic language, for which a denotational semantics in a suitable model is then given. In this paper we complement this approach by defining a corresponding operational semantics for refinement, in the form of derivation rules for a transition relation. Because of the (well-known) fact that ordinary transition systems are not expressive enough to capture the effects of refinement, we use an event-based transition system model described elsewhere in the literature. The operational semantics of refinement thus defined is equivalent (in fact event isomorphic) to the usual denotational semantics.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||
