Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and als...
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Workflow and business process modeling approaches have become essential for designing service collaborations when developing SOA-based systems. To derive actual executable busines...
Carsten Lohmann, Joel Greenyer, Juanjuan Jiang, Ta...