523 search results - page 65 / 105 » Decidability of string graphs |
146
click to vote
CAV
1999
Springer
15 years 10 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
274
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
145
click to vote
DATE
2008
IEEE
16 years 12 days ago
2008
IEEE
This work addresses the issue of design optimization for faulttolerant hard real-time systems. In particular, our focus is on the handling of transient faults using both checkpoin...
149
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
155
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...