TY - GEN A1 - Hurfin, Michel A1 - Raynal, Michel A2 - Korbicz, Józef - red. A2 - Uciński, Dariusz - red. PB - Zielona Góra: Uniwersytet Zielonogórski N2 - The problem tackled in this paper originates from the debugging of distributed applications. Execution of such an application can be modelled as a partially ordered set of process states. The debugging of control flows (sequences of process states) of these executions is based on satisfying the predicates by process states. A process state that satisfies a predicate inherits its label. N2 - In this context, it follows that a distributed execution is a labelled directed acyclic graph (DAG for brevity). To debug or to determine if control flows of a distributed execution satisfy some property amounts to testing if the labelled DAG includes some pattern defined on predicate labels. N2 - This paper first introduces a general pattern (called the diamond necklace) which includes classical patterns encountered in distributed debugging. Then an efficient polynomial-time algorithm detecting such patterns in a labelled DAG is presented. To be easily adapted to an on-the-fly detection of the pattern in distributed executions, the algorithm visits the nodes of the graph according to a topological sort strategy. L1 - http://www.zbc.uz.zgora.pl/Content/57809/AMCS_1997_7_1_12.pdf L2 - http://www.zbc.uz.zgora.pl/Content/57809 KW - sterowanie KW - sterowanie-teoria KW - sztuczna inteligencja KW - matematyka stosowana KW - informatyka T1 - On-the-fly detection of a class of word-based patterns in labelled DAGs UR - http://www.zbc.uz.zgora.pl/dlibra/docmetadata?id=57809 ER -