Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
The Task Computing framework is designed to operate in dynamic ubiquitous environments in which a mobile computing user dynamically discovers the current set of available semantic...
Zhexuan Song, Ryusuke Masuoka, Jonathan R. Agre, Y...
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
In this paper we show how Rate Transition Systems (RTSs) can be used as a unifying framework for the definition of the semantics of stochastic process algebras. RTSs facilitate the...
Rocco De Nicola, Diego Latella, Michele Loreti, Mi...
Reasoning on the Web is gaining in importance because of emerging Web applications such as contextadaptive Web systems (e.g. eLearning, recommender, personalised (multi-)media, an...