Sciweavers

480 search results - page 73 / 96
» Introducing Temporal Description Logics
Sort
View
ICALP
2009
Springer
14 years 9 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
WWW
2009
ACM
14 years 9 months ago
Automated synthesis of composite services with correctness guarantee
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified...
Ting Deng, Jinpeng Huai, Xianxian Li, Zongxia Du, ...
ISCC
2007
IEEE
104views Communications» more  ISCC 2007»
14 years 3 months ago
Chronicle Recognition for Mobility Management Triggers
An optimally working mobile system requires tight cooperation and an information stream that flows impeccably between its components. This, however, is not the current state of t...
Christophe Dousson, Kostas Pentikousis, Tiia Sutin...
FATES
2003
Springer
14 years 2 months ago
Property Oriented Test Case Generation
Abstract. In this paper we propose an approach to automatically produce test cases allowing to check the satis ability of a linear property on a given implementation. Linear proper...
Jean-Claude Fernandez, Laurent Mounier, Cyril Pach...
CONCUR
2000
Springer
14 years 19 days ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko