Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, , ) such that L and R are termgraphs representing...
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, τ, σ) such that L and R are termgraphs represen...