We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
MOBI-D (Model-Based Interface Designer) is a software environment the design and development of user interfaces from declarative interface models. End-users informally describe ta...
UML is posited as the "swiss army knife" for systems modelling and design activities. It embodies a number of modelling formalisms that have broad applicability in captu...
Nick Russell, Wil M. P. van der Aalst, Arthur H. M...