Modular automata are symbolic transition systems halfway between families of automata and their synchronized products. They allow for analysis of liveness properties without incurring the state space explosion problem. A modular automaton is composed of modules and a synchronization graph. We consider the problem whether such specifications may be implemented by a distributed Petri net up to la...

In this paper, we discuss the existence and uniqueness of xed points for Banach and Kannancontractions dened on modular spaces endowed with a graph. We do not impose the Δ2-conditionor the Fatou property on the modular spaces to give generalizations of some recent results. Thegiven results play as a modular version of metric xed point results.

let $g$ be a connected graph of order $3$ or more and $c:e(g)rightarrowmathbb{z}_k$‎ ‎($kge 2$) a $k$-edge coloring of $g$ where adjacent edges may be colored the same‎. ‎the color sum $s(v)$ of a vertex $v$ of $g$ is the sum in $mathbb{z}_k$ of the colors of the edges incident with $v.$ the $k$-edge coloring $c$ is a modular $k$-edge coloring of $g$ if $s(u)ne s(v)$ in $mathbb{z}_k$ for all pa...

In this paper, we investigate a modular architecture for ECG beat classification. The feature space is divided into distinct regions and individual classifiers are developed for each region. We compare different combination strategies, and feature space partition strategies. We also describe a novel, batch modular learning method that can be used to incrementally improve the performance of the ...

In the present paper, we refine notion of partial modular metric defined by Hosseinzadeh and Parvaneh to eliminate occurrence discrepancies in non-zero self-distance triangular inequality. support this, discuss non-trivial examples. Finally, prove a common fixed-point theorem for four self-mappings space an application our result; existence solution system Volterra integral equations is discuss...