References of "König, Barbara"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailSpecification and Verification of Model Transformations
Hermann, Frank UL; Hülsbusch, Mathias; König, Barbara

in Electronic Communications of the EASST (2010), 30

Model transformations are a key concept within model driven development and there is an enormous need for suitable formal analysis techniques for model transformations, in particular with respect to ... [more ▼]

Model transformations are a key concept within model driven development and there is an enormous need for suitable formal analysis techniques for model transformations, in particular with respect to behavioural equivalence of source models and their corresponding target models. For this reason, we discuss the general challenges that arise for the specification and verification of model transformations and present suitable formal techniques that are based on graph transformation. In this context, triple graph grammars show many benefits for the specification process, e.g. modelers can work on an intuitive level of abstraction and there are formal results for syntactical correctness completeness and efficient execution. In order to verify model transformations with respect to behavioural equivalence we apply well-studied techniques based on the double pushout approach with borrowed context, for which the model transformations specified by triple graph transformation rules are flattened to plain (in-situ) graph transformation rules. The potential and adequateness of the presented techniques are demonstrated by an intuitive example, for which we show the correctness of the model transformation with respect to bisimilarity of source and target models. [less ▲]

Detailed reference viewed: 52 (3 UL)
Full Text
See detailEfficient Process Analysis of Transformation Systems Based on Petri nets
Hermann, Frank UL; Corradini, Andrea; Ehrig, Hartmut et al

Report (2010)

In the framework of adhesive transformation systems with Negative Application Conditions (NACs), we show how the problem of computing the set of equivalent derivations to a given one can be reduced to the ... [more ▼]

In the framework of adhesive transformation systems with Negative Application Conditions (NACs), we show how the problem of computing the set of equivalent derivations to a given one can be reduced to the analysis of the reachability graph of a generated Place/Transition Petri net. This net encodes the dependencies among rule applications of the derivation, including the inhibiting e ects of the NACs. We show the e ectiveness of this approach by comparing the cost of a brute force-approach with the cost of the presented analysis applied to a derivation of a simple system, showing a signi cant improvement in speed. [less ▲]

Detailed reference viewed: 35 (1 UL)
Full Text
Peer Reviewed
See detailEfficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets
Hermann, Frank UL; Corradini, Andrea; Ehrig, Hartmut et al

in Electronic Communications of the EASST (2010), 29

Detailed reference viewed: 30 (2 UL)
Full Text
See detailBehaviour Simulation and Equivalence of Systems Modelled by Graph Transformation
Ehrig, Hartmut; Ermel, Claudia; Hermann, Frank UL et al

in Bulletin of the EATCS (2009), 97

Our new project "Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation" funded by the German Research Council (DFG) has started in May 2008. In this contribution we present the ... [more ▼]

Our new project "Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation" funded by the German Research Council (DFG) has started in May 2008. In this contribution we present the main goals of the project and first results. [less ▲]

Detailed reference viewed: 38 (1 UL)
Peer Reviewed
See detailSesqui-Pushout Rewriting
Corradini, Andrea; Heindel, Tobias; Hermann, Frank UL et al

in Graph Transformation (2006)

Sesqui-pushout (sqpo) rewriting – ''sesqui´´ means ``one and a half'' in Latin – is a new algebraic approach to abstract rewriting in any category. sqpo rewriting is a deterministic and conservative ... [more ▼]

Sesqui-pushout (sqpo) rewriting – ''sesqui´´ means ``one and a half'' in Latin – is a new algebraic approach to abstract rewriting in any category. sqpo rewriting is a deterministic and conservative extension of double-pushout (dpo) rewriting, which allows to model ``deletion in unknown context'', a typical feature of single-pushout (spo) rewriting, as well as cloning. After illustrating the expressiveness of the proposed approach through a case study modelling an access control system, we discuss sufficient conditions for the existence of final pullback complements and we analyze the relationship between sqpo and the classical dpo and spo approaches. [less ▲]

Detailed reference viewed: 54 (2 UL)