<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">inf23304</article-id><article-id pub-id-type="doi">10.15388/Informatica.2012.366</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Towards Clique-Based Fusion of Graph Streams in Multi-Function System Testing</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Levin</surname><given-names>Mark Sh.</given-names></name><email xlink:href="mailto:mslevin@acm.org">mslevin@acm.org</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Institute for Information Transmission Problems, Russian Academy of Sciences, 19 Bolshoj Karetny Lane, Moscow 127994, Russia</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>2012</year></pub-date><volume>23</volume><issue>3</issue><fpage>391</fpage><lpage>404</lpage><history><date date-type="received"><day>01</day><month>07</month><year>2011</year></date><date date-type="accepted"><day>01</day><month>03</month><year>2012</year></date></history><abstract><p>The article describes multi-function system testing based on fusion (or revelation) of clique-like structures. The following sets are considered: (i) subsystems (system parts or units/components/modules), (ii) system functions and a subset of system components for each system function, and (iii) function clusters (some groups of system functions which are used jointly). Test procedures (as units testing) are used for each subsystem. The procedures lead to an ordinal result (states, colors) for each component (e.g., ‘out of service’, ‘major faults’, ‘minor faults’, ‘trouble free service’). For each system function a graph over corresponding system components is examined while taking into account ordinal estimates/colors of the components. Further, an integrated graph for each function cluster is considered (this graph integrates the graphs for corresponding system functions). For the integrated graph structure revelation problems are under examination (revelation of some subgraphs which can lead to system faults). Numerical examples illustrate the approach and problems.</p></abstract><kwd-group><label>Keywords</label><kwd>modular systems</kwd><kwd>system testing</kwd><kwd>data fusion</kwd><kwd>data streams</kwd><kwd>graphs</kwd><kwd>clique</kwd><kwd>combinatorial optimization</kwd><kwd>heuristics</kwd></kwd-group></article-meta></front></article>