71 search results - page 7 / 15 » Bisimilarity in Term Graph Rewriting |
PODC
2009
ACM
16 years 7 days ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
FORTE
2010
15 years 1 months ago
2010
Abstract. Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries li...
135
click to vote
MST
2006
14 years 11 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...
102
click to vote
PPDP
2009
Springer
15 years 6 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
104
click to vote
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...