882 search results - page 23 / 177 » A Taste of Rewrite Systems |
97
Voted
AMAST
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
111
click to vote
RP
2010
Springer
14 years 10 months ago
2010
Springer
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
104
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
94
Voted
GG
2008
Springer
15 years 1 months ago
2008
Springer
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
116
Voted
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...