We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
State machines are considered a very general means of expressing computations in an implementation-independent way. There are also ways to extend the general state machine framewor...
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
In recent times, much attention has been devoted to power optimization for real-time systems, while guaranteeing that such systems meet their hard (or soft) scheduling deadlines. ...
Abstract. We study the problem of instance level (ABox) updates for Knowledge Bases (KBs) represented in Description Logics of the DL-Lite family. DLLite is at the basis of OWL 2 Q...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...