Sciweavers

42 search results - page 8 / 9
» A Compatible Approach to Temporal Description Logics
Sort
View
IEEESCC
2005
IEEE
13 years 11 months ago
Web Service Discovery Based on Behavior Signatures
Web service discovery is a key problem as the number of services is expected to increase dramatically. Service discovery at the present time is based primarily on keywords, or int...
Zhongnan Shen, Jianwen Su
ICALP
2009
Springer
14 years 5 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SAC
2004
ACM
13 years 10 months ago
A declarative framework for adaptable applications in heterogeneous environments
In this paper we present an approach for developing adaptable software applications. The problem we are facing is that of a (possibly mobile) user who wants to download and execut...
Paola Inverardi, Fabio Mancinelli, Monica Nesi
DFG
2004
Springer
13 years 9 months ago
Modeling and Formal Verification of Production Automation Systems
This paper presents the real-time model checker RAVEN and related theoretical background. RAVEN augments the efficiency of traditional symbolic model checking with possibilities to...
Jürgen Ruf, Roland J. Weiss, Thomas Kropf, Wo...
EMSOFT
2006
Springer
13 years 9 months ago
Modeling a system controller for timing analysis
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
Stephan Thesing