Results 1 to 10 of about 92,793 (304)
Some of the next articles are maybe not open access.
2009
The process algebra CSP is designed for specifying interactions between concurrent systems. In CSP, and related languages, concurrent processes synchronise on common events, while the internal operations of the individual processes are treated abstractly.
Robert Colvin, Ian J. Hayes
openaire +3 more sources
The process algebra CSP is designed for specifying interactions between concurrent systems. In CSP, and related languages, concurrent processes synchronise on common events, while the internal operations of the individual processes are treated abstractly.
Robert Colvin, Ian J. Hayes
openaire +3 more sources
Journal of Logic and Computation, 1994
The multiplicative fragment of linear logic is studied with the aim to simulate parallel computations. A translation is defined which transforms proofs of this formalism into communicating sequential processes (CSP). This translation is determined by a step-by-step correspondence between the cut-elimination process and the CSP execution. In section 3 a
openaire +1 more source
The multiplicative fragment of linear logic is studied with the aim to simulate parallel computations. A translation is defined which transforms proofs of this formalism into communicating sequential processes (CSP). This translation is determined by a step-by-step correspondence between the cut-elimination process and the CSP execution. In section 3 a
openaire +1 more source
Why Is CSP Failing? Trends and Challenges in CSP Adoption
2014Content Security Policy (CSP) has been proposed as a principled and robust browser security mechanism against content injection attacks such as XSS. When configured correctly, CSP renders malicious code injection and data exfiltration exceedingly difficult for attackers.
Michael Weissbacher +2 more
openaire +2 more sources
Semiring-based CSPs and valued CSPs: Basic properties and comparison
1996In this paper we describe two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. We then compare the two approaches and we discuss the relationship between them.
Stefano Bistarelli +5 more
openaire +3 more sources
Algorithms for Stochastic CSPs
2006The Stochastic CSP (SCSP) is a framework recently introduced by Walsh to capture combinatorial decision problems that involve uncertainty and probabilities. The SCSP extends the classical CSP by including both decision variables, that an agent can set, and stochastic variables that follow a probability distribution and can model uncertain events beyond
Thanasis Balafoutis +1 more
openaire +2 more sources
2013 IEEE Conference on Computational Complexity, 2013
Irit Dinur, Gillat Kol
openaire +3 more sources
Irit Dinur, Gillat Kol
openaire +3 more sources
Does a Virtuous Circle Really Exist? Revisiting the Causal Linkage Between CSP and CFP
Journal of Business Ethics, 2022Audrey Murrell, Xiaoping Zhao
exaly
2008
In this paper the analysis of CSP conception implementation problem for intelligible data analysis by means of Constraint Logic Programming is presented and formal logical substantiation of effective control routine for constraints set is introduced on the base of example data from oil&gas subject domain.
openaire +1 more source
In this paper the analysis of CSP conception implementation problem for intelligible data analysis by means of Constraint Logic Programming is presented and formal logical substantiation of effective control routine for constraints set is introduced on the base of example data from oil&gas subject domain.
openaire +1 more source
2004
Constraint Satisfaction problems (CSPs) are a fundamental concept used in many real world applications such as frequency assignment, configuration and conceptual design, scheduling and planning. A main challenge when designing a CSP-based system is the ability to deal with constraints in a dynamic and evolutive environment.
openaire +1 more source
Constraint Satisfaction problems (CSPs) are a fundamental concept used in many real world applications such as frequency assignment, configuration and conceptual design, scheduling and planning. A main challenge when designing a CSP-based system is the ability to deal with constraints in a dynamic and evolutive environment.
openaire +1 more source

