Metric semantics for concurrency

Bakker, J. W. de; Meyer, J.-J. Ch.

doi:10.1007/bf01941131

Cited by 34 publications

(29 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The initial semantics of the example in Section 3.6 coincides with (a variant of) a compositional model given in [BM88]. Similarly, the linear semantics of Section 5 is essentially the compositional model from [HP79].…”

Section: /3: S--+ P1(axs)mentioning

confidence: 90%

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: /3: S--+ P1(axs)mentioning

confidence: 90%

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

“…This general method for comparing different semantic models has already been applied successfully to several programming paradigms varying from notions related to concurrency [7] to notions related to logic programming [4] and object-oriented programming [28]. The present paper shows another application of this technique.…”

Section: Introductionmentioning

confidence: 89%

“…This programming language is an extension of one of the languages studied in [7]. The language is uniform, i.e.…”

Section: Language Definitionmentioning

confidence: 99%

Comparative semantics for a real-time programming language with integration

Breugel

1991

Tapsoft '91

View full text Add to dashboard Cite

An operational and a denotational semantic model are presented for a real-time programming language incorporating the concept of integration. Integration enables us to specify a restricted form of unbounded non-determinism. For example, the execution of an action at an arbitrary moment in a time interval can be specified using the concept of integration. The operational and the denotational model are proved to be equivalent using a general method based on higher-order transformations and complete metric spaces. Banach~s fixed point theorem, which states that a contraction on a complete metric space has a unique fixed point, will be used to define and to compare semantic models. Also Michael's theorem, which roughly states that a compact union of compact sets is compact, will be used for the definition of semantic models. I n t r o d u c t i o nI~eal-time programming can be viewed as traditional concurrency supplied with timing constraints [81]. Because these timing constraints cause more complexity, the advantages of high-level languages are even greater in real-time programming than in concurrency and sequential programming. Several languages, like RTL [22], have been designed specifically for real-time programming. Other languages are extensions of already existing languages, for example, the language TCSP [14] is an extension of the language CSP [21]. In real-time programming the correctness of a program depends not only on the flow of control. The program should also meet its timing constraints [30]. Therefore new semantic models should be developed. Several models both operational [2,16,19] and denotational [15,24,27] have already been provided.In this paper a simple real-time programming language is studied. Apart from the traditional programming constructs, this language incorporates timed atomic actions and integration. Timed atomic actions are atomic actions each provided with some timing information. This timing information denotes when the atomic action should be executed. The concept of integration has been introduced in [2]. A statement is integrated over a time set, which is a subset of the time domain, i.e. a non-deterministically chosen value from the time set is passed to the statement. Integration enables us to specify the execution of an action at an arbitrary moment in a time interval, for example, fte [1.o3, 2.tq (a,t)

show abstract

“…In [6,7] we have developed an operational ((I)) and a metric denotational (.It) model (the same one has the one described below), and proved their equivalence. The operational semantics uses the transition systems of Hennessy and Plotkin [15,23]; as we saw already, the metric model goes back to [2].…”

Section: Introductionmentioning

confidence: 99%

“…4. In addition, a proof technique closely resembling a method used in [7] (in Theorem 2.4.1 of that paper) is applied.…”

Section: Introductionmentioning

confidence: 99%

Order and metric in the stream semantics of elemental concurrency

Bakker¹,

Meyer

1987

Acta Informatica

Self Cite

View full text Add to dashboard Cite

Summary. Two denotational semantics for a language with simple concurrency are presented. The language has parallel composition in the form of the shuffie operation, in addition to the usual sequential concepts including full recursion. Two linear time models, both involving sets of finite and infinite streams, are given. The first model is order-theoretic and based on the Smyth order. The second model employs complete metric spaces. Various technical results are obtained relating the order-theoretic and metric notions. The paper culminates in the proof that the two semantics for the language considered coincide. The paper completes previous investigations of the same language, establishing the equivalence of altogether four semantic models for it.

show abstract

Metric semantics for concurrency

Cited by 34 publications

References 19 publications

Initial algebra and final coalgebra semantics for concurrency

Initial algebra and final coalgebra semantics for concurrency

Comparative semantics for a real-time programming language with integration

Order and metric in the stream semantics of elemental concurrency

Contact Info

Product

Resources

About