Sciweavers

264 search results - page 16 / 53
» entcs 2008
Sort
View
ENTCS
2008
120views more  ENTCS 2008»
13 years 6 months ago
ConSpec - A Formal Language for Policy Specification
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...
Irem Aktug, Katsiaryna Naliuka
ENTCS
2008
124views more  ENTCS 2008»
13 years 6 months ago
Modular Games for Coalgebraic Fixed Point Logics
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...
Corina Cîrstea, Mehrnoosh Sadrzadeh
ENTCS
2008
73views more  ENTCS 2008»
13 years 6 months ago
Observational Coalgebras and Complete Sets of Co-operations
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...
Clemens Kupke, Jan J. M. M. Rutten
ENTCS
2008
89views more  ENTCS 2008»
13 years 6 months ago
Relational Analysis and Precision via Probabilistic Abstract Interpretation
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...
ENTCS
2008
80views more  ENTCS 2008»
13 years 6 months ago
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
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...
Daniel S. Graça, Jorge Buescu, Manuel Lamei...