Now showing items 1-6 of 6

    • Closure Operator Semantics for Concurrent Constraint Logic Programming 

      Jagadeesan, Radhakrishnan; Shanbhogue, Vasant (Cornell University, 1990-12)
      This paper develops a denotation and abstract model based on closure operators for concurrent constraint logic programming. The denotational semantics is built domain theoretically and not from the computation sequences. ...
    • The Expressiveness of Indeterminate Dataflow Primitives 

      Shanbhogue, Vasant (Cornell University, 1990-08)
      This thesis establishes that there are different kinds of indeterminacy in an asynchronous distributed computation setting by studying expressiveness and inexpressiveness situations. We use a particular model of asynchronous ...
    • McCarthy's Amb Cannot Implement Fair Merge 

      Panangaden, Prakash; Shanbhogue, Vasant (Cornell University, 1988-05)
      In this paper, we establish that fair merge is a powerful non-deterministic primitive that cannot be implemented in terms of other well-known primitives. It is well known that fair merge embodies countable non-determinism. ...
    • On the Expressive Power of Indeterminate Network Primitives 

      Panangaden, Prakash; Shanbhogue, Vasant (Cornell University, 1987-12)
      It is well known that a fair merge primitive leads to unbounded indeterminacy. In this paper we show that unbounded indeterminacy cannot express a fair merge in the setting of Kahn-style dataflow networks. Intuitively, ...
    • The Relationship Between Multiway and Two-Way Fair Merges 

      Shanbhogue, Vasant (Cornell University, 1990-08)
      In the context of communicating systems of autonomous processes, we study two kinds of processes - a two-way fair merge, that interleaves two possibly infinite sequences into one, and a multiway fair merge, that interleaves ...
    • Stabilitly and Sequentiality in Dataflow Networks 

      Panangaden, Prakash; Shanbhogue, Vasant; Stark, Eugene W. (Cornell University, 1989-11)
      The class of monotone input/output automata has been shown in the authors' previous work to be a useful operational model for a dataflow-style networks of communicating processes. An interesting class of problems arising ...