Sylvain Soliman

On Coupling Models using Model-Checking: Effects of Irinotecan Injections on the Mammalian Cell Cycle (2010)

Elisabetta De Maria, François Fages, Sylvain Soliman

Abstract. In systems biology, the number of models of cellular processes increases rapidly, but re-using models in different contexts or for different questions remains a challenging issue. In this...

Modelling molecular networks: relationships between different formalisms and levels of details (2010)

Soliman, Sylvain, Chaouiya, Claudine, Batt, Grégory, Fages, François, Remy, Élisabeth, Pommereau, Franck, ...

This document is the deliverable 1.3 of French ANR CALAMAR. It presents a study of different formalisms used for modelling and analyzing large molecular regulation networks, their formal links, in...

Modelling molecular networks: relationships between different formalisms and levels of details (2010)

Soliman, Sylvain, Chaouiya, Claudine, Batt, Grégory, Fages, François, Remy, Élisabeth, Pommereau, Franck, ...

This document is the deliverable 1.3 of French ANR CALAMAR. It presents a study of different formalisms used for modelling and analyzing large molecular regulation networks, their formal links, in...

Abstract interpretation and types for systems biology (2009)

François Fages, Sylvain Soliman

Abstract interpretation is a theory of abstraction that has been introduced for the analysis of programs. In particular, it has proved useful for organizing the multiple semantics of a given...

Formal Cell Biology in Biocham (2009)

François Fages, Sylvain Soliman

Abstract. Biologists use diagrams to represent interactions between molecular species, and on the computer, diagrammatic notations are also employed in interactive maps. These diagrams are...

References (2009)

Sylvain Soliman, François Fages

In the context of cancer treatment, the theory of Chronotherapy relies on the administration of cytotoxic drugs at different times of the day in order to optimise efficacy and lower toxicity. The...

Finding minimal P/T-invariants as a CSP (2009)

Sylvain Soliman

Abstract. We present here a way to compute the minimal semi-positive invariants of a Petri net representing a biological reaction system, as resolution of a CSP. The use of Petri-nets to manipulate...

From Reaction Models to Influence Graphs and Back: a Theorem ⋆ (2009)

François Fages, Sylvain Soliman

Abstract. Biologists use diagrams to represent interactions between molecular species, and on the computer, diagrammatic notations are also more and more employed in interactive maps. These diagrams...

Analyzing various models of Circadian Clock and Cell Cycle coupling (2009)

Csikász-Nagy, Attila, Faure, Adrien, Larcher, Roberto, Lecca, Paola, Mura, Ivan, Jordan, Ferenc, ...

The daily rhythm can influence the proliferation rate of many cell types. In the mammalian system the transcription of the cell cycle regulatory protein Wee1 is controlled by the circadian clock....

A general computational method for robustness analysis with applications to synthetic gene networks (2009)

Rizk, Aurélien, Batt, Gregory, Fages, François, Soliman, Sylvain

Motivation: Robustness is the capacity of a system to maintain a function in the face of perturbations. It is essential for the correct functioning of natural and engineered biological systems....

Model-based Predictions of the Influence of Circadian Clock Genes Knock-Outs on the Cell Cycle (2009)

De Maria, Elisabetta, Fages, Francois, Soliman, Sylvain

The existence of links between the cell division cycle and the circadian clock has been recently discovered. In this research report, we perform a small in silico analysis of how mutations on the...

Model-based Predictions of the Influence of Circadian Clock Genes Knock-Outs on the Cell Cycle (2009)

De Maria, Elisabetta, Fages, Francois, Soliman, Sylvain

The existence of links between the cell division cycle and the circadian clock has been recently discovered. In this research report, we perform a small in silico analysis of how mutations on the...

Model-based Predictions of the Influence of Circadian Clock Genes Knock-Outs on the Cell Cycle (2009)

De Maria, Elisabetta, Fages, Francois, Soliman, Sylvain

The existence of links between the cell division cycle and the circadian clock has been recently discovered. In this research report, we perform a small in silico analysis of how mutations on the...

Model-based Predictions of the Influence of Circadian Clock Genes Knock-Outs on the Cell Cycle (2009)

De Maria, Elisabetta, Fages, Francois, Soliman, Sylvain

The existence of links between the cell division cycle and the circadian clock has been recently discovered. In this research report, we perform a small in silico analysis of how mutations on the...

Model-based Predictions of the Influence of Circadian Clock Genes Knock-Outs on the Cell Cycle (2009)

De Maria, Elisabetta, Fages, Francois, Soliman, Sylvain

The existence of links between the cell division cycle and the circadian clock has been recently discovered. In this research report, we perform a small in silico analysis of how mutations on the...

Model-based Predictions of the Influence of Circadian Clock Genes Knock-Outs on the Cell Cycle (2009)

De Maria, Elisabetta, Fages, Francois, Soliman, Sylvain

The existence of links between the cell division cycle and the circadian clock has been recently discovered. In this research report, we perform a small in silico analysis of how mutations on the...

Pages 1–9 A general computational method for robustness analysis with applications to synthetic gene networks (2009)

Aurélien Rizk, Gregory Batt, François Fages, Sylvain Soliman

Motivation: Robustness is the capacity of a system to maintain a function in the face of perturbations. It is essential for the correct functioning of natural and engineered biological systems....

Context Overview (2008)

Sylvain Soliman

The Biocham 1 [1, 3, 4] software is an environment for developing models of biochemical systems, making simulations, and checking temporal properties. It has allowed to develop a first model of the...

Closures and Modules within Linear Logic Concurrent Constraint Programming (2008)

Rémy Haemmerlé, François Fages, Sylvain Soliman, Inria Rocquencourt France

Abstract. There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of programming...

BIOINFORMATICS BIOCHAM: An Environment for Modeling Biological Systems and Formalizing Experimental Knowledge (2008)

Laurence Calzone, François Fages, Sylvain Soliman

Summary: BIOCHAM (the BIOCHemical Abstract Machine) is a software environment for modeling biochemical systems. It is based on two aspects: (1) the analysis and simulation of boolean, kinetic and...

Closures and Modules within Linear Logic Concurrent Constraint Programming (2008)

Rémy Haemmerlé, François Fages, Sylvain Soliman

Abstract. There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of programming...

S.: Model revision from temporal logic properties in systems biology (2008)

François Fages, Sylvain Soliman, Inria Rocquencourt France

Abstract. Systems biologists build models of bio-molecular processes from knowledge acquired both at the gene and protein levels, and at the phenotype level through experiments done in wild-life and...

On a Continuous Degree of Satisfaction of Temporal Logic Formulae with Applications to Systems Biology (2008)

Aurélien Rizk, Grégory Batt, François Fages, Sylvain Soliman

Abstract. 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...

Linear Concurrent Constraint Programming: Operational and Phase Semantics (2007)

Fran Cois, Paul Ruet, Sylvain Soliman

In this paper we settle 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...

Département de Mathématiques et Informatique (2007)

Uperieure Ormale, N Ecole, Sylvain Soliman, Sylvain Soliman, Victor Vianu, Victor Vianu

We study the expressiveness and complexity of concurrent constraint programming languages over finite domains. We establish strong connections between these languages and query languages in finite...

Expressiveness and Complexity of Concurrent Constraint Programming: a Finite Model Theoretic Approach (2007)

François Fages, Sylvain Soliman, Victor Vianu

We study the expressiveness and complexity of concurrent constraint programming languages over finite domains. We establish strong connections between these languages and query languages in finite...

Département de Mathématiques et Informatique (2007)

Uperieure Ormale, N Ecole, Paul Ruet, Paul Ruet, Sylvain Soliman, Sylvain Soliman

In this paper we settle 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...

A Precise Logical Semantics of Concurrent Constraint Programs (2007)

Sylvain Soliman

We study the relation between Concurrent Constraint Programming languages (CC) and Linear Logic. CC processes have a direct translation into LL formulae which characterizes the entailment-closed...

A Precise Logical Semantics of Concurrent Constraint Programs (2007)

Sylvain Soliman

We study the relation between Concurrent Constraint Programming languages (CC) and Linear Logic. CC processes have a direct translation into LL formulae which characterizes the entailment-closed...

CLP Implementation of a Phase Model Checker (2007)

Sylvain Soliman

The class of Concurrent Constraint programming languages (CC) was introduced a decade ago by Vijay Saraswat as a unifying framework for Constraint Logic Programming (CLP) and concurrent logic...

The Linear Logic Semantics of Concurrent Constraint Programs Revisited (2007)

Sylvain Soliman

Building upon previous work on the logical semantics of concurrent constraint programming languages (CC) in linear logic, we show that a new translation of CC expressions by logical formulae makes it...

(b) (2007)

Francois Fages, Paul Ruet, Sylvain Soliman, Inria Rocquencourt

concurrent constraint programming: operational and phase semantics

Ecole Normale Sup'erieure (2007)

Francois Fages, Paul Ruet, Sylvain Soliman

The class CC of concurrent constraint programming languages and its non-monotonic extension LCC based on linear constraint systems can be given a logical semantics in Girard's intuitionistic...

Phone: (2007)

Francois Fages, Paul Ruet, Sylvain Soliman

concurrent constraint programming: operational and phase semantics

Proceedings of CSCLP 2007: Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming (2007)

Fages, François, Rossi, Francesca, Soliman, Sylvain

Constraints are a natural way to represent knowledge, and constraint programming is a declarative programming paradigm that has been successfully used to express and solve many practical...

Proceedings of CSCLP 2007: Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming (2007)

Fages, François, Rossi, Francesca, Soliman, Sylvain

Constraints are a natural way to represent knowledge, and constraint programming is a declarative programming paradigm that has been successfully used to express and solve many practical...

Abstract interpretation and types for systems biology (2007)

François Fages, Sylvain Soliman

Abstract interpretation is a theory of abstraction that has been introduced for the analysis of programs. In particular, it has proved useful for organizing the multiple semantics of a given...

Proceedings of CSCLP 2007: Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming (2007)

Fages, Francois, Rossi, Francesca, Soliman, Sylvain

Constraints are a natural way to represent knowledge, and constraint programming is a declarative programming paradigm that has been successfully used to express and solve many practical...

Proceedings of CSCLP 2007: Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming (2007)

Fages, Francois, Rossi, Francesca, Soliman, Sylvain

Constraints are a natural way to represent knowledge, and constraint programming is a declarative programming paradigm that has been successfully used to express and solve many practical...

Coupling the Cell cycle and the Circadian Cycle (2006)

Calzone, Laurence, Soliman, Sylvain

Cancer treatments based on the administration of medicines at different times of the day have been shown to be more efficient against malign cells and less damaging towards healthy ones. These...

Coupling the Cell cycle and the Circadian Cycle (2006)

Calzone, Laurence, Soliman, Sylvain

Cancer treatments based on the administration of medicines at different times of the day have been shown to be more efficient against malign cells and less damaging towards healthy ones. These...

On Internalizing Modules as Agents in Concurrent Constraint Programming (2006)

Haemmerle, Remy, Fages, Francois, Soliman, Sylvain

Module systems are an essential feature of programming languages as they facilitate the re-use of existing code and the development of general purpose libraries. There are however two somewhat...

On Internalizing Modules as Agents in Concurrent Constraint Programming (2006)

Haemmerle, Remy, Fages, Francois, Soliman, Sylvain

Module systems are an essential feature of programming languages as they facilitate the re-use of existing code and the development of general purpose libraries. There are however two somewhat...

On Internalizing Modules as Agents in Concurrent Constraint Programming (2006)

Haemmerle, Remy, Fages, Francois, Soliman, Sylvain

Module systems are an essential feature of programming languages as they facilitate the re-use of existing code and the development of general purpose libraries. There are however two somewhat...

On Internalizing Modules as Agents in Concurrent Constraint Programming (2006)

Haemmerle, Remy, Fages, François, Soliman, Sylvain

Module systems are an essential feature of programming languages as they facilitate the re-use of existing code and the development of general purpose libraries. There are however two somewhat...

On Internalizing Modules as Agents in Concurrent Constraint Programming (2006)

Haemmerle, Remy, Fages, Francois, Soliman, Sylvain

Module systems are an essential feature of programming languages as they facilitate the re-use of existing code and the development of general purpose libraries. There are however two somewhat...

On Internalizing Modules as Agents in Concurrent Constraint Programming (2006)

Haemmerle, Remy, Fages, François, Soliman, Sylvain

Module systems are an essential feature of programming languages as they facilitate the re-use of existing code and the development of general purpose libraries. There are however two somewhat...

Coupling the Cell cycle and the Circadian Cycle (2006)

Calzone, Laurence, Soliman, Sylvain

Cancer treatments based on the administration of medicines at different times of the day have been shown to be more efficient against malign cells and less damaging towards healthy ones. These...

BIOINFORMATICS APPLICATIONS NOTE Systems biology (2006)

Laurence Calzone, François Fages, Sylvain Soliman

doi:10.1093/bioinformatics/btl172 BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge

Type inference in systems biology (2006)

François Fages, Sylvain Soliman

Abstract. Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, depending...

Machine learning biochemical networks from temporal logic properties (2006)

Laurence Calzone, Nathalie Chabrier-rivier, François Fages, Sylvain Soliman

Abstract. One central issue in systems biology is the definition of formal languages for describing complex biochemical systems and their behavior at different levels. The biochemical abstract...

Type inference in systems biology (2006)

François Fages, Sylvain Soliman

Abstract. Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, depending...

BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge (2006)

Calzone, Laurence, Fages, François, Soliman, Sylvain

Summary: BIOCHAM (the BIOCHemical Abstract Machine) is a software environment for modeling biochemical systems. It is based on two aspects: (1) the analysis and simulation of boolean, kinetic and...

BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge (2006)

Calzone, Laurence, Fages, François, Soliman, Sylvain

Summary: BIOCHAM (the BIOCHemical Abstract Machine) is a software environment for modeling biochemical systems. It is based on two aspects: (1) the analysis and simulation of boolean, kinetic and...

On Internalizing Modules as Agents in Concurrent Constraint Programming (2006)

Haemmerle, Remy, Fages, Francois, Soliman, Sylvain

Module systems are an essential feature of programming languages as they facilitate the re-use of existing code and the development of general purpose libraries. There are however two somewhat...

Coupling the Cell cycle and the Circadian Cycle (2006)

Calzone, Laurence, Soliman, Sylvain

Cancer treatments based on the administration of medicines at different times of the day have been shown to be more efficient against malign cells and less damaging towards healthy ones. These...

On Internalizing Modules as Agents in Concurrent Constraint Programming (2006)

Haemmerle, Remy, Fages, Francois, Soliman, Sylvain

Module systems are an essential feature of programming languages as they facilitate the re-use of existing code and the development of general purpose libraries. There are however two somewhat...

Coupling the Cell cycle and the Circadian Cycle (2006)

Calzone, Laurence, Soliman, Sylvain

Cancer treatments based on the administration of medicines at different times of the day have been shown to be more efficient against malign cells and less damaging towards healthy ones. These...

BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge (2006)

Calzone, Laurence, Fages, François, Soliman, Sylvain

Summary: BIOCHAM (the BIOCHemical Abstract Machine) is a software environment for modeling biochemical systems. It is based on two aspects: (1) the analysis and simulation of boolean, kinetic and...

Learning Transition Rules from Temporal Logic Properties (2005)

Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain, Calzone, Laurence

Most of the work on temporal representation issues in Machine Learning deals with the problem of learning/mining temporal patterns from a large set of temporal data. In this paper we investigate the...

Learning Transition Rules from Temporal Logic Properties (2005)

Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain, Calzone, Laurence

Most of the work on temporal representation issues in Machine Learning deals with the problem of learning/mining temporal patterns from a large set of temporal data. In this paper we investigate the...

Learning Transition Rules from Temporal Logic Properties (2005)

Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain, Calzone, Laurence

Most of the work on temporal representation issues in Machine Learning deals with the problem of learning/mining temporal patterns from a large set of temporal data. In this paper we investigate the...

Machine Learning Bio-molecular Interactions from Temporal Logic Properties (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, François, Gentils, Lucie, Soliman, Sylvain

With the advent of formal languages for modeling bio-molecu\-lar interaction systems, the design of automated reasoning tools to assist the biologist becomes possible. The biochemical abstract...

Apprentissage de règles de réactions biochimiques à partir de propriétés en logique temporelle (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain

Avec le développement de langages formels pour modéliser les systèmes d' interactions biomoléculaires, la possibilité d'effectuer des calculs symboliques au delà des simulations numér iques...

A Machine Learning approach to Biochemical Reaction Rules Discovery (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain

Beyond numerical simulation, the possibility of performing symbolic computation on bio-molecular interaction networks opens the way to the design of new automated reasoning tools for...

Apprentissage de règles de réactions biochimiques à partir de propriétés en logique temporelle (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain

Avec le développement de langages formels pour modéliser les systèmes d' interactions biomoléculaires, la possibilité d'effectuer des calculs symboliques au delà des simulations numér iques...

A Machine Learning approach to Biochemical Reaction Rules Discovery (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain

Beyond numerical simulation, the possibility of performing symbolic computation on bio-molecular interaction networks opens the way to the design of new automated reasoning tools for...

Machine Learning Bio-molecular Interactions from Temporal Logic Properties (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, François, Gentils, Lucie, Soliman, Sylvain

With the advent of formal languages for modeling bio-molecu\-lar interaction systems, the design of automated reasoning tools to assist the biologist becomes possible. The biochemical abstract...

Learning Transition Rules from Temporal Logic Properties (2005)

Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain, Calzone, Laurence

Most of the work on temporal representation issues in Machine Learning deals with the problem of learning/mining temporal patterns from a large set of temporal data. In this paper we investigate the...

Learning Transition Rules from Temporal Logic Properties (2005)

Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain, Calzone, Laurence

Most of the work on temporal representation issues in Machine Learning deals with the problem of learning/mining temporal patterns from a large set of temporal data. In this paper we investigate the...

Machine Learning Bio-molecular Interactions from Temporal Logic Properties (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, François, Gentils, Lucie, Soliman, Sylvain

With the advent of formal languages for modeling bio-molecu\-lar interaction systems, the design of automated reasoning tools to assist the biologist becomes possible. The biochemical abstract...

Apprentissage de règles de réactions biochimiques à partir de propriétés en logique temporelle (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain

Avec le développement de langages formels pour modéliser les systèmes d' interactions biomoléculaires, la possibilité d'effectuer des calculs symboliques au delà des simulations numér iques...

A Machine Learning approach to Biochemical Reaction Rules Discovery (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain

Beyond numerical simulation, the possibility of performing symbolic computation on bio-molecular interaction networks opens the way to the design of new automated reasoning tools for...

Machine learning bio-molecular interactions from temporal logic properties (2005)

Laurence Calzone, Nathalie Chabrier-rivier, François Fages, Lucie Gentils, Sylvain Soliman

Abstract. With the advent of formal languages for modeling bio-molecular interaction systems, the design of automated reasoning tools to assist the biologist becomes possible. The biochemical...

S.: A machine learning approach to biochemical reaction rules discovery (2005)

Laurence Calzone, Nathalie Chabrier-rivier, François Fages, Sylvain Soliman, Inria Rocquencourt, Projet Contraintes

Beyond numerical simulation, the possibility of performing symbolic computation on biomolecular interaction networks opens the way to the design of new automated reasoning tools for...

Learning Transition Rules from Temporal Logic Properties (2005)

Chabrier-Rivier, Nathalie, Fages, Francois, Soliman, Sylvain, Calzone, Laurence

Most of the work on temporal representation issues in Machine Learning deals with the problem of learning/mining temporal patterns from a large set of temporal data. In this paper we investigate the...

Apprentissage de règles de réactions biochimiques à partir de propriétés en logique temporelle (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, Francois, Soliman, Sylvain

Avec le développement de langages formels pour modéliser les systèmes d' interactions biomoléculaires, la possibilité d'effectuer des calculs symboliques au delà des simulations numér iques...

A Machine Learning approach to Biochemical Reaction Rules Discovery (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, Francois, Soliman, Sylvain

Beyond numerical simulation, the possibility of performing symbolic computation on bio-molecular interaction networks opens the way to the design of new automated reasoning tools for...

Machine Learning Bio-molecular Interactions from Temporal Logic Properties (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, Francois, Gentils, Lucie, Soliman, Sylvain

With the advent of formal languages for modeling bio-molecu\-lar interaction systems, the design of automated reasoning tools to assist the biologist becomes possible. The biochemical abstract...

Learning Transition Rules from Temporal Logic Properties (2005)

Chabrier-Rivier, Nathalie, Fages, Francois, Soliman, Sylvain, Calzone, Laurence

Most of the work on temporal representation issues in Machine Learning deals with the problem of learning/mining temporal patterns from a large set of temporal data. In this paper we investigate the...

Apprentissage de règles de réactions biochimiques à partir de propriétés en logique temporelle (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, Francois, Soliman, Sylvain

Avec le développement de langages formels pour modéliser les systèmes d' interactions biomoléculaires, la possibilité d'effectuer des calculs symboliques au delà des simulations numér iques...

A Machine Learning approach to Biochemical Reaction Rules Discovery (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, Francois, Soliman, Sylvain

Beyond numerical simulation, the possibility of performing symbolic computation on bio-molecular interaction networks opens the way to the design of new automated reasoning tools for...

Machine Learning Bio-molecular Interactions from Temporal Logic Properties (2005)

Calzone, Laurence, Chabrier-Rivier, Nathalie, Fages, Francois, Gentils, Lucie, Soliman, Sylvain

With the advent of formal languages for modeling bio-molecu\-lar interaction systems, the design of automated reasoning tools to assist the biologist becomes possible. The biochemical abstract...

La programmation par contraintes (2004)

Soliman, Sylvain, Fages, François

Grâce à elle, le programme informatique résolvant un problème peut s'écrire de manière très simple, presque comme on l'énoncerait dans le langage naturel. Il s'agit simplement d'écrire, les...

La programmation par contraintes (2004)

Soliman, Sylvain, Fages, François

Grâce à elle, le programme informatique résolvant un problème peut s'écrire de manière très simple, presque comme on l'énoncerait dans le langage naturel. Il s'agit simplement d'écrire, les...

The Biochemical Abstract Machine {BIOCHAM} (2004)

Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain

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...

The Biochemical Abstract Machine {BIOCHAM} (2004)

Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain

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...

The Biochemical Abstract Machine {BIOCHAM} (2004)

Chabrier-Rivier, Nathalie, Fages, François, Soliman, Sylvain

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...

The biochemical abstract machine BIOCHAM (2004)

Nathalie Chabrier-rivier Fran Cois Fages, Sylvain Soliman

Abstract. 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...

Modelling and querying interaction networks in the biochemical abstract machine biocham (2004)

François Fages, Sylvain Soliman, Nathalie Chabrier-rivier

Recent progress in high-throughput data-production technologies pushes research toward systems biology, focusing on the global interaction between the components of biomolecular processes. In this...

The Biochemical Abstract Machine {BIOCHAM} (2004)

Chabrier-Rivier, Nathalie, Fages, Francois, Soliman, Sylvain

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...

The Biochemical Abstract Machine {BIOCHAM} (2004)

Chabrier-Rivier, Nathalie, Fages, Francois, Soliman, Sylvain

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...

Pi-calculus and LCC, a Space Odyssey (2003)

Soliman, Sylvain

We present a translation of the asynchronous pi-calculus into linear concurrent constraint languages (LCC), and use that translation and the recent advances in the logical semantics of LCC to give an...

Pi-calculus and LCC, a Space Odyssey (2003)

Soliman, Sylvain

We present a translation of the asynchronous pi-calculus into linear concurrent constraint languages (LCC), and use that translation and the recent advances in the logical semantics of LCC to give an...

Pi-calculus and LCC, a Space Odyssey (2003)

Soliman, Sylvain

We present a translation of the asynchronous pi-calculus into linear concurrent constraint languages (LCC), and use that translation and the recent advances in the logical semantics of LCC to give an...

Pi-calculus and LCC, a Space Odyssey (2003)

Soliman, Sylvain

We present a translation of the asynchronous pi-calculus into linear concurrent constraint languages (LCC), and use that translation and the recent advances in the logical semantics of LCC to give an...

Pi-calculus and LCC, a Space Odyssey (2003)

Soliman, Sylvain

We present a translation of the asynchronous pi-calculus into linear concurrent constraint languages (LCC), and use that translation and the recent advances in the logical semantics of LCC to give an...

Clpgui: a generic graphical user interface for constraint logic programming over finite domains (2002)

François Fages, Sylvain Soliman, Rémi Coolen, Projet Contraintes Inria-rocquencourt

Abstract. CLPGUI is a generic graphical user interface for visualizing and controlling the execution of constraint logic programs. CLPGUI has been designed to be used in different contexts: initially...

Clpgui: a generic graphical user interface for constraint logic programming over finite domains (2002)

François Fages, Sylvain Soliman, Rémi Coolen, Projet Contraintes Inria-rocquencourt

Abstract. CLPGUI is a generic graphical user interface for visualizing and controlling the execution of constraint logic programs. CLPGUI has been designed to be used in different contexts: initially...

Phase model checking for some linear logic calculi (2001)

Sylvain Soliman

Building upon previous work in the logical semantics of linear concurrent constraint programming languages (LCC), an example of linear logic based calculus, we design an original phase model checking...

Phase Semantics and Verification of Concurrent Constraint Programs (1998)

François Fages, Paul Ruet, Sylvain Soliman

The class CC of concurrent constraint programming languages and its non-monotonic extension LCC based on linear constraint systems can be given a logical semantics in Girard's intuitionistic...

Linear Concurrent Constraint Programming: Operational and Phase Semantics (1998)

François Fages, Paul Ruet, Sylvain Soliman

In this paper we settle 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...

Linear Concurrent Constraint Programming: Operational and Phase Semantics (1997)

Fran Cois, Francois Fages, Paul Ruet, Sylvain Soliman

In this paper we settle 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...

Linear Concurrent Constraint Programming: Operational and Phase Semantics (1997)

François Fages, Paul Ruet, Sylvain Soliman, Inria Rocquencourt

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...

A general computational method for robustness analysis with applications to synthetic gene networks

Rizk, Aurélien, Batt, Gregory, Fages, François, Soliman, Sylvain

Motivation: Robustness is the capacity of a system to maintain a function in the face of perturbations. It is essential for the correct functioning of natural and engineered biological systems....