Related papers: On modular decompositions of system signatures
The notion of cosilting module was recently introduced as a generalization of the notion of cotilting module. In this paper, we give a characterization of (partial) cosilting modules in terms of two-term cosilting complexes. Moreover, we…
We study and classify faithfully balanced modules for the algebra of lower triangular $n$ by $n$ matrices. The theory extends known results about tilting modules, which are classified by binary trees, and counted with the Catalan numbers.…
The intuition that a long history is required for the emergence of complexity in natural systems is formalized using the notion of depth. The depth of a system is defined in terms of the number of parallel computational steps needed to…
We examine the issue of stability of probability in reasoning about complex systems with uncertainty in structure. Normally, propositions are viewed as probability functions on an abstract random graph where it is implicitly assumed that…
A relationship between nilpotency and primeness in a module is investigated. Reduced modules are expressed as sums of prime modules. It is shown that presence of nilpotent module elements inhibits a module from possessing good structural…
We study the entanglement structure, i.e., the structure of quantum composite system from operational aspects. The structure is not uniquely determined in General Probabilistic Theories (GPTs) even if we impose reasonable postulate about…
In characteristic zero, semistable principal bundles on a nonsingular projective curve with a semisimple structure group form a bounded family, as shown by Ramanathan in 1970's using the Narasimhan-Seshadri theorem. This was the first step…
Negative probabilities have long been discussed in connection with the foundations of quantum mechanics. We have recently shown that, if signed measures are allowed on the hidden variables, the class of probability models which can be…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
Most theoretical analysis for lifetime distribution explains origins of specific distribution based on independent failure. We develop a unified framework encompassing different lifetime distribution for failure-coupled network systems. We…
The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as directed graphs and regarded up to isomorphism), the sum of…
In a coherent reliability system composed of multiple components configured according to a specific structure function, the distribution of system time to failure, or system lifetime, is often of primary interest. Accurate estimation of…
We use path-integrals to derive a general expression for the semiclassical approximation to the partition function of a one-dimensional quantum-mechanical system. Our expression depends solely on ordinary integrals which involve the…
The contribution of this paper is threefold: first, it defines a framework for modelling component-based systems, as well as a formalization of integration rules to combine their behavior. This is based on finite state machines (FSM).…
We present assume-guarantee contracts for continuous-time linear dynamical systems with inputs and outputs. These contracts are used to express specifications on the dynamic behaviour of a system. Contrary to existing approaches, we use…
We study the set of no-signalling empirical models on a measurement scenario, and show that the combinatorial structure of the no-signalling polytope is completely determined by the possibilistic information given by the support of the…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…
In this paper we introduce the idea of probability in the definition of Sequential Dynamical Systems, thus obtaining a new concept, Probabilistic Sequential System. The introduction of a probabilistic structure on Sequential Dynamical…
Recently Pelayo-V\~{u} Ngoc classified semitoric integrable systems in terms of five symplectic invariants. Using this classification we define a family of metrics on the space of semitoric integrable systems. The resulting metric space is…