Jan Rutten
Centrum Wiskunde & Informatica
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Jan Rutten.
Theoretical Computer Science | 1992
F.S. de Boer; Joost N. Kok; Catuscia Palamidessi; Jan Rutten
The main purpose of the paper is to relate different models for Horn Clause Logic: operational, denotational, declarative. We study their relationship by contrasting models based on interleaving, on the one hand, to models based on maximal parallelism, on the other. We make use of complete metric spaces as an important mathematical tool, both in defining and in comparing the various models.
Workshop/School/Symposium of the REX Project (Research and Education in Concurrent Systems) | 1992
F. S. de Boer; Joost N. Kok; Catuscia Palamidessi; Jan Rutten
A general construct for locality in languages based on asynchronous communication is introduced which allows a uniform semantic description of such apparently diverse notions as the introduction of local variables in concurrent imperative languages with shared variables and the hiding of logical variables in concurrent constraint languages.
Theoretical Computer Science | 1991
F.S. de Boer; Jan Rutten; Joost N. Kok; Catuscia Palamidessi
Abstract In this paper we develop semantic models for a class of concurrent logic languages. We give two operational semantics based on a transition system, a declarative semantics and a denotational semantics. One operational and the declarative semantics model the success set, that is, the set of computed answer substitutions corresponding to all successfully terminating computations. The other operational and the denotational semantics also model deadlock and infinite computations. For the declarative and the denotational semantics we extend standard notions such as unification in order to cope with the synchronization mechanism of the class of languages we study. The basic mathematical structure for the declarative semantics is the complete lattice of sets of finite streams of substitutions. In the denotational semantics, we use a complete metric space of tree-like structures that are labelled with functions that represent the basic unification step. We look at the relations between the different models. We relate first the two operational semantics and next the declarative and denotational semantics with their respective operational counterparts.
Archive | 2014
Franck van Breugel; Elham Kashefi; Catuscia Palamidessi; Jan Rutten
This Festschrift volume contains papers presented at a conference, Prakash Fest, held in honor of Prakash Panangaden, in Oxford, UK, in May 2014, to celebrate his 60th birthday. Prakash Panangaden has worked on a large variety of topics including probabilistic and concurrent computation, logics and duality and quantum information and computation. Despite the enormous breadth of his research, he has made significant and deep contributions. For example, he introducedlogic and a real-valued interpretation of the logic to capture equivalence of probabilistic processes quantitatively. The 25 papers included in this volume were carefully reviewed. They cover a large variety of topics in theoretical computer science.
Archive | 1993
Krzysztof R. Apt; J. W. de Bakker; Jan Rutten
The New England Journal of Medicine | 1989
R.J. vanGlabbeek; Jan Rutten; Jan Willem Klop; J.J.C. Meijer
Logic programming languages | 1993
Frank S. de Boer; Joost N. Kok; Catuscia Palamidessi; Jan Rutten
Proceedings of the REX Workshop on Sematics: Foundations and Applications | 1992
Frank S. de Boer; Joost N. Kok; Catuscia Palamidessi; Jan Rutten
Department of Computer Science [CS] | 1989
Paul Klint; Jan Willem Klop; J.J.C. Meijer; Jan Rutten
Journal of Computational Physics | 1991
J. W. de Bakker; Jan Rutten