Transition systems, infinitary languages and the semantics of uniform concurrency

Bakker, J. W. de; Meyer, J.-J. Ch.; Olderog, Ernst-Rüdiger; Zucker, Jeffery I.

doi:10.1145/22145.22174

Cited by 16 publications

(10 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For both of them we need various basic definitions which we may use to build the structures in which our semantics are defined. Apart from an occasional point of presentation, no new material is presented here: the definitions stem originally from [18,19] and [2], and are included also in papers such as [3][4][5][6][7].…”

Section: Stream Semantics For Elemental Concurrencymentioning

confidence: 99%

See 1 more Smart Citation

Order and metric in the stream semantics of elemental concurrency

Bakker¹,

Meyer

1987

Acta Informatica

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

Section: Stream Semantics For Elemental Concurrencymentioning

confidence: 99%

“…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%

Order and metric in the stream semantics of elemental concurrency

Bakker¹,

Meyer

1987

Acta Informatica

View full text Add to dashboard Cite

show abstract

“…In the context of complete metric spaces, which is the mathematical framework we adopt, this language (and others similar to it) is treated in [BKMOZ86] and [BMOZ88]. There, an operational semantics 0 and a denotational semantics 6j) for e are presented together with a proof of the correctness of 6D with respect to 0.…”

mentioning

confidence: 99%

Correctness and full abstraction of metric semantics for concurrency

Rütten¹

1989

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency

View full text Add to dashboard Cite

Four different semantic models are given for a simple uniform programming language, containing constructs for parallel composition, global nondeterminism and communication: linear semantics, failure semantics, readiness semantics, and branching semantics. The mathematical framework used consists of complete metric spaces. All models and operators are given as fixed points of suitably defined contractions. This allows for a uniform presentation and an easy comparison of these models. It is shown that the latter three semantics all are correct and that the failure semantics is fully abstract with respect to the linear semantics. Although these results are not new, we believe the uniformity of the way they are presented here to be of some interest.

show abstract

“…Notice that this situation is less frequent under the assumption of fairness, since fairness intensifies the separation power of tests, but it arises nevertheless. A possible way out is to work within the bounds of 'uniform' concurrency [12] : behaviours are then closed sets, and isomorphic semantics are obtained from infinite streams and from finite observations respectively [ii]. In particular, that property holds for the finite state subset of CCS, obtained by forbidding the parallel composition and renaming of open terms [8].…”

mentioning

confidence: 99%

A fully observational model for infinite behaviours of communicating systems

Darondeau

Gamatie

1987

Tapsoft '87

View full text Add to dashboard Cite

Abstr@~This [13,14]. The observational models are naturally homomorphic images of the operational models, but it is not so easy to find out the homomorphism induced by a family of experiments. Indeed, observational models cannot be defined by arbitrary homomorphisms ! A 'concrete' linear model for CCS is the operational model in which programs are rendered by sets of finite and infinite computations. An 'abstract' linear model for CCS is the observational model in which programs are identified if and only if no CCS experiment distinguishes between them. In spite of the effort on models for testing preorders [13,20], that very sensitive model has not yet been worked out, for it has been shown in [10] that some infinite experiments are strictly more sharp than any family of binary tests (finite or infinite). There lays the motivation for the present paper, where we produce the expected model for the full version of pure CCS.Let us proceed to a rapid review of some existing approaches on the side of abstract models, independently of the homomorphisms which induce them as quotients. First of all, one can distinguish between implicit quotient models and explicit models where explicit representations are dealt with [6] . Further separation may be observed between two classes of explicit models, namely the class of purely order theoretic models and the class of mixed space and order theoretic models. Classic ~-algebraic domains are most commonly used in models of the first class [7,13,19,20,24]. For the second class of models, the order relation is the reverse inclusion between closed subsets in some metric completion of languages, trees or tree-languages [11,18,27], and since the considered spaces have denumerable bases, the resulting complete partial (*) rR;gA -Camp,.,s ae r~ea.uL~eu _ F 35o4z RENNES CEDEK

show abstract

Transition systems, infinitary languages and the semantics of uniform concurrency

Cited by 16 publications

References 14 publications

Order and metric in the stream semantics of elemental concurrency

Order and metric in the stream semantics of elemental concurrency

Correctness and full abstraction of metric semantics for concurrency

A fully observational model for infinite behaviours of communicating systems

Contact Info

Product

Resources

About