24 Search Results for "Heckel, Reiko"

Document
DOI: 10.4230/LIPIcs.WABI.2025.12
Extension of Partial Atom-To-Atom Maps: Uniqueness and Algorithms

Authors: Marcos E. González Laffitte, Tieu-Long Phan, and Peter F. Stadler

Published in: LIPIcs, Volume 344, 25th International Conference on Algorithms for Bioinformatics (WABI 2025)

Abstract
Chemical reaction databases typically report the molecular structures of reactant and product compounds, as well as their stoichiometry, but lack information, in particular, on the correspondence of reactant and product atoms. These atom-to-atom maps (AAM), however, are crucial for applications including chemical synthesis planning in organic chemistry and the analysis of isotope labeling experiments in modern metabolomics. AAMs therefore need to be reconstructed computationally. This situation is aggravated, furthermore, by the fact that chemically correct AAMs are, fundamentally, determined by quantum-mechanical phenomena and thus cannot be reliably computed by solving graph-theoretical optimization problems defined by the reactant and product structures. A viable solution for this problem is to shift the focus into first identifying a partial AAM containing the reaction center, i.e., covering the atoms incident with all bonds that change during a reaction. This then leads to the problem of extending the partial map to the full reaction. The AAM of a reaction is faithfully represented by the Imaginary Transition State (ITS) graph, providing a convenient graph-theoretic framework to address the questions of when and how a partial AAM can be extended. We show that an unique extension exists whenever, and only if, these partial AAMs cover the reaction center. In this case their extension can be computed by solving a constrained graph-isomorphism search between specific subgraphs of ITS graphs. We close by benchmarking different tools for this task.
Cite as

Marcos E. González Laffitte, Tieu-Long Phan, and Peter F. Stadler. Extension of Partial Atom-To-Atom Maps: Uniqueness and Algorithms. In 25th International Conference on Algorithms for Bioinformatics (WABI 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 344, pp. 12:1-12:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{gonzalezlaffitte_et_al:LIPIcs.WABI.2025.12,
  author =	{Gonz\'{a}lez Laffitte, Marcos E. and Phan, Tieu-Long and Stadler, Peter F.},
  title =	{{Extension of Partial Atom-To-Atom Maps: Uniqueness and Algorithms}},
  booktitle =	{25th International Conference on Algorithms for Bioinformatics (WABI 2025)},
  pages =	{12:1--12:26},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-386-7},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{344},
  editor =	{Brejov\'{a}, Bro\v{n}a and Patro, Rob},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2025.12},
  URN =		{urn:nbn:de:0030-drops-239410},
  doi =		{10.4230/LIPIcs.WABI.2025.12},
  annote =	{Keywords: atom-to-atom maps, imaginary transition state (ITS) graphs, condensed graph of the reaction (CGR), chemical reaction mechanisms, molecular graphs, metabolic networks, chemical synthesis planning, constrained graph isomorphism}
}
Document
DOI: 10.4230/LIPIcs.CALCO.2025.9
Safety and Strong Completeness via Reducibility for Many-Valued Coalgebraic Dynamic Logics

Authors: Helle Hvid Hansen and Wolfgang Poiger

Published in: LIPIcs, Volume 342, 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025)

Abstract
We present a coalgebraic framework for studying generalisations of dynamic modal logics such as PDL and game logic in which both the propositions and the semantic structures can take values in an algebra 𝐀 of truth-degrees. More precisely, we work with coalgebraic modal logic via 𝐀-valued predicate liftings where 𝐀 is an FLew-algebra, and interpret actions (abstracting programs and games) as 𝖥-coalgebras where the functor 𝖥 represents some type of 𝐀-weighted system. We also allow combinations of crisp propositions with 𝐀-weighted systems and vice versa. We introduce coalgebra operations and tests, with a focus on operations which are reducible in the sense that modalities for composed actions can be reduced to compositions of modalities for the constituent actions. We prove that reducible operations are safe for bisimulation and behavioural equivalence, and prove a general strong completeness result, from which we obtain new strong completeness results for 𝟐-valued iteration-free PDL with 𝐀-valued accessibility relations when 𝐀 is a finite chain, and for many-valued iteration-free game logic with many-valued strategies based on finite Lukasiewicz logic.
Cite as

Helle Hvid Hansen and Wolfgang Poiger. Safety and Strong Completeness via Reducibility for Many-Valued Coalgebraic Dynamic Logics. In 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 342, pp. 9:1-9:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{hansen_et_al:LIPIcs.CALCO.2025.9,
  author =	{Hansen, Helle Hvid and Poiger, Wolfgang},
  title =	{{Safety and Strong Completeness via Reducibility for Many-Valued Coalgebraic Dynamic Logics}},
  booktitle =	{11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025)},
  pages =	{9:1--9:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-383-6},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{342},
  editor =	{C\^{i}rstea, Corina and Knapp, Alexander},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2025.9},
  URN =		{urn:nbn:de:0030-drops-235681},
  doi =		{10.4230/LIPIcs.CALCO.2025.9},
  annote =	{Keywords: dynamic logic, many-valued coalgebraic logic, safety, strong completeness}
}
Document
DOI: 10.4230/LIPIcs.CALCO.2025.10
EGGs Are Adhesive!

Authors: Roberto Biondo, Davide Castelnovo, and Fabio Gadducci

Published in: LIPIcs, Volume 342, 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025)

Abstract
The use of rewriting-based visual formalisms is on the rise. In the formal methods community, this is due also to the introduction of adhesive categories, where most properties of classical approaches to graph transformation, such as those on parallelism and confluence, can be rephrased and proved in a general and uniform way. E-graphs (EGGs) are a formalism for program optimisation via an efficient implementation of equality saturation. In short, EGGs can be defined as (acyclic) term graphs with an additional notion of equivalence on nodes that is closed under the operators of the signature. Instead of replacing the components of a program, the optimisation step is performed by adding new components and linking them to the existing ones via an equivalence relation, until an optimal program is reached. This work describes EGGs via adhesive categories. Besides the benefits in itself of a formal presentation, which renders precise the properties of the data structure, the description of the addition of equivalent program components using standard graph transformation tools offers the advantages of the adhesive framework in modelling, for example, concurrent updates.
Cite as

Roberto Biondo, Davide Castelnovo, and Fabio Gadducci. EGGs Are Adhesive!. In 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 342, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{biondo_et_al:LIPIcs.CALCO.2025.10,
  author =	{Biondo, Roberto and Castelnovo, Davide and Gadducci, Fabio},
  title =	{{EGGs Are Adhesive!}},
  booktitle =	{11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025)},
  pages =	{10:1--10:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-383-6},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{342},
  editor =	{C\^{i}rstea, Corina and Knapp, Alexander},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2025.10},
  URN =		{urn:nbn:de:0030-drops-235690},
  doi =		{10.4230/LIPIcs.CALCO.2025.10},
  annote =	{Keywords: Hypergraphs, terms graphs, e-graphs, adhesive categories}
}
Document
Track B: Automata, Logic, Semantics, and Theory of Programming
DOI: 10.4230/LIPIcs.ICALP.2025.170
First-Order Intuitionistic Linear Logic and Hypergraph Languages

Authors: Tikhon Pshenitsyn

Published in: LIPIcs, Volume 334, 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)

Abstract
The Lambek calculus is a substructural logic known to be closely related to the formal language theory: on the one hand, it is used for generating formal languages by means of categorial grammars and, on the other hand, it has formal language semantics, with respect to which it is sound and complete. This paper studies a similar relation between first-order intuitionistic linear logic ILL1 along with its multiplicative fragment MILL1 on the one hand and the hypergraph grammar theory on the other. In the first part, we introduce a novel concept of hypergraph first-order logic categorial grammar, which is a generalisation of string MILL1 grammars introduced in Richard Moot’s works. We prove that hypergraph ILL1 grammars generate all recursively enumerable hypergraph languages and that hypergraph MILL1 grammars are as powerful as linear-time hypergraph transformation systems. In addition, we show that the class of languages generated by string MILL1 grammars is closed under intersection and that it includes a non-semilinear language as well as an NP-complete one. This shows how much more powerful string MILL1 grammars are as compared to Lambek categorial grammars. In the second part, we develop hypergraph language models for MILL1. In such models, formulae of the logic are interpreted as hypergraph languages and multiplicative conjunction is interpreted using parallel composition, which is one of the operations of HR-algebras introduced by Courcelle. We prove completeness of the universal-implicative fragment of MILL1 with respect to these models and thus present a new kind of semantics for a fragment of first-order linear logic.
Cite as

Tikhon Pshenitsyn. First-Order Intuitionistic Linear Logic and Hypergraph Languages. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 170:1-170:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{pshenitsyn:LIPIcs.ICALP.2025.170,
  author =	{Pshenitsyn, Tikhon},
  title =	{{First-Order Intuitionistic Linear Logic and Hypergraph Languages}},
  booktitle =	{52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)},
  pages =	{170:1--170:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-372-0},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{334},
  editor =	{Censor-Hillel, Keren and Grandoni, Fabrizio and Ouaknine, Jo\"{e}l and Puppis, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.170},
  URN =		{urn:nbn:de:0030-drops-235473},
  doi =		{10.4230/LIPIcs.ICALP.2025.170},
  annote =	{Keywords: linear logic, categorial grammar, MILL1 grammar, first-order logic, hypergraph language, graph transformation, language semantics, HR-algebra}
}
Document
DOI: 10.4230/LIPIcs.STACS.2025.40
Identity-Preserving Lax Extensions and Where to Find Them

Authors: Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, and Paul Wild

Published in: LIPIcs, Volume 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)

Abstract
Generic notions of bisimulation for various types of systems (nondeterministic, probabilistic, weighted etc.) rely on identity-preserving (normal) lax extensions of the functor encapsulating the system type, in the paradigm of universal coalgebra. It is known that preservation of weak pullbacks is a sufficient condition for a functor to admit a normal lax extension (the Barr extension, which in fact is then even strict); in the converse direction, nothing is currently known about necessary (weak) pullback preservation conditions for the existence of normal lax extensions. In the present work, we narrow this gap by showing on the one hand that functors admitting a normal lax extension preserve 1/4-iso pullbacks, i.e. pullbacks in which at least one of the projections is an isomorphism. On the other hand, we give sufficient conditions, showing that a functor admits a normal lax extension if it weakly preserves either 1/4-iso pullbacks and 4/4-epi pullbacks (i.e. pullbacks in which all morphisms are epic) or inverse images. We apply these criteria to concrete examples, in particular to functors modelling neighbourhood systems and weighted systems.
Cite as

Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, and Paul Wild. Identity-Preserving Lax Extensions and Where to Find Them. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 40:1-40:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{goncharov_et_al:LIPIcs.STACS.2025.40,
  author =	{Goncharov, Sergey and Hofmann, Dirk and Nora, Pedro and Schr\"{o}der, Lutz and Wild, Paul},
  title =	{{Identity-Preserving Lax Extensions and Where to Find Them}},
  booktitle =	{42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)},
  pages =	{40:1--40:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-365-2},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{327},
  editor =	{Beyersdorff, Olaf and Pilipczuk, Micha{\l} and Pimentel, Elaine and Thắng, Nguy\~{ê}n Kim},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.40},
  URN =		{urn:nbn:de:0030-drops-228665},
  doi =		{10.4230/LIPIcs.STACS.2025.40},
  annote =	{Keywords: (Bi-)simulations, lax extensions, modal logics, coalgebra}
}
Document
DOI: 10.4230/LIPIcs.FSTTCS.2020.38
Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks

Authors: Rebecca Bernemann, Benjamin Cabrera, Reiko Heckel, and Barbara König

Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)

Abstract
This paper exploits extended Bayesian networks for uncertainty reasoning on Petri nets, where firing of transitions is probabilistic. In particular, Bayesian networks are used as symbolic representations of probability distributions, modelling the observer’s knowledge about the tokens in the net. The observer can study the net by monitoring successful and failed steps. An update mechanism for Bayesian nets is enabled by relaxing some of their restrictions, leading to modular Bayesian nets that can conveniently be represented and modified. As for every symbolic representation, the question is how to derive information - in this case marginal probability distributions - from a modular Bayesian net. We show how to do this by generalizing the known method of variable elimination. The approach is illustrated by examples about the spreading of diseases (SIR model) and information diffusion in social networks. We have implemented our approach and provide runtime results.
Cite as

Rebecca Bernemann, Benjamin Cabrera, Reiko Heckel, and Barbara König. Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 38:1-38:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{bernemann_et_al:LIPIcs.FSTTCS.2020.38,
  author =	{Bernemann, Rebecca and Cabrera, Benjamin and Heckel, Reiko and K\"{o}nig, Barbara},
  title =	{{Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks}},
  booktitle =	{40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)},
  pages =	{38:1--38:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-174-0},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{182},
  editor =	{Saxena, Nitin and Simon, Sunil},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.38},
  URN =		{urn:nbn:de:0030-drops-132794},
  doi =		{10.4230/LIPIcs.FSTTCS.2020.38},
  annote =	{Keywords: uncertainty reasoning, probabilistic knowledge, Petri nets, Bayesian networks}
}
Document
DOI: 10.4230/LIPIcs.CONCUR.2018.27
Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks

Authors: Benjamin Cabrera, Tobias Heindel, Reiko Heckel, and Barbara König

Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)

Abstract
The paper extends Bayesian networks (BNs) by a mechanism for dynamic changes to the probability distributions represented by BNs. One application scenario is the process of knowledge acquisition of an observer interacting with a system. In particular, the paper considers condition/event nets where the observer's knowledge about the current marking is a probability distribution over markings. The observer can interact with the net to deduce information about the marking by requesting certain transitions to fire and observing their success or failure. Aiming for an efficient implementation of dynamic changes to probability distributions of BNs, we consider a modular form of networks that form the arrows of a free PROP with a commutative comonoid structure, also known as term graphs. The algebraic structure of such PROPs supplies us with a compositional semantics that functorially maps BNs to their underlying probability distribution and, in particular, it provides a convenient means to describe structural updates of networks.
Cite as

Benjamin Cabrera, Tobias Heindel, Reiko Heckel, and Barbara König. Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks. In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, pp. 27:1-27:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{cabrera_et_al:LIPIcs.CONCUR.2018.27,
  author =	{Cabrera, Benjamin and Heindel, Tobias and Heckel, Reiko and K\"{o}nig, Barbara},
  title =	{{Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks}},
  booktitle =	{29th International Conference on Concurrency Theory (CONCUR 2018)},
  pages =	{27:1--27:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-087-3},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{118},
  editor =	{Schewe, Sven and Zhang, Lijun},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.27},
  URN =		{urn:nbn:de:0030-drops-95659},
  doi =		{10.4230/LIPIcs.CONCUR.2018.27},
  annote =	{Keywords: Petri nets, Bayesian networks, Probabilistic databases, Condition/Event nets, Probabilistic knowledge, Dynamic probability distributions}
}
Document
DOI: 10.4230/DagSemProc.06302.9
Rule-based Model Extraction from Source Code

Authors: Rui Correia, Carlos Matos, Mohammad El-Ramly, and Reiko Heckel

Published in: Dagstuhl Seminar Proceedings, Volume 6302, Aspects For Legacy Applications (2007)

Abstract
In the context of an approach for reengineering legacy soft- ware systems at the architectural level, we present in this paper a reverse engineering methodology that uses a model de¯ned as a type graph to represent source-code subject to a code categorization process. Two al- ternative methods for referencing the source code are discussed: native vs. graphical. To represent the code, the native representation uses the abstract syntax tree while the graphical uses a programming language metamodel. Two options regarding the way that the graph can relate to the source code reference model are also considered: association model vs. direct link. The extraction of the program representation, complying to the type graph, is based on rules that categorize source code according to its purpose. The techniques to address this process, such as the code categorization rules, are shown together with examples.
Cite as

Rui Correia, Carlos Matos, Mohammad El-Ramly, and Reiko Heckel. Rule-based Model Extraction from Source Code. In Aspects For Legacy Applications. Dagstuhl Seminar Proceedings, Volume 6302, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{correia_et_al:DagSemProc.06302.9,
  author =	{Correia, Rui and Matos, Carlos and El-Ramly, Mohammad and Heckel, Reiko},
  title =	{{Rule-based Model Extraction from Source Code}},
  booktitle =	{Aspects For Legacy Applications},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6302},
  editor =	{Siobh\'{a}n Clarke and Leon Moonen and Ganesan Ramalingam},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06302.9},
  URN =		{urn:nbn:de:0030-drops-8815},
  doi =		{10.4230/DagSemProc.06302.9},
  annote =	{Keywords: Reverse engineering, Code categorization, Program representation}
}
Document
DOI: 10.4230/DagSemProc.04101.9
Graph Transformation Based Models of Dynamic Software Architectures and Architectural Styles

Authors: Sebastian Thöne

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
no abstract
Cite as

Sebastian Thöne. Graph Transformation Based Models of Dynamic Software Architectures and Architectural Styles. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{thone:DagSemProc.04101.9,
  author =	{Th\"{o}ne, Sebastian},
  title =	{{Graph Transformation Based Models of Dynamic Software Architectures and Architectural Styles}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.9},
  URN =		{urn:nbn:de:0030-drops-174},
  doi =		{10.4230/DagSemProc.04101.9},
  annote =	{Keywords: no keywords}
}
Document
DOI: 10.4230/DagSemProc.04101.10
Graph Transformation in a Nutshell

Authors: Reiko Heckel

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
Even sophisticated techniques start out from simple ideas. Later, in reply to application needs or theoretical problems new concepts are introduced and new formalizations proposed, often to a point where the original simple core is hardly recognizable. In this paper we provide a non-technical introduction to the basic concepts of typed graph transformation systems, completed with a survey of more advanced concepts, and explain some of its history and motivations.
Cite as

Reiko Heckel. Graph Transformation in a Nutshell. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{heckel:DagSemProc.04101.10,
  author =	{Heckel, Reiko},
  title =	{{Graph Transformation in a Nutshell}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.10},
  URN =		{urn:nbn:de:0030-drops-169},
  doi =		{10.4230/DagSemProc.04101.10},
  annote =	{Keywords: graph transformation}
}
Document
DOI: 10.4230/DagSemProc.04101.11
Language Engineering in Practice

Authors: Martin Große-Rhode

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
no abstract
Cite as

Martin Große-Rhode. Language Engineering in Practice. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{groerhode:DagSemProc.04101.11,
  author =	{Gro{\ss}e-Rhode, Martin},
  title =	{{Language Engineering in Practice}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.11},
  URN =		{urn:nbn:de:0030-drops-151},
  doi =		{10.4230/DagSemProc.04101.11},
  annote =	{Keywords: no keywords}
}
Document
DOI: 10.4230/DagSemProc.04101.12
Multi-Domain Integration with MOF and extended Triple Graph Grammars

Authors: Alexander Königs and Andy Schürr

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
One aim of tool integration is designing an integrated development environment that accesses the data/models of different tools and keeps them consistent throughout a project being considered. Present approaches that aim for data integration by specifying (graphically denoted) consistency checking constraints or consistency preserving transformations are restricted to pairs of documents. We present an example that motivates the need for a more general data/model integration approach which is able to integrate an arbitrary number of MOF-compliant models. From a formal point of view this approach is a generalization of the triple graph grammar document integration approach. From a practical point of view it is a proposal how to specify multidirectional declarative model transformations in the context of OMG’s model-driven architecture (MDA) development efforts and its request for proposals for a MOF-compliant "query, view, and transformation" (QVT) approach.
Cite as

Alexander Königs and Andy Schürr. Multi-Domain Integration with MOF and extended Triple Graph Grammars. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{konigs_et_al:DagSemProc.04101.12,
  author =	{K\"{o}nigs, Alexander and Sch\"{u}rr, Andy},
  title =	{{Multi-Domain Integration with MOF and extended Triple Graph Grammars}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.12},
  URN =		{urn:nbn:de:0030-drops-225},
  doi =		{10.4230/DagSemProc.04101.12},
  annote =	{Keywords: no keywords}
}
Document
DOI: 10.4230/DagSemProc.04101.13
Refinement and Consistency in Multiview Models

Authors: Heike Wehrheim

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
Model transformations are an integral part of OMG's standard for Model Driven Architecture (MDA). Model transformations should at the best allow for a seamless transition from high-level models to actual implementations. They are therefore required to be behaviour preserving: models (or the final implementation) at lower levels should adhere to the descriptions given in higher level models. Moreover, for complex systems models usually consists of descriptions of different views on the system. Consequently, different kinds of model transformations take place on different views, and together they should guarantee behaviourpreservation. In this paper we discuss the applicability of formal methods to model transformations. Formal methods come with build-in notions of transformations between models, or more precisely, with refinement and subtyping concepts which provide means for comparing models on different levels with respect to their behaviour. Such notions can be applied as correctness criteria for evaluating model transformations. Moreover, refinement and subtyping concepts for different views can be shown to neatly fit together. This is achieved by giving a common semantics to all views which furthermore opens the possibility of checking consistency between them.
Cite as

Heike Wehrheim. Refinement and Consistency in Multiview Models. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{wehrheim:DagSemProc.04101.13,
  author =	{Wehrheim, Heike},
  title =	{{Refinement and Consistency in Multiview Models}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.13},
  URN =		{urn:nbn:de:0030-drops-190},
  doi =		{10.4230/DagSemProc.04101.13},
  annote =	{Keywords: no keywords}
}
Document
DOI: 10.4230/DagSemProc.04101.14
Subjects, Models, Languages, Transformations

Authors: Arend Rensink

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
Discussions about model-driven approaches tend to be hampered by terminological confusion. This is at least partially caused by a lack of formal precision in defining the basic concepts, including that of \model" and \thing being modelled" | which we call subject in this paper. We propose a minimal criterion that a model should fulfill: essentially, it should come equipped with a clear and unambiguous membership test; in other words, a notion of which subjects it models. We then go on to discuss a certain class of models of models that we call languages, which apart from defining their own membership test also determine membership of their members. Finally, we introduce transformations on each of these layers: a subject transformation is essentially a pair of subjects, a model transformation is both a pair of models and a model of pairs (namely, subject transformations), and a language transformation is both a pair of languages and a language of model transformations. We argue that our framework has the benefits of formal precision (there can be no doubt about whether something satifies our criteria for being a model, a language or a transformation) and minimality (it is hard to imagine a case of modelling or transformation not having the characterstics that we propose).
Cite as

Arend Rensink. Subjects, Models, Languages, Transformations. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{rensink:DagSemProc.04101.14,
  author =	{Rensink, Arend},
  title =	{{Subjects, Models, Languages, Transformations}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--13},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.14},
  URN =		{urn:nbn:de:0030-drops-242},
  doi =		{10.4230/DagSemProc.04101.14},
  annote =	{Keywords: no keywords}
}
Document
DOI: 10.4230/DagSemProc.04101.15
What is a Model?

Authors: Thomas Kühne

Published in: Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)

Abstract
With the recent trend to model driven development a commonly agreed notion of \model" becomes a pivotal issue. However, currently there is little consensus about what exactly a model is and what it is not. Furthermore, basic terms such as \metamodel" are far from being understood in the same way by all members of the modeling community. This article attempts to start establishing a consensus about generally acceptable terminology. Its main contribution is the distinction between two fundamentally different kinds of models, i.e. \type model" versus \token model". The recognition of the fundamental difference in these two kinds of models is crucial to avoid misunderstandings and unnecessary disputes among members of the modeling community.
Cite as

Thomas Kühne. What is a Model?. In Language Engineering for Model-Driven Software Development. Dagstuhl Seminar Proceedings, Volume 4101, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{kuhne:DagSemProc.04101.15,
  author =	{K\"{u}hne, Thomas},
  title =	{{What is a Model?}},
  booktitle =	{Language Engineering for Model-Driven Software Development},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4101},
  editor =	{Jean Bezivin and Reiko Heckel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.15},
  URN =		{urn:nbn:de:0030-drops-237},
  doi =		{10.4230/DagSemProc.04101.15},
  annote =	{Keywords: no keywords}
}
  • Refine by Type
  • 24 Document/PDF
  • 5 Document/HTML

  • Refine by Publication Year
  • 5 2025
  • 1 2020
  • 1 2018
  • 1 2007
  • 16 2005

  • Refine by Author
  • 7 Heckel, Reiko
  • 2 Bézivin, Jean
  • 2 Cabrera, Benjamin
  • 2 Favre, Jean-Marie
  • 2 Gorp, Pieter Van
  • Show More...

  • Refine by Series/Journal
  • 7 LIPIcs
  • 17 DagSemProc

  • Refine by Classification
  • 2 Mathematics of computing → Bayesian networks
  • 2 Software and its engineering → Petri nets
  • 2 Theory of computation → Modal and temporal logics
  • 1 Theory of computation → Concurrency
  • 1 Theory of computation → Discrete optimization
  • Show More...

  • Refine by Keyword
  • 8 no keywords
  • 3 graph transformation
  • 2 Bayesian networks
  • 2 Dagstuhl Seminar 04101
  • 2 Petri nets
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact