Search

The classical view of emerging India emphasises the importance of MNCs in the break with the country’s previous development model, which was essentially based on a socialist industrial State. The reality is more qualified, and the continuity between the two eras is stronger than it seems.

Logical modelling and Petri nets constitute two complementary approaches for the dynamical modelling of biological regulatory networks. Leaning on a translation of logical models into standard Petri nets, we propose a formalisation of the notion of circuit functionality in the Petri net framework. This approach is illustrated with the modelling and analysis of a molecular regulatory network involved in the control of Th-lymphocyte differentiation.

We study rules proposed by the biologist R. Thomas relating the structure of a concurrent system of interacting genes (represented by a signed directed graph called a regulatory graph) with its dynamical properties. We prove that the results in [10] are stable under projection, and this enables us to relax the assumptions under which they are valid. More precisely, we relate here the presence of a positive (resp. negative) circuit in a regulatory graph to a more general form of biological differentiation (resp. of homeostasis).

In this paper, a systematic rewriting of logical genetic regulatory graphs in terms of standard Petri net models is proposed. We show that, in the Boolean case, the combination of the logical approach with the standard Petri net framework enables the analysis of isolated regulatory circuits, confirming their most fundamental dynamical properties. Furthermore, two more realistic applications are also presented, the first dealing with the control of the early cell cycles in the developing fly, the second dealing with flower morphogenesis.

In this paper we propose to represent a case using an object oriented model that enables the description of imprecise knowledge using possibility distributions. The proposed search process is based on this modeling and a fuzzy similarity measure is defined. The adaptation process is achieved with propagation of domain constraints in a neighborhood of the retrieved case. We propose a method to define this neighborhood. We illustrate our proposition by an example in the field of machining operation configuration.

This paper presents a connection between the intuitionistic fragment of a non-commutative version of linear logic introduced by the first author (NLI) and concurrent constraint programming (CC). We refine existing logical characterizations of operational aspects of CC, by providing a logical interpretation of finer observable properties of CC programs, namely stores, successes and suspensions.

This paper investigates logical characterizations of some aspects of concurrent constraint (cc) computations. It contains both negative and positive results. We show that intuitionistic logic enables to observe the so-called stores of a concurrent constraint agent, but neither its successes nor its suspensions, even in the monotonic and deterministic case. On the other hand, IMALL (intuitionistic multiplicative and additive linear logic) does enable the observation of successes (but not that of suspensions): we consider a non-monotonic and non-deterministic version of cc, lcc, and we show that the successes of an lcc computation can be characterized logically; this holds also for cc, since cc can be faithfully translated into lcc.