In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
We present a calculus for modelling "environment-aware" computations, that is computations that adapt their behaviour according to the capabilities of the environment. T...
-- We develop a new integer linear programming model to optimally design demand-wise shared protection (DSP) networks to achieve specified minimum levels of dual-failure restorabil...