Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Abstract. Service-oriented systems have recently emerged as context-independent component-based systems. Unlike components, services can be created, invoked, composed, and destroye...
Aida Causevic, Cristina Cerschi Seceleanu, Paul Pe...
This paper investigates issues of robot's personalization and long-term adaptation in human-robot interaction (HRI). It demonstrates the design and first technical implementat...
Wan Ching Ho, Kerstin Dautenhahn, Mei Yii Lim, Kyr...
Abstract. The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most gene...