China
Africa
Explore chapters and articles related to this topic
Modern Methods for Characterization of Social Networks through Network Models
Published in Natalie M. Scala, James P. Howard, Handbook of Military and Defense Operations Research, 2020
Christine M. Schubert Kabban, Fairul Mohd-Zaid, Richard F. Deckro
Lagraa et al. (2014) proposed a new distance measure for comparing graphs using modular decomposition for obtaining prime graphs. This is then used to compare with other network’s prime graphs using probe distance, which measures the number of edit operations needed to transform one graph into a second graph. Modular decomposition is first used to obtain prime graphs which are graphs that have only trivial modules. The authors then used select datasets to perform comparisons and classifications. The resulting distance and computation time were then compared against those obtained using regular edit distance and star distance, which was proposed by Zeng et al. (2009). The results showed that the prime distance is only comparable to the star distance in terms of runtime and acts as an upper bound for the star distance.
Memory-loss resilient controller design for temporal logic constraints
Published in Cyber-Physical Systems, 2021
M. Abate, W. Stuckey, L. Lerner, E. Feron, S. Coogan
As shown in Theorem 4.1, the guarantees of a history-register-based controller derive from the invertibility of the monitor automaton . Intuitively, a non-invertible monitor automaton will contain two or more symmetrically labelled cycles, so that the system’s progress towards the satisfaction of cannot be determined by any history fragment of finite length (see Example 2). As such, one can show that is -step invertible by calculating all transition-cycles of length and then checking that no two cycles are symmetric under cyclic permutation. This procedure can be accomplished using the standard graph search algorithms; transition-cycles, for instance, can be identified using a recursive depth first search to produce a modular decomposition of all possible cycles of states in . Such a search will produce a finite set of minimum length sub-cycles, from which all of possible cycles can be characterised.