ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Object-oriented analysis suggests semiformal usecase driven techniques for problem domain modeling from a computation independent viewpoint. The proposed approach called Topologic...
Abstract. Defining functions is a major topic when building mathematical repositories. Though relatively easy in mathematical vernacular, function definitions rise a number of qu...
We present a logic for reasoning about strategic games. The logic is a modal formalism, based on the Coalition Logic of Propositional Control, to which we add the notions of outco...
Nicolas Troquard, Wiebe van der Hoek, Michael Wool...
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...