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 for Uniform Concurrency," Journal of Computer and System Sciences 36, pp. 158-224 (1988). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Continuation Semantics for Prolog with Cut - de Bruin, de Vink (1989) (13 citations) (Correct)
....to logic programming. The denotational and operational semantics of the previous sections are interpreted and extended to handle Prolog. Some concluding remarks are made in section 7. Section 2 Deterministic Transition Systems In this section we introduce the notion of transition system, Pl] [BMOZ]) For reasons of space we restrict ourselves to deterministic transition systems, which already suit our purposes. Collections of transition systems are turned into a cpo such that associating a valuation to a transition system becomes a continuous operation. 2.1) DEFINITION A deterministic ....
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 for Uniform Concurrency," Journal of Computer and System Sciences 36, pp. 158-224 (1988).
Denotational Semantics for Unguarded Recursion: The Demonic Case - de Bruin, de Vink (1990) (Correct)
...., The silent step t which plays a predominant role in algebraic approaches to the semantics of concurrency as, e.g. Mi] BK] will be used in definition 3.3 below to indicate body replacement. Thus we can model procedure calls quite naturally using an axiom instead of a rule. Similar to [BMOZ] for the construct. In the operational semantics O we abstract from this t s, but we will again take them into account with respect to a modified operational model O in section 5. 3.3) DEFINITION A declaration d Decl induces a labeled transition system d which is the smallest subset of ....
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, 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