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...
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...
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by in...
Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access ...
Ernesto Damiani, Majirus Fansi, Alban Gabillon, St...
Generalized Multitext Grammar (GMTG) is a synchronous grammar formalism that is weakly equivalent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notatio...
I. Dan Melamed, Giorgio Satta, Benjamin Wellington