We de ne a space of random edge-coloured graphs Gn;m; which correspond naturally to edge -colourings of Gn;m. We show that there exist constants K0; K1 21 such that provided m K0n logn and K1n then a random edge coloured graph contains a multi-coloured Hamilton cycle with probability tending to 1, as the number of vertices n tends to in nity.

ÐThe fatality rate associated with severe bacterial infections is about 30 percent and appropriate antibiotic treatment reduces it by half. Unfortunately, about a third of antibiotic treatments prescribed by physicians are inappropriate. We have built a causal probabilistic network (CPN) for treatment of severe bacterial infections. The net is based on modules, each module representing a site o...

A coloured poset is a poset with a unique maximal element that is equipped with a sheaf of modules. In this paper we initiate the study of a bundle theory for coloured posets, producing for a certain class of base posets a LeraySerre type spectral sequence. We then show how this theory finds application in Khovanov homology by producing a new spectral sequence converging to the Khovanov homolog...

We set the ground for research on a timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. The novelty is that, rather than a single global clock, we use a set of unrelated clocks — possibly one per place — allowing a local timing as well as distributed time synchronisation. We give a formal...

This paper presents an environment to automatically generate coordination rules from coloured Petri nets models.