In this paper we present an original method of analysing the newlyrevised UML2.0 activity diagrams. Our analysis method builds on our formal interpretation of these diagrams with ...
C. Canevet, Stephen Gilmore, Jane Hillston, Le&ium...
— There is not a method for analysing unreplicated factorial designs that performs well for various configurations of number and size of active effects. Moreover, the most popula...
This paper demonstrates how three stochastic process algebras can be mapped on to a generally-distributed stochastic transition system. We demonstrate an aggregation technique on ...
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...