— Synthesis of robot behaviors towards nontrivial goals often requires reasoning about both discrete and continuous aspects of the underlying domain. Existing approaches in build...
Our work is a fundamental study of the notion of approximation in Q-categories and in (U, Q)-categories, for a quantale Q and the ultrafilter monad U. We introduce auxiliary, appro...
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Application domain description precedes requirements engineering, and is the basis for the development of a software or information system that satisfies all expectations of its u...