@INPROCEEDINGS{Hec06Nutshell,
AUTHOR = {R. Heckel},
TITLE = {Graph Transformation in a Nutshell},
BOOKTITLE = {Proceedings of the School on Foundations of Visual Modelling Techniques
(FoVMT 2004) of the SegraVis Research Training Network},
YEAR = {2006},
VOLUME = {148},
NUMBER = {1},
SERIES = ENTCS,
PAGES = {187-198},
PUBLISHER = {Elsevier},
ABSTRACT = {Even sophisticated techniques start out from simple ideas. Later,
in reply to application needs or theoretical problems new concepts
are introduced and new formalisations proposed, often to a point
where the original simple core is hardly recognizably. In this paper
we provide a non-technical introduction to the basic concepts of
typed graph transformation systems, completed by a survey of more
advanced concepts, and explain some of its history and motivations.},
BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
CROSSREF = {Hec06ENTCS},
EE = {http://dx.doi.org/10.1016/j.entcs.2005.12.018},
JOURNAL = {Electr. Notes Theor. Comput. Sci.},
KEYWORDS = {rule-based graph transformation; typed attributed graphs; application
conditions and constraints; control conditions; multi objects},
PARTNER = {ULEICES},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2006/Hec06Nutshell.pdf}
}
@INPROCEEDINGS{HM05FASE,
AUTHOR = {R. Heckel and L. Mariani},
TITLE = {Automatic Conformance Testing of Web Services},
BOOKTITLE = {FASE},
YEAR = {2005},
PAGES = {34-48},
ABSTRACT = {Web Services are the basic building blocks of next generation
Internet applications, based on dynamic service discovery and composition.
Dedicated discovery services will store both syntactic and behavioral
descriptions of available services and guarantee their compatibility
with the requirements expressed by clients. In practice, however,
interactions
may still fail because the Web Services implementation may be
faulty. In fact, the client has no guarantee on the quality of the
implementation
associated to any service description.
In this paper, we propose the idea of high-quality service discovery
incorporating automatic testing for validating Web Services before
allowing
their registration. First, the discovery service automatically generates
conformance test cases from the provided service description, then
runs the test cases on the targetWeb Service, and only if the test
is successfully
passed, the service is registered.
In this way, clients bind with Web Services providing a compatible
signature, a suitable behavior, and a high-quality implementation.},
BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
CROSSREF = {DBLP:conf/fase/2005},
EE = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3442{\&}spage=34},
PARTNER = {ULEICES},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2005/HM05FASE.pdf}
}
@ARTICLE{BCEH05MSCS,
AUTHOR = {Paolo Baldan and Andrea Corradini and Hartmut Ehrig and Reiko Heckel},
TITLE = {Compositional semantics for open Petri nets based on deterministic
processes},
JOURNAL = {Mathematical Structures in Computer Science},
YEAR = {2005},
VOLUME = {15},
PAGES = {1-35},
NUMBER = {1},
ABSTRACT = {In order to model the behaviour of open concurrent systems by means
of Petri nets, we
introduce open Petri nets, a generalisation of the ordinary model
where some places,
designated as open, represent an interface between the system and
the environment. Besides
generalising the token game to reflect this extension, we define a
truly concurrent semantics
for open nets by extending the GoltzReisig process semantics of Petri
nets.
We introduce a composition operation over open nets, characterised
as a pushout in the
corresponding category, suitable for modelling both interaction through
open places and
synchronisation of transitions. The deterministic process semantics
is shown to be
compositional with respect to such a composition operation. If a net
Z3 results as the
composition of two nets Z1 and Z2, having a common subnet Z0, then
any two deterministic
processes of Z1 and Z2 that agree on the common part, can be amalgamated
to produce a
deterministic process of Z3. Conversely, any deterministic process
of Z3 can be decomposed
into processes of the component nets. The amalgamation and decomposition
operations are
shown to be inverse to each other, leading to a bijective correspondence
between the
deterministic processes of Z3 and the pair of deterministic processes
of Z1 and Z2 that agree
on the common subnet Z0. Technically, our result is similar to the
amalgamation theorem
for data-types in the framework of algebraic specification. A possible
application field of
the proposed constructions and results is the modelling of interorganisational
workflows,
recently studied in the literature. This is illustrated by a running
example.},
BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
EE = {http://dx.doi.org/10.1017/S0960129504004311},
PARTNER = {ULEICES,PISA},
URL = {http://www.dsi.unive.it/~baldan/Papers/Soft-copy-pdf/OpenLong.pdf}
}
@ARTICLE{BHTV05SoSym,
AUTHOR = {L. Baresi and R. Heckel and S. Th\"one and D. Varr\'o},
TITLE = {Style-Based Modelling and Refinement of Service-Oriented Architectures},
JOURNAL = {Software and Systems Modelling (SoSym)},
YEAR = {2005},
NOTE = {To appear},
ABSTRACT = {flexible and dynamic platform for implementing business solutions.
In this paper, we address the modeling of such architectures by
refining business-oriented architectures, which abstract from technology
aspects, into service-oriented ones, focusing on the ability of
dynamic reconfiguration (binding to new services at runtime) typical
for SOA.
The refinement is based on conceptual models of the platforms involved
as architectural styles, formalized by graph transformation systems.
Based on a refinement relation between abstract and platform-specific
styles we investigate how to realize business-specific scenarios
on the SOA platform by automatically deriving refined, SOA-specific
reconfiguration scenarios.},
ADDRESS = {Oslo, Norway},
BOOKTITLE = {Proc. of the 4th Working IEEE/IFIP Conference on Software Architecture
(WICSA4)},
OPTABSTRACT = {},
OPTEDITOR = {},
OPTKEYWORDS = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PARTNER = {ULEICES,BUTE},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2005/BHTV05SoSym.pdf}
}
@INPROCEEDINGS{EFHT05PAIS,
AUTHOR = {G. Engels and A. F\"orster and R. Heckel and S. Th\"one},
TITLE = {Process Modeling using UML},
BOOKTITLE = {Process-Aware Information Systems},
YEAR = {2005},
EDITOR = {M. Dumas and W. van der Aalst and A. ter Hofstede},
PAGES = {85-117},
ADDRESS = {New York},
PUBLISHER = {Wiley Publishing},
OWNER = {Reiko Heckel},
PARTNER = {ULEICES},
TIMESTAMP = {2006.05.06},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2005/EFHT05PAIS.pdf}
}
@INPROCEEDINGS{EHC05TAPSOFT,
AUTHOR = {G. Engels and R. Heckel and A. Cherchago},
TITLE = {Flexible Interconnection of Graph Transformation Modules - A Systematic
Approach},
BOOKTITLE = {Formal Methods in Software and System Modeling},
YEAR = {2005},
EDITOR = {H.-J. Kreowski and U. Montanari and F. Orejas and G. Rozenberg and
G. Taentzer},
SERIES = LNCS,
PAGES = {38-63},
PUBLISHER = {Springer-Verlag},
ABSTRACT = {Modularization is a well-known concept to structure software systems
as well as their specifications. Modules are equipped with export
and import interfaces and thus can be connected with other modules
requesting or providing certain features.
In this paper, we study modules the interfaces of which consist of
behavioral specifications given by typed graph transformation systems.
We introduce a framework for classifying and systematically defining
relations between typed graph transformation systems. The framework
comprises a number of standard ingredients, like homomorphisms between
type graphs and mappings between sets of graph transformation rules.
The framework is applied to develop a novel concept of substitution
morphism by separating preconditions and effects in the specification
of rules. This substitution morphism is suited to define the semantic
relation between export and import interfaces of requesting and
providing modules.},
OWNER = {Reiko Heckel},
PARTNER = {ULEICES},
TIMESTAMP = {2006.05.06},
URL = {http://www.springerlink.com/index/V374LYHG9W5KF7DP.pdf}
}
@INPROCEEDINGS{GEH05APSEC,
AUTHOR = {P. Guo and G. Engels and R. Heckel},
TITLE = {Architectural Style - Based Modeling and Simulation of Complex Software
Systems},
BOOKTITLE = {12th Asia-Pacific Software Engineering Conference (APSEC'05)},
YEAR = {2005},
PAGES = {367-374},
ADDRESS = {Los Alamitos, CA, USA},
PUBLISHER = {IEEE Computer Society},
ABSTRACT = {The design and development of complex software systems is a difficult
task, and it is not easy to ensure the quality of a developed software.
The paper presents an architectural style-based approach to specifying
and analyzing complex software systems. The approach is developed
based on UML-like meta models and graph transformation techniques
to support sound methodological principals, formal analysis and
refinement. The approach is illustrated through the specification
and simulation of architectural styles of mobile computing middleware,
where three abstract levels of architectural styles are defined
in order to decrease the complexity brought by mobility.},
DOI = {http://doi.ieeecomputersociety.org/10.1109/APSEC.2005.41},
ISSN = {1530-1362},
JOURNAL = {apsec},
PARTNER = {ULEICES},
URL = {http://doi.ieeecomputersociety.org/10.1109/APSEC.2005.41}
}
@ARTICLE{HHL05JWSR,
AUTHOR = {J.H. Hausmann and R. Heckel and M. Lohmann},
TITLE = {Model-based development of web service descriptions: Enabling a precise
matching concept},
JOURNAL = {International Journal of Web Services Research},
YEAR = {2005},
VOLUME = {2},
PAGES = {67-84},
NUMBER = {2},
ABSTRACT = {Web services are software components that can be discovered and employed
at runtime using the Internet. Conflicting requirements towards
the nature of these services can be identified. From a business
perspective, Web services promise to enable the formation of ad-hoc
cooperations on a global scale. From a technical perspective, a
high degree of standardization and rigorous specifications are required
to enable the automated integration of Web services. A suitable
technology for Web services has to mediate these needs for flexibility
and stability. To be usable in practice, this technology has to
be aligned to standard software engineering practice to allow for
a seamless development of Web service enabled components.
In this paper, we introduce a new approach to the description of
Web services. It is a visual approach based on the use of software
models and graph transformations and allows for the flexible description
of innovative services while providing a precise matching concept.
A methodology enabling the seamless development of such Web service
descriptions in the context of a standard model-based development
approach is presented.},
OWNER = {Reiko Heckel},
PARTNER = {ULEICES},
TIMESTAMP = {2006.05.06},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2005/HHL05JWSR.pdf}
}
@INPROCEEDINGS{Hec05ICTAC,
AUTHOR = {R. Heckel},
TITLE = {Stochastic Analysis of Graph Transformation Systems: A Case Study
in {P2P} Networks},
BOOKTITLE = {Proc. Intl. Colloquium on Theoretical Aspects of Computing (ICTAC'05),
Hanoi, Vietnam},
YEAR = {2005},
EDITOR = {H. Dan Van and M. Wirsing},
VOLUME = {3722},
SERIES = LNCS,
MONTH = {October},
PUBLISHER = {Springer-Verlag},
NOTE = {Invited paper},
ABSTRACT = {In distributed and mobile systems with volatile bandwidth and fragile
connectivity, non-functional aspects like performance and reliability
become more and more important. To formalise, measure, and predict
these properties, stochastic methods are required. At the same time
such systems are characterised by a high degree of architectural
reconfiguration. Viewing the architecture of a distributed system
as a graph, this is naturally modelled by graph transformations.
To address these two concerns, stochastic graph transformation systems
have been introduced associating with each rule its application
ratethe rate of the exponential distribution governing the delay
of its application. Deriving continuous-time Markov chains, Continuous
Stochastic Logic is used to specify reliability properties and verify
them through model checking.
In particular, we study a protocol for the reconfiguration of P2P
networks intended to improve their reliability by adding redundant
connections. The modelling of this protocol as a (stochastic) graph
transformation system takes advantage of negative application and
conditions path expressions.
This ensuing high-level style of specification helps to reduce the
number of states and increases the capabilities for automated analysis.},
INVITED = {Y},
OWNER = {Reiko Heckel},
PARTNER = {ULEICES},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2005/Hec05ICTAC.pdf}
}
@ARTICLE{HL06JLAP,
AUTHOR = {R. Heckel and A. Cherchago},
TITLE = {Structural and Behavioral Compatibility of Graphical Service Specifications},
JOURNAL = {Journal of Logic and Algebraic Programming},
YEAR = {2006},
NOTE = {To appear},
ABSTRACT = {The ability of applications to dynamically discover required
services is a key motivation for Web Services. However, this aspect
is not entirely supported by current Web Services standards. It is
our objective to develop a formal approach, allowing the automation
of the discovery process. The approach is based on the matching of
interface specifications of the required and provided services.
%requestor's requirements for a useful service against service descriptions.
In the present paper, we establish an integral notion of structural
and behavioural compatibility of service specifications. While
structural information is represented by operation declarations,
behavioural descriptions are provided by contracts expressed as
graph transformation rules with positive and negative application
conditions. The integration of structural and behavioural
descriptions is facilitated by \emph{typed and parameterised} graph
transformation systems, augmenting the rule-based description of
behaviour by a type graph and operation declarations representing
the
structural aspect.
The matching relation taking into account this combination is called
\emph{parameterised substitution morphism}. We show that substitution
morphisms satisfy the semantic requirement inherent in its name: the
substitutability of abstract operations by (calls to) concrete ones.},
OWNER = {Reiko Heckel},
PARTNER = {ULEICES},
TIMESTAMP = {2006.05.06},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2006/HL06JLAP.pdf}
}
@INPROCEEDINGS{HLM05SE,
AUTHOR = {Heckel, R. and Lajios, G. and Menge, S.},
TITLE = {{Modulare Analyse Stochastischer Graphtransformationssysteme}},
BOOKTITLE = {Proc. Software Engineering 2005},
YEAR = {2005},
EDITOR = {P. Liggesmeyer and K. Pohl and M. Goedicke},
VOLUME = {64},
SERIES = {Lecture Notes in Informatics},
PAGES = {141--152},
MONTH = {March},
ORGANIZATION = {GI},
ABSTRACT = {Analog zu stochastischen Petrinetzen oder Prozesskalkülen wurden
stochastische Graphtransformationssysteme entwickelt, um
funktionale und nichtfunktionale (insbesondere zeitabhängige und
probabilistische) Aspekte von Softwaresystemen integrieren und auf
hohem Abstraktionsniveau beschreiben zu können.
Diese Kombination eignet sich vor allem für die Modellierung und
Analyse mobiler Anwendungen, wo dynamische Rekonfiguration von
Netzen an der Tagesordnung ist.
Mit Hilfe von Analysewerkzeugen wie stochastischen Modelcheckern ist
es möglich, Eigenschaften dieser Modelle zu überprüfen. Um diese
Technik auf Systeme interessanter Größe anwenden zu können,
befasst sich die vorliegende Arbeit mit der Modularisierung der
stochastischen Analyse. Insbesondere wird die Korrektheit eines
entsprechenden modularen Erzeugungsverfahrens gezeigt und von
Experimenten berichtet, die die Überlegenheit des modularen
Ansatzes belegen.},
OPTADDRESS = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTVOLUME = {},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2005/HLM05SE.pdf}
}
@ARTICLE{HLM06FI,
AUTHOR = {R. Heckel and G. Lajios and S. Menge},
TITLE = {Stochastic graph transformation systems},
JOURNAL = {Fundamenta Informaticae},
YEAR = {2006},
NOTE = {To appear},
OWNER = {Reiko Heckel},
PARTNER = {ULEICES},
TIMESTAMP = {2006.05.06},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/HLM06FI.pdf}
}
@INPROCEEDINGS{HL05TACoS,
AUTHOR = {R. Heckel and M. Lohmann},
TITLE = {Towards Contract-based Testing of Web Services.},
BOOKTITLE = { Proceedings of the International Workshop on Test and Analysis of
Component Based Systems (TACoS 2004)},
YEAR = {2005},
EDITOR = {Mauro Pezz\'e},
VOLUME = {116},
PAGES = {145-156},
ABSTRACT = {Web Services are composed by linking together service providers and
requestors.
To ensure interoperability, the requestors requirements for a service
have to be
matched against a service description offered by the provider.
Besides data types and operation signatures, this requires service
specifications
to include behavioral information, like contracts specifying pre-
and post-conditions
of (required or provided) operations.
In this paper, we propose to visualize contracts by graph transformation
rules
which blend well with a UML-based notion of data models and signatures.
The
operational interpretation of rules could turn out to be useful for
simulating the
behavior of required components in unit testing.},
BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
EE = {http://dx.doi.org/10.1016/j.entcs.2004.02.073},
JOURNAL = {Electr. Notes Theor. Comput. Sci.},
PARTNER = {ULEICES},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2005/HL05TACoS.pdf}
}
@ARTICLE{HM06STTT,
AUTHOR = {R. Heckel and M. Lohmann},
TITLE = {Model-Driven Development of Reactive Information Systems},
JOURNAL = {International Journal on Software Tools for Technology Transfer},
YEAR = {2006},
NOTE = {To appear},
ABSTRACT = {Service-oriented architectures (SOA) provide a flexible and dynamic
platform for implementing business solutions. In this paper, we
address the modeling of such architectures by refining business-oriented
architectures, which abstract from technology aspects into service-oriented
ones, focusing on the ability of dynamic reconfiguration (binding
to new services at run-time) typical for SOA. The refinement is
based on conceptual models of the platforms involved as architectural
styles, formalized by graph transformation systems. Based on a refinement
relation between abstract and platform-specific styles, we investigate
how to realize business-specific scenarios on the SOA platform by
automatically deriving refined, SOA-specific reconfiguration scenarios.},
OWNER = {Reiko Heckel},
PARTNER = {ULEICES},
TIMESTAMP = {2006.05.06},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2006/HM06STTT.pdf}
}
@INPROCEEDINGS{HT05SeTra,
AUTHOR = {Reiko Heckel and Sebastian Th{\"o}ne},
TITLE = {Behavioral Refinement of Graph Transformation-Based Models.},
BOOKTITLE = { Proceedings of the Workshop on Software Evolution through Transformations:
Model-based vs. Implementation-level Solutions (SETra 2004)},
YEAR = {2005},
VOLUME = {127},
NUMBER = {3},
SERIES = {Electr. Notes Theor. Comput. Sci.},
PAGES = {101-111},
ABSTRACT = {Model-driven software engineering requires the refinement of abstract
models into
more concrete, platform-specific ones. To create and verify such refinements,
behavioral
models capturing reconfiguration or communication scenarios are presented
as
instances of a dynamic meta-model, i.e., a typed graph transformation
system specifying
the concepts and basic operations scenarios may be composed of. Possible
refinement
relations between models can now be described based on the corresponding
meta-models.
In contrast to previous approaches, refinement relations on graph
transformation
systems are not defined as fixed syntactic mappings between abstract
transformation
rules and, e.g., concrete rule expressions, but allow for a more loose,
semantically
defined relation between the transformation systems, resulting in
a more flexible
notion of refinement.},
BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
EE = {http://dx.doi.org/10.1016/j.entcs.2004.08.037},
PARTNER = {ULEICES},
URL = {http://www.cs.le.ac.uk/people/rh122/papers/2005/HT05SeTra.pdf}
}
@PROCEEDINGS{BH06FASE,
TITLE = {Fundamental Approaches to Software Engineering, 9th International
Conference, FASE 2006, Held as Part of the Joint European Conferences
on Theory and Practice of Software, ETAPS 2006, Vienna, Austria,
March 27-28, 2006, Proceedings},
YEAR = {2006},
EDITOR = {L. Baresi and R. Heckel},
VOLUME = {3922},
SERIES = LNCS,
PUBLISHER = {Springer-Verlag},
NOTE = {April},
BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
BOOKTITLE = {FASE},
ISBN = {3-540-33093-3},
PARTNER = {ULEICES},
URL = {http://www.informatik.uni-trier.de/~ley/db/conf/fase/fase2006.html}
}
@PROCEEDINGS{Hec06ENTCS,
TITLE = {Proceedings of the School of the SegraVis Research Training Network
on Foundations of Visual Modelling Techniques (FoVMT 2004)},
YEAR = {2006},
EDITOR = {R. Heckel},
VOLUME = {148},
NUMBER = {1},
SERIES = ENTCS,
PUBLISHER = {Elsevier},
ABSTRACT = {Model-based approaches to software development require languages and
tools to support the creation and analysis, consistency management,
refinement, and implementation of models. In order to provide such
support in a variety of contexts, efficient ways of designing languages
have to be found, accepting that languages are evolving and that
tools need to be delivered in a timely fashion. Thus, an engineering
approach is required which allows for the generation of such languages
and tools from high-level specifications.
The primary objective of the SegraVis network, a European Research
Training Network on Syntactic and Semantic Integration of Visual
Modelling Techniques consists in developing meta-level solutions
for the definition, integration, and implementation of visual modelling
techniques.
These proceedings provide a selection of the contributions to the
School. Supplementary materials, including copies of the presentations,
exercises, and solutions, can be found at http://www.segravis.org/school.},
OWNER = {Reiko Heckel},
PARTNER = {ULEICES},
TIMESTAMP = {2006.05.06},
URL = {http://dx.doi.org/10.1016/j.entcs.2005.12.009}
}
@PROCEEDINGS{HM04ENTCS,
TITLE = {Proceedings of the Workshop on Software Evolution through Transformations:
Model-based vs. Implementation-level Solutions (SETra 2004)},
YEAR = {2005},
EDITOR = {R. Heckel and T. Mens},
VOLUME = {127},
NUMBER = {3},
SERIES = ENTCS,
BIBSOURCE = {DBLP, http://dblp.uni-trier.de},
PARTNER = {ULEICES},
URL = {http://dx.doi.org/10.1016/j.entcs.2004.08.028}
}
This file has been generated by bibtex2html 1.79