Learn More
In this paper we give a logical semantics for the class CC of concurrent constraint programming languages and for its extension LCC based on linear constraint systems. Besides the characterization in intuitionistic logic of the stores of CC computations, we show that both the stores and the successes of LCC computations can be characterized in(More)
In this article we present the Biochemical Abstract Machine BIOCHAM and advocate its use as a formal modeling environment for networks biology. Biocham provides a precise semantics to biomolecular interaction maps. Based on this formal semantics, the Biocham system offers automated reasoning tools for querying the temporal properties of the system under all(More)
We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension of a host language, such as Pro-log or Java, this type system is parameterized by the type system of the host language. We show the consistency of the type system for CHR w.r.t. its(More)
We introduce a formalism to represent and analyze protein–protein and protein–DNA interaction networks. We illustrate the expressivity of this language, by proposing a formal counterpart of Kohn's compilation on the mammalian cell-cycle control. This eeectively turns an otherwise static knowledge into a discrete transition system incorporating a qualitative(More)
Finding mathematical models satisfying a specification built from the formalization of biological experiments, is a common task of the modeller that techniques like model-checking help solving, in the qualitative but also in the quantitative case. In this article we propose to go one step further by defining a continuous degree of satisfaction of a temporal(More)