We describe a new tool called Csp-Prover which is an interactive theorem prover dedicated to refinement proofs within the process algebra Csp. It aims specifically at proofs for infinite state systems, which may also involve infinite non-determinism. Semantically, Csp-Prover supports both the theory of complete metric spaces as well as the theory of complete partial orders. Both these theories ...

In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There are also a number of di erent encodings for representing CSPs as SAT instances. In this paper, we leverage advances in both SAT and CSP solving to present a novel hierarchical portfolio-based approach to CSP solving, which we call Proteus, that does not rely purely on CSP solvers. Inste...

Cysteine string proteins (CSPs) are secretory vesicle proteins bearing a "J domain" and a palmitoylated cysteine-rich "string" region that are critical for neurotransmitter release. The precise role of CSP in neurotransmission is controversial. Here, we demonstrate a novel interaction between CSP, receptor-coupled trimeric GTP binding proteins (G proteins), and N-type Ca2+ channels. G. subunits...

Constraint satisfaction is gaining a great deal of attention because many combinatorial problems especially in areas of Artificial Intelligence 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 numbe...

Abstract Specifying budgets and deadlines using a process algebra like CSP requires an explicit notion of time. The tock -CSP encoding embeds rich flexible approach for modelling discrete-time behaviours with powerful tool support. It uses event , interpreted to mark passage Analysis, however, has traditionally used the standard semantics CSP, which is inadequate reasoning about timed refinemen...