Vineet Gupta - Academia.edu (original) (raw)
Uploads
Papers by Vineet Gupta
A Chu space is a binary relation between two sets. In this thesis we show that Chuspaces form a n... more A Chu space is a binary relation between two sets. In this thesis we show that Chuspaces form a non-interleaving model of concurrency which extends event structureswhile endowing them with an algebraic structure whose natural logic is linear logic.We provide several equivalent definitions of Chu spaces, including two pictorialrepresentations. Chu spaces represent processes as automata or schedules, and Chuduality gives a simple way of converting between schedules and automata. We showthat ...
Proceedings of the Eighth ACM International Conference on Web Search and Data Mining - WSDM '15, 2015
This paper presents a model for the Sprint AERCam, a beachball sized robotic camera that floats a... more This paper presents a model for the Sprint AERCam, a beachball sized robotic camera that floats around in the cargo bay of the Space Shuttle, allowing the astronauts and ground mission control to have an additional view of the task they are trying to accomplish. It has a self contained propulsion system, giving it the capability to maneuver with six degrees of freedom. We present a model for the AERCam written in Hybrid cc, an extension of cc programming for modeling continuous/discrete systems. We modeled both the dynamics and control of the AERCam in Hybrid cc, and interfaced this model with an animation interface which allows a user to interact with the model in real-time.
This paper explores Lhc expressive power of Lhc tcc paradigm. The origin ofLhc work in Lhc inLcgr... more This paper explores Lhc expressive power of Lhc tcc paradigm. The origin ofLhc work in Lhc inLcgraLion of synchronous and consLrainL programming is described.The basic conceptual and maLhcmaLical framework developed in Lhcspirk of Lhc model-based approach characLcrisLic of LhcorcLical compuLcr scienceis reviewed. Wc show LhaL a range of consLrucLs for expressing LimcouLs,prccmpLion and oLhcr complicaLcd paLLcrns of Lcmporal acLivky arc
Information and Computation, 2010
Labelled Markov processes are probabilistic versions of labelled transition systems. In general, ... more Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. In this paper, we study approximation techniques for continuous-state labelled Markov processes. We show that the collection of labelled Markov processes carries a Polish-space structure with a countable basis given by finite-state Markov chains with rational probabilities; thus permitting the approximation of quantitative observations (e.g. an integral of a continuous function) of a continuous-state labelled Markov process by the observations on nite-state Markov chains. The primary technical tools that we develop to reach these results are A variant of a finite-model theorem for the modal logic used to characterize bisimulation, and an isomorphism between the poset of Markov processes (ordered by simulation) with the !-continuous dcpo Proc (defined as the solution of the recursive domain equation Proc = Q L P Pr (Proc)). ...
A Chu space is a binary relation between two sets. In this thesis we show that Chuspaces form a n... more A Chu space is a binary relation between two sets. In this thesis we show that Chuspaces form a non-interleaving model of concurrency which extends event structureswhile endowing them with an algebraic structure whose natural logic is linear logic.We provide several equivalent definitions of Chu spaces, including two pictorialrepresentations. Chu spaces represent processes as automata or schedules, and Chuduality gives a simple way of converting between schedules and automata. We showthat ...
Proceedings of the Eighth ACM International Conference on Web Search and Data Mining - WSDM '15, 2015
This paper presents a model for the Sprint AERCam, a beachball sized robotic camera that floats a... more This paper presents a model for the Sprint AERCam, a beachball sized robotic camera that floats around in the cargo bay of the Space Shuttle, allowing the astronauts and ground mission control to have an additional view of the task they are trying to accomplish. It has a self contained propulsion system, giving it the capability to maneuver with six degrees of freedom. We present a model for the AERCam written in Hybrid cc, an extension of cc programming for modeling continuous/discrete systems. We modeled both the dynamics and control of the AERCam in Hybrid cc, and interfaced this model with an animation interface which allows a user to interact with the model in real-time.
This paper explores Lhc expressive power of Lhc tcc paradigm. The origin ofLhc work in Lhc inLcgr... more This paper explores Lhc expressive power of Lhc tcc paradigm. The origin ofLhc work in Lhc inLcgraLion of synchronous and consLrainL programming is described.The basic conceptual and maLhcmaLical framework developed in Lhcspirk of Lhc model-based approach characLcrisLic of LhcorcLical compuLcr scienceis reviewed. Wc show LhaL a range of consLrucLs for expressing LimcouLs,prccmpLion and oLhcr complicaLcd paLLcrns of Lcmporal acLivky arc
Information and Computation, 2010
Labelled Markov processes are probabilistic versions of labelled transition systems. In general, ... more Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. In this paper, we study approximation techniques for continuous-state labelled Markov processes. We show that the collection of labelled Markov processes carries a Polish-space structure with a countable basis given by finite-state Markov chains with rational probabilities; thus permitting the approximation of quantitative observations (e.g. an integral of a continuous function) of a continuous-state labelled Markov process by the observations on nite-state Markov chains. The primary technical tools that we develop to reach these results are A variant of a finite-model theorem for the modal logic used to characterize bisimulation, and an isomorphism between the poset of Markov processes (ordered by simulation) with the !-continuous dcpo Proc (defined as the solution of the recursive domain equation Proc = Q L P Pr (Proc)). ...