16 search results - page 2 / 4 » Expansion Of Product Replacement Graphs |
DM
2002
14 years 11 months ago
2002
Let ^G be a graph obtained from a graph G with no loops or coloops by replacing each edge e = uw of G by a connected graph He that has only the vertices u and w in common with the...
102
click to vote
FMCO
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This tutorial paper describes a framework for modelling several aspects of distributed computing based on Synchronised Hyperedge Replacement (SHR), a graph rewriting form...
116
click to vote
ATVA
2011
Springer
13 years 11 months ago
2011
Springer
We present the Self-Loop Aggregation Product (SLAP), a new hybrid technique that replaces the synchronized product used in the automata-theoretic approach for LTL model checking. T...
108
click to vote
EDBT
2006
ACM
15 years 12 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
108
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...