27 search results - page 2 / 6 » Reachability Logic: An Efficient Fragment of Transitive Clos... |
125
Voted
MST
2006
14 years 10 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...
101
Voted
CORR
2004
Springer
14 years 10 months ago
2004
Springer
We present role logic, a notation for describing properties of relational structures in shape analysis, databases, and knowledge bases. We construct role logic using the ideas of ...
STACS
1994
Springer
15 years 2 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
ACSD
2004
IEEE
15 years 1 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...