254 search results - page 3 / 51 » Extended Process Rewrite Systems: Expressiveness and Reachab... |
102
click to vote
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
There is much effort to develop comprehensive support for the storage and querying of XML data in database management systems. The major developers have extended their systems to h...
ENTCS
2002
14 years 9 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
CC
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
RTA
1993
Springer
15 years 1 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...