Processes and the denotational semantics of concurrency

Bakker, J. W. de; Zucker, Jeffery I.

doi:10.1016/s0019-9958(82)91250-5

Cited by 248 publications

(172 citation statements)

References 33 publications

Supporting

Mentioning

171

Contrasting

Unclassified

Order By: Relevance

“…It was introduced first in [BZ82] (in the context of metric spaces), where it was defined directly on a collection of processes (very similar to our P), without making use of transition systems.…”

Section: I(a) = Ap = {(Ai(e))} T(t:) Ep = {(Ji(o))} I(6) = Op= 0 I(mentioning

confidence: 99%

Initial algebra and final coalgebra semantics for concurrency

Rütten

Turi

1994

A Decade of Concurrency Reflections and Perspectives

View full text Add to dashboard Cite

Abstract. The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and some conditions are given under which they coincide. More precisely, it is shown how to derive initial semantics from final semantics, using the initiality and finality to ensure their equality. Moreover, many facts about congruences (on algebras) and (generalized) bisimulations (on coalgebras) are shown to be dual as well.

show abstract

Section: I(a) = Ap = {(Ai(e))} T(t:) Ep = {(Ji(o))} I(6) = Op= 0 I(mentioning

confidence: 99%

Initial algebra and final coalgebra semantics for concurrency

Rütten

Turi

1994

A Decade of Concurrency Reflections and Perspectives

View full text Add to dashboard Cite

show abstract

“…They consist of the operational semantics Od, based on the derivation relation f-, and of the declarative semantics Deel,,, and Declfl based on model theory and fixed-point theory, respectively. The other semantics, namely the denotational semantics Den, is issued from the imperative tradition, and, more particularly, from its metric semantic branch ( [6], [5], [14], ... ). It describes computations, in a compositional way, via histories, possibly including hypotheses.…”

Section: Resultsmentioning

confidence: 99%

Extended Horn clauses: the framework and some semantics

Jacquet¹,

Monteiro

1991

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The purpoee of this paper is twofold: to introduce a new extension of concurrent logic programming languages aiming at handling synchronicity and to present and compare several semantics for it. The extended framework -ntially rests on an extension of Horn clauses, including multiple atoms in their head.a and a guard construct, u well u. a new operator between goals. The semantics discUlllled conaiat of four semantics. They range in the operational, declarative and denotational types and are issued both from the logic programming tradition and the imperative tradition. They are compos8d of an operational semantics, describing the ( claasical) success set a.nd failure set, of two declarative semantics, extending the Herbrand interpretation and the immediate consequence operator to the extended framework, and of a denotational semantics, defined compositionally and on the basis of histories pouibly involving hypothetical statements. The mathematical tools mainly used are complete lattices a.nd complete metric spaces.

show abstract

“…Using a projective limit construction as with ACP in [7], or a topological completion as in [3,4], it is possible to construct larger models with infinite processes, in which aZZ guarded systems of equations can be solved.…”

Section: Mail Via a Channelmentioning

confidence: 99%