Sciweavers

1650 search results - page 76 / 330
» The HOM problem is decidable
Sort
View
FORMATS
2009
Springer
14 years 4 months ago
On the Supports of Recognizable Timed Series
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
Karin Quaas
ICALP
2007
Springer
14 years 4 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
STACS
2007
Springer
14 years 4 months ago
Associative-Commutative Deducibility Constraints
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...
RTA
2005
Springer
14 years 3 months ago
Termination of Single-Threaded One-Rule Semi-Thue Systems
Abstract. This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule s → t. McNaughton previously showed ...
Wojciech Moczydlowski, Alfons Geser
VLDB
1997
ACM
94views Database» more  VLDB 1997»
14 years 2 months ago
Describing and Using Query Capabilities of Heterogeneous Sources
Information integration systems have to cope with the different and limited query interfaces of the underlying information sources. First, the integration systems need description...
Vasilis Vassalos, Yannis Papakonstantinou