Computer science has long been considered to emphasize three distinct perspectives: mathematics, science, and engineering. While the database field has some very strong mathemati...
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected...
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...
Sergio Mascetti, Claudio Bettini, Xiaoyang Sean Wa...
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...