279 search results - page 4 / 56 » Testing for Refinement in CSP |
ENTCS
2007
14 years 9 months ago
2007
We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a si...
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...
FORTE
2001
14 years 11 months ago
2001
Abstract Subtyping relations for object-oriented formalisms describe relationships between super- and subclasses which satisfy the substitutability requirement imposed on types and...
FM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Circus is a combination of Z and CSP that supports the development of state-rich reactive systems based on refinement. In this paper we present JCircus, a tool that autom...
ICALP
2007
Springer
15 years 1 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...