J.W. de Bakker, J.-J.Ch. Meyer, E.-R Olderog, and J.I. Zucker. Transition systems, metric spaces and ready sets in the semantics of uniform concurrency. Journal of Computer and System Sciences, 36(2):158--224, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Complete Order-theoretic Model for the Algebra of.. - Knijnenburg (1994) (Correct)
....specified by a recursive domain equation like P = P (fffig A A Theta P) Here A is the set of atomic actions and ffi 62 A is a special constant coding the denotation of the deadlocked process. These kinds of domain equations can be found in numerous places in the literature, for example [Abr91a, dBMOZ88, dBR92, HP79]. The domain equation above is used in this paper. Intuitively, the domain P codes finitely branching, possibly infinite trees labeled by atomic actions. Since both denotational and bisimulation semantics for a particular language are based on trees labeled by elementary actions, we expect that ....
....by elementary actions, we expect that they are closely connected. In this paper we make this connection precise in one particular case. We study a small and well known concurrent programming language: denotational models for (subsets of) it, or closely related languages, have been formulated in [Abr91a, dBMOZ88, HP79, MM79, Rut90]. We give a denotational model based on the models given in those papers. The language is the term language of the process algebra ACP [BW91, BK84, BK85] We present a denotational model for the language based on the models given in the papers cited above. The main result of this paper is that ....
J.W. de Bakker, J.-J.Ch. Meyer, E.-R Olderog, and J.I. Zucker. Transition systems, metric spaces and ready sets in the semantics of uniform concurrency. Journal of Computer and System Sciences, 36(2):158--224, 1988.
Comparative Semantics for a Process Language With Probabilistic .. - den Hartog (1998) (Correct)
....kind of choice. The term probability is used for the different options created by the second, probabilistic, kind of choice. Two different interpretations of choice, local and global, are investigated. Local and global non deterministic choice have been studied extensively. For instance in [5], 19] and more recently in [2] where local choice is called static choice and global choice is called dynamic choice. For probabilistic choice, the interpretation as local or global has not been investigated much. The difference between the two interpretations of choice is the influence of the ....
J.W. de Bakker, J.-J.Ch. Meyer, E.-R. Olderog, and J.I. Zucker. Transition systems, metric spaces and ready sets in the semantics of uniform concurrency. Journal of Computer and System Sciences, 36:158--224, 1988.
Asynchronous Rendez-Vous in Distributed Logic Programming - Eliëns, de Vink (1993) (Correct)
....call. Metric spaces The development of the semantics of B takes place in a metrical setting. The use of metric topology for the formulation of denotational semantics of programming languages has been advocated over the years by De Bakker and co workers. See, e.g. de Bakker and Zucker, 1982] [de Bakker et al., 1988], America et al., 1989] de Boer et al., 1990] Here, following the method proposed in [Kok and Rutten, 1990] not only the denotational semantics but also the operational semantics, and moreover, the equivalence of the operational and (a projection of) the denotational semantics is established ....
J.W. de Bakker, J.-J.Ch. Meyer, E.-R. Olderog and J.I. Zucker, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Journal of Computer and System Sciences 36 (1988), 158-224
Unification in an Algebra With Choice and Action Prefix. - Drost (1994) (Correct)
....where the first component is an atomic action or a variable, and the second component is a Pset or a set containing a special symbol p . Definition 2.10 A Pset is a finite set of pairs (d; q) with d 2A[V and q a Pset or q = f p g. The idea of modeling processes as sets of pairs comes from [BMOZ88]. A Pset q is a state of a Pset p if p = q, or (a; p 0 ) 2 p for some a 2A and q is a state of p 0 . A Pset with a finite number of states is called regular. The domain D of P consists of all regular Psets in which variables x2V only occur in pairs (x; f p g) The operators of P are Phi ....
Bakker, J.W. de, J.-J. Meyer, E.-R. Olderog, and J.I. Zucker: Transition Semantics, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency. J. of Comp. and Syst. Sci. 36, pp. 158-224. 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC