87 search results - page 9 / 18 » Maintenance of Transitive Closures and Transitive Reductions... |
SPIN
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
FOSSACS
2004
Springer
14 years 26 days ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
MST
2006
13 years 7 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...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
ENTCS
2007
13 years 7 months ago
2007
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...