A fully abstract denotational model for observational precongruence

Anna Ingólfsdóttir; Andrea Schalk

doi:10.1016/S0304-3975(99)00117-6

A fully abstract denotational model for observational precongruence

Anna Ingólfsdóttir, Andrea Schalk

Research output: Contribution to journal › Article › peer-review

Abstract

A domain theoretic denotational model is given for a simple sublanguage of CCS extended with divergence operator. The model is derived as an abstraction on a suitable notion of normal forms for labelled transition systems. It is shown to be fully abstract with respect to observational precongruence. © 2001 Elsevier Science B.V. All rights reserved.

Original language	English
Pages (from-to)	35-61
Number of pages	26
Journal	Theoretical Computer Science
Volume	254
Issue number	1-2
DOIs	https://doi.org/10.1016/S0304-3975(99)00117-6
Publication status	Published - 2001

Keywords

Bisimulation
Denotational model
Full abstraction

Access to Document

10.1016/S0304-3975(99)00117-6

Cite this

@article{275f13c5da4f44e7a727c8504462a3eb,

title = "A fully abstract denotational model for observational precongruence",

abstract = "A domain theoretic denotational model is given for a simple sublanguage of CCS extended with divergence operator. The model is derived as an abstraction on a suitable notion of normal forms for labelled transition systems. It is shown to be fully abstract with respect to observational precongruence. {\textcopyright} 2001 Elsevier Science B.V. All rights reserved.",

keywords = "Bisimulation, Denotational model, Full abstraction",

author = "Anna Ing{\'o}lfsd{\'o}ttir and Andrea Schalk",

year = "2001",

doi = "10.1016/S0304-3975(99)00117-6",

language = "English",

volume = "254",

pages = "35--61",

journal = "Theoretical Computer Science",

publisher = "Elsevier BV",

number = "1-2",

}

TY - JOUR

T1 - A fully abstract denotational model for observational precongruence

AU - Ingólfsdóttir, Anna

AU - Schalk, Andrea

PY - 2001

Y1 - 2001

N2 - A domain theoretic denotational model is given for a simple sublanguage of CCS extended with divergence operator. The model is derived as an abstraction on a suitable notion of normal forms for labelled transition systems. It is shown to be fully abstract with respect to observational precongruence. © 2001 Elsevier Science B.V. All rights reserved.

AB - A domain theoretic denotational model is given for a simple sublanguage of CCS extended with divergence operator. The model is derived as an abstraction on a suitable notion of normal forms for labelled transition systems. It is shown to be fully abstract with respect to observational precongruence. © 2001 Elsevier Science B.V. All rights reserved.

KW - Bisimulation

KW - Denotational model

KW - Full abstraction

U2 - 10.1016/S0304-3975(99)00117-6

DO - 10.1016/S0304-3975(99)00117-6

M3 - Article

VL - 254

SP - 35

EP - 61

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-2

ER -

A fully abstract denotational model for observational precongruence

Abstract

Keywords

Access to Document

Fingerprint

Cite this