Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
We propose a formal experimental paradigm designed to help evaluate scrolling interaction techniques. Such a method is needed by interaction designers to quantify scrolling perfor...
Ken Hinckley, Edward Cutrell, Steve Bathiche, Tim ...
—We propose a software engineering process to aid the development of Dynamic Software Architectures (DSAs). This process is based on the sequential application of a number of for...
Maurice H. ter Beek, Antonio Bucchiarone, Stefania...
This paper describes a complete denotational semantics, in the UTP framework, of slotted-Circus, a generic framework for reasoning about discrete timed/synchronously clocked system...
SOFL is a formal language and method for software system analysis, specification and design and it fully supports structured techniques and object-oriented techniques. AOP (Aspect...