A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fi xed set C of Boolean functions. We consider the problem of determining whether two given constraint satisfaction instances are equivalent in the sense that they possess the same sets of satisfying assignments. We prove a Dichotomy Theorem by showing that for all sets C of allowed constraints, this problem is either polynomial-time solvable or coNP-complete, and we give a simple criterion to determine which case holds. Another equivalence problem...

this document, several methods of AC for stream traffic based on declared parameters and using bufferless multiplexing are proposed.

this document, several methods of AC for stream traffic based on declared parameters and using bufferless multiplexing are proposed

Abstract. In this paper we propose a functional description of Markov chains (MCs) using recursive stochastic equations and factor distributions instead of the state transition matrix P. This new modelling method is very intuitive as it separates the functional behavior of the system under study from probabilistic factors. We present the “forward algorithm ” to calculate consecutive state distributions xn. It is numerically equivalent to the well-known vector-matrix multiplication method xn+1 = xn · P, but it can be faster and require less memory. We compare the operation and efficiency of the power method and MC simulation. Then, we propose several optimization techniques to speed up the computation of the stationary state distribution based on consecutive state distributions, to accelerate the forward algorithm, and to save its memory requirements. The presented concept has been implemented in a tool including all optimization methods. To make this paper easily accessible to novices, a tutorial-like introduction to MCs is given. 1

Abstract not found