Sciweavers

524 search results - page 10 / 105
» Temporal reachability graphs
Sort
View
FMSD
2007
97views more  FMSD 2007»
13 years 9 months ago
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
Patricia Bouyer, Thomas Brihaye, Véronique ...
FSTTCS
2004
Springer
14 years 3 months ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
TAGT
1998
Springer
317views Graph Theory» more  TAGT 1998»
14 years 2 months ago
A Fully Abstract Model for Graph-Interpreted Temporal Logic
Fabio Gadducci, Reiko Heckel, Manuel Koch
SPIN
2000
Springer
14 years 1 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
14 years 11 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias