This paper investigates questions related to the modularity in discrete models of biological interaction networks. We develop a theoretical framework based on the analysis of their asymptotic dynamics. More precisely, we exhibit formal conditions under which agents of interaction networks can be grouped into modules. As a main result, we show that the usual decomposition in strongly connected c...

Let −→ Λ be an infinite, locally finite oriented multi-graph with C− → Λ finite and strongly connected, and let p < pH( −→ Λ ). Menshikov’s theorem states that there exists an α > 0 s.t. Pp(x n →) ≤ exp(−αn/(logn)) for all sites x and n ≥ 2. In this paper, we begin backwards, explaining the importance of this theorem and then giving a sketch of the proof, emphasizing the intuition and motivatio...

let $a$ be a nite dimensional $k-$algebra and $r$ be a locally bounded category such that $r rightarrow r/g = a$ is a galois covering dened by the action of a torsion-free group of automorphisms of $r$. following [30], we provide criteria on the convex subcategories of a strongly simply connected category r in order to be a cycle- nite category and describe the module category of $a$. we pro...

In the current world, performance is one of the most important issues concerning work and competition. Performance is strongly connected with learning and when it comes to acquiring new knowledge, attention is one the most important mechanisms as the level of the learner’s attention affects learning results. When students are doing learning activities using new technologies, it is extremely imp...

This paper presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the execution rate is maximal and place sizes are minimal. The proposed algorithm provides transition schedules represented as binary words. These words are chosen to be balanced. The contributions of this paper is the proposed algorith...

We introduce the notion of reset left regular decomposition of an ideal regular language and we prove that the category formed by these decompositions with certain morphisms is equivalent to the category of strongly connected synchronizing automata. We show that each ideal regular language has at least a reset left regular decomposition. As a consequence, each ideal regular language is the set ...

Regional Economic Growth and Human Capital: The Role of Overeducation The paper analyses the link between human capital and regional economic growth in the European Union. Using various indicators of human capital calculated from census microdata, we conclude that the recent economic performance of European regions is associated with an increase in overeducation. In fact, measures of educationa...

Norms can be used in the scope of distributed computational systems to provide reliable contexts of interaction between parties where acceptable behaviour is specified in terms of regulations or guidelines. These have been explored in various formalisations, and many are the theoretical frameworks that allow to implement and operationalise them. However, when applying these frameworks to comple...

Since A. Robinson’s work, this result has been shown valid for a large class of logic and recently has received generalizations in institutions [8]. One of the main reason why a logic should have RCP is because of “modular theory building”. Indeed, RCP has been shown to be equivalent to Craig’s interpolation property (CIP), and CIP is strongly connected to modularity in specification theory [2,...

A maximally connected digraph is said to be superconnected if every minimum disconnecting set F of vertices is trivial, i.e., it consists of the vertices adjacent to or from a given vertex not belonging to F . In this work, it is shown that a digraph is maximally connected provided that a certain condition on the diameter holds, and superconnected under a more restrictive constraint. These cond...