References of "Heckel, Reiko"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailTransformation Systems with Incremental Negative Application Conditions
Corradini, Andrea; Heckel, Reiko; Hermann, Frank UL et al

in Recent Trends in Algebraic Development Techniques (2013)

In several application areas, Graph Transformation Systems (GTSs) are equipped with Negative Application Conditions (NACs) that specify “forbidden contexts”, in which the rules shall not be applied. The ... [more ▼]

In several application areas, Graph Transformation Systems (GTSs) are equipped with Negative Application Conditions (NACs) that specify “forbidden contexts”, in which the rules shall not be applied. The extension to NACs, however, introduces inhibiting effects among transformation steps that are not local in general, causing a severe problem for a concurrent semantics. In fact, the relation of sequential independence among derivation steps is not invariant under switching, as we illustrate with an example. We first show that this problem disappears if the NACs are restricted to beincremental. Next we present an algorithm that transforms a GTS with arbitrary NACs into one with incremental NACs only, able to simulate the original GTS. We also show that the two systems are actually equivalent, under certain assumptions on NACs. [less ▲]

Detailed reference viewed: 142 (18 UL)
Full Text
Peer Reviewed
See detailParallelism and Concurrency of Stochastic Graph Transformations
Heckel, Reiko; Ehrig, Hartmut; Golas, Ulrike et al

in Graph Transformations (2012), 7562

Graph transformation systems (GTS) have been proposed for high-level stochastic modelling of dynamic systems and networks. The resulting systems can be described as semi-Markov processes with graphs as ... [more ▼]

Graph transformation systems (GTS) have been proposed for high-level stochastic modelling of dynamic systems and networks. The resulting systems can be described as semi-Markov processes with graphs as states and transformations as transitions. The operational semantics of such processes can be explored through stochastic simulation. In this paper, we develop the basic theory of stochastic graph transformation, including generalisations of the Parallelism and Concurrency Theorems and their application to computing the completion time of a concurrent process. [less ▲]

Detailed reference viewed: 125 (8 UL)
Full Text
See detailOn the Concurrent Semantics of Transformation Systems with Negative Application Conditions
Corradini, Andrea; Heckel, Reiko; Hermann, Frank UL et al

Report (2012)

Graph Transformation Systems (GTSs) are an integrated formal speci cation framework for modelling and analysing structural and behavioural aspects of systems. The evolution of a system is modelled by the ... [more ▼]

Graph Transformation Systems (GTSs) are an integrated formal speci cation framework for modelling and analysing structural and behavioural aspects of systems. The evolution of a system is modelled by the application of rules to the graphs representing its states and, since typically such rules have local e ects, GTSs are particularly suitable for modelling concurrent and distributed systems where several rules can be applied in parallel. Thus, it is no surprise that a large body of literature is dedicated to the study of the concurrent semantics of graph transformation systems. [less ▲]

Detailed reference viewed: 104 (16 UL)
Full Text
Peer Reviewed
See detailIncremental Service Composition Based on Partial Matching of Visual Contracts
Naeem, Muhammad; Heckel, Reiko; Orejas, Fernando et al

in Fundamental Approaches to Software Engineering (2010)

Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requester may be able to use demand support for finding and ... [more ▼]

Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requester may be able to use demand support for finding and selecting services. In particular, it is unrealistic to expect that a single service will satisfy complex requirements, so services will have to be combined to match clients’ requests. In this paper, we propose a visual, incremental approach for the composition of services, in which we describe the requirements of a requester as a goal which is matched against multiple provider offers. After every match with an offer we decompose the goal into satisfied and remainder parts. We iterate the decomposition until the goal is satisfied or we run out of offers, leading to a resolution-like matching strategy. Finally, the individual offers can be composed into a single combined offer and shown to the requester for feedback. Our approach is based on visual specifications of pre- and postconditions by graph transformation systems with loose semantics, where a symbolic approach based on constraints is used to represent attributes and their computation in graphs. [less ▲]

Detailed reference viewed: 257 (3 UL)