We integrate two compact data structures for representing state spaces of Petri nets: merged processes and contextual prefixes. The resulting data structure, called contextual merged processes (CMP), combines the advantages of the original ones and copes with several important sources of state space explosion: concurrency, sequences of choices, and concurrent read accesses to shared resources. ...

Although there are many formal representations of architecture, actually determining what an architecture should be when systems are merged is largely based on context and human intuition. The goal of this paper is to find a mathematical model which supports this context and determines the architecture when the systems have been merged. A category of architectural models is presented, and the p...

Existing line segment detectors tend to break up perceptually distinct line segments into multiple segments. We propose an algorithm for merging such broken segments to recover the original perceptually accurate line segments. The algorithm proceeds by grouping line segments on the basis of angular and spatial proximity. Then those line segment pairs within each group that satisfy unique, adapt...

Many merging operators have been proposed to merge either flat or stratified knowledge bases. The result of merging by such an operator is a flat base (or a set of models of the merged base) irrespective of whether the original ones are flat or stratified. The drawback of obtaining a flat merged base is that information about more preferred knowledge (formulae) versus less preferred knowledge i...

EVERY NEWLY elected official has his "probationary" period. There is a short season of luckwishing, f ront running, and freedom from critictsm and carping. Politicians who had oppo.sed the winnnig candidate now come grinning and fawning; newspapers ' had lashed him now find in h i m ' fual i t ies t ha t have miraculously •merged since the ballot box rej tu rns ; the pubhc, tolerant and hopeful...

Detecting the interleaving relationship between sequences is a new research topic which begins to draw much attention. Recently, Huang et al. proposed the merged LCS model, which can be realized as finding the longest common subsequence between a target sequence and two merging sequences. Given the targe sequence T and two merging sequences A and B, Huang et al. gave an O(nmr)-time and O(mr)-sp...