The paper presents ConSpec, an automata based policy specification language. The language trades off clean semantics to language expressiveness; a formal semantics for the languag...
We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation...
In this paper we introduce the notion of an observational coalgebra structure and of a complete set of co-operations. We demonstrate in various example the usefulness of these not...
istic Abstract Interpretation Alessandra Di Pierro1 Pascal Sotin2 Herbert Wiklicky3 Within the context of a quantitative generalisation of the well established framework of Abstra...
Alessandra Di Pierro, Pascal Sotin, Herbert Wiklic...
Consider the initial-value problem with computable parameters dx dt = p(t, x) x(t0) = x0, where p : Rn+1 Rn is a vector of polynomials and (t0, x0) Rn+1 . We show that the proble...