GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Many model-based approaches for user interface design start from a task model, for which the ConcurTaskTrees notation is frequently used. Despite this popularity and the importance...
—This paper proposes two models of adding relations to a linking pin type organization structure where every pair of siblings in a complete Kary tree of height H is adjacent: (i)...
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...