The Joys of Graph Transformation

We believe that the technique of graph transformation offers a very natural way to specify semantics for languages that have dynamic allocation and linking structure; for instance, object-oriented programming languages, but also languages for mobility. In this note we expose, on a rather informal level, the reasons for this belief. Our hope in doing this is to raise interest in this technique and so generate more interest in the fascinating possibilities and open questions of this area.\u

Denotational, Causal, and Operational Determinism in Event Structures

Determinism is a theoretically and practically important concept in labelled transition systems and trees. We study its generalisation to event structures. It turns out that the result depends on what characterising property of tree determinism one sets out to generalise. We present three distinct notions of event structure determinism, and show that none of them shares all the pleasant properties of the one concept for trees

Semisimple Quantum Cohomology and Blow-ups

Using results of Gathmann, we prove the following theorem: If a smooth projective variety X has generically semisimple (p,p)-quantum cohomology, then the same is true for the blow-up of X at any number of points. This a successful test for a modified version of Dubrovin's conjecture from the ICM 1998.Comment: 13 page

The Problem of Low and Unequal Voter Turnout - and What We Can Do About It. IHS Political Science Series No. 54, February 1998

Low voter turnout has become a serious problem in most democracies, not only in the United States but also in many West European countries – and even in a traditionally high-turnout country like Austria where turnout has also been declining in recent years. There are five reasons why we should be concerned about this problem: 1. Low turnout means low participation by less privileged citizens, who are already at a disadvantage in terms of other forms of political participation. 2. Unequal participation means unequal influence. 3. Actual turnout tends to be lower than the official turnout figures suggest. 4. Turnout in elections other than those at the national level tends to be particularly low. 5. Turnout is declining in most countries. The problem of low and unequal turnout can be solved by a number of institutional mechanisms such as proportional representation, concurrent and infrequent elections, weekend instead of weekday voting, and compulsory voting. The last of these – mandatory voting – is especially strong and effective, and also morally justified

Isomorphism Checking for Symmetry Reduction

In this paper, we show how isomorphism checking can be used as an effective technique for symmetry reduction. Reduced state spaces are equivalent to the original ones under a strong notion of bisimilarity which preserves the multiplicity of outgoing transitions, and therefore also preserves stochastic temporal logics. We have implemented this in a setting where states are arbitrary graphs. Since no efficiently computable canonical representation is known for arbitrary graphs modulo isomorphism, we define an isomorphism-predicting hash function on the basis of an existing partition refinement algorithm. As an example, we report a factorial state space reduction on a model of an ad-hoc network connectivity protocol

Isomorphism Checking in GROOVE

In this paper we show how isomorphism checking can be used as an effective technique for symmetry reduction in graph-based state spaces, despite the inherent complexity of the isomorphism problem. In particular, we show how one can use element-based graph certificate mappings to help in recognising nonisomorphic graphs. These are mappings that assign to all elements (edges and nodes) of a given graph a number that is invariant under isomorphism, in the sense that any isomorphism between graphs is sure to preserve this number. The individual element certificates of a graph give rise to a certificate for the entire graph, which can be used as a hash key for the graph; hence, this yields a heuristic to decide whether a graph has an isomorphic representative in a previously computed set of graphs. We report some experiments that show the viability of this method. \u

Subjects, Models, Languages, Transformations

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)