CSP-OZ is an integrated formal method which combines the state-oriented method Object-Z with the process algebra CSP, thereby allowing a description of static as well as dynamic aspects of a system. Checking correctness of CSP-OZ specifications can be done via a translation into (FDR-)CSP, on which automatic verification can be performed with the tool FDR if the resulting CSP process is not too...

This contribution aims to combine hybrid automata with CSP establishing a connection between the elements of hybrid automata and CSP processes using an approach for the decomposition of hybrid systems. As a result we obtain a transformation from hybrid automata into CSP processes, written in Hoare-CSP in the untimed parts and in real-time CSP or HCSP in the timed parts. These processes provide ...

The synaptic vesicle-associated cysteine-string protein (CSP) is important for synaptic transmission. Previous studies revealed multiple defects at neuromuscular junctions (NMJs) of csp null-mutant Drosophila, but whether these defects are independent of each other or mechanistically linked through J domain mediated-interactions with heat-shock cognate protein 70 (Hsc70) has not been establishe...

Promise Constraint Satisfaction Problems (\(\mathrm{PCSP}\)) were proposed recently by Brakensiek and Guruswami as a framework to study approximations for (\(\mathrm{CSP}\)). Informally \(\mathrm{PCSP}\) asks distinguish between whether given instance of \(\mathrm{CSP}\) has solution or not even specified relaxation can be satisfied. All currently known tractable \(\mathrm{PCSP}\)s reduced in n...

In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to be NP-complete; so that heuristic techniques are usually used. The main contribution of this work is twofold: (i) a technique for de-composing a CSP into a DFS-tree CSP structure; (ii) an heuristic search technique for solving ...

The idea of synthesizing bounded length plans by compiling planning problems into a combinatorial substrate, and solving the resulting encodings has become quite popular in recent years. Most work to-date has however concentrated on compilation to satis ability (SAT) theories and integer linear programming (ILP). In this paper we will show that CSP is a better substrate for the compilation appr...

Circumsporozoite protein (CSP) is the dominant protein on the surface of Plasmodium sporozoites and plays a critical role in the invasion by sporozoites of hepatocytes. Contacts between CSP and heparin sulfate proteoglycans (HSPGs) lead to the attachment of sporozoites to hepatocytes and trigger signaling events in the parasite that promote invasion of hepatocytes. The precise sequence elements...

Arc consistency and generalized arc consistency are two of the most important local consistency techniques for binary and non-binary classic constraint satisfaction problems (CSPs). Based on the Semiring CSP and Valued CSP frameworks, arc consistency has also been extended to handle soft constraint satisfaction problems such as fuzzy CSP, probabilistic CSP, max CSP, and weighted CSP. This exten...

Constraint programming is gaining a great deal of attention because many combinatorial problems especially in areas of planning and scheduling can be expressed in a natural way as a Constraint Satisfaction Problem (CSP). It is well known that a non-binary CSP can be transformed into an equivalent binary CSP using some of the actual techniques. However, when the CSP is not discrete or the number...