Sciweavers

1757 search results - page 8 / 352
» Alternating Refinement Relations
Sort
View
IFM
2000
Springer
14 years 1 months ago
Structural Refinement in Object-Z/CSP
State-based refinement relations have been developed for use on the Object-Z components in an integrated Object-Z / CSP specification. However this refinement methodology does not ...
John Derrick, Graeme Smith
EJC
2010
13 years 9 months ago
A q-enumeration of alternating permutations
A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a...
Matthieu Josuat-Vergès
APSEC
2003
IEEE
14 years 1 months ago
Modular refinement in novel schema calculi
Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but ...
Moshe Deutsch, Martin C. Henson, Besnik Kajtazi
DAGSTUHL
2006
13 years 11 months ago
Partial Behavioural Models for Requirements and Early Design
In this paper, we first motivate and summarize our recent work on creation, management, and specifically merging of partial behavioural models, expressed as model transition system...
Marsha Chechik, Greg Brunet, Dario Fischbein, Seba...
IEEEARES
2010
IEEE
14 years 4 months ago
A Complexity Based Model for Quantifying Forensic Evidential Probabilities
- An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexi...
Richard E. Overill, Jantje A. M. Silomon, Kam-Pui ...