Search

Computer Science for Future (CS4F) is an initiative in the Department of Computer Science at HAW Hamburg. The aim of the initiative is a paradigm shift in the discipline of computer science, thus establishing sustainability goals as a primary leitmotif for teaching and research. The focus is on teaching since the most promising multipliers are the students of a university. The change in teaching influences our research, the transfer to business and civil society as well as the change in our own institution. In this article, we present the initiative CS4F and reflect primarily on the role of students as amplifiers in the transformation process of computer science.

Medizinische cyberphysikalische Systeme erfordern einerseits die Adaption an patientenindividuelle Parameter während einer Behandlung und andererseits den Nachweis eines sicheren Systemverhaltens. Wir schlagen vor, Nachweisbarkeit mittels Online Model-Checking und Nachvollziehbarkeit durch Anwendung von regelbasierten Transformationen zu verbinden.

Hierarchical Petri nets allow a more abstract view and reconfigurable Petri nets model dynamic structural adaptation. In this contribution we present the combination of reconfigurable Petri nets and hierarchical Petri nets yielding hierarchical structure for reconfigurable Petri nets. Hierarchies are established by substituting transitions by subnets. These subnets are themselves reconfigurable, so they are supplied with their own set of rules. Moreover, global rules that can be applied in all of the net, are provided.

In this contribution we investigate several extensions of the powerset that comprise arbitrarily nested subsets, and call them superpower set. This allows the definition of graphs with possibly infinitely nested nodes. additionally we define edges that are incident to edges. Since we use coalgebraic constructions we refer to these graphs as corecursive graphs. The superpower set functors are examined and then used for the definition of $\mathcal{M}$-adhesive categories which are the basic categories for $\mathcal{M}$-adhesive transformation systems. So, we additionally show that coalgebras $\mathbf{Sets}_F$ are $\mathcal{M}$-adhesive categories provided the functor $F:\mathbf{Sets}_F \to \mathbf{Sets}_F$ preserves pullbacks along monomorphisms.

In this paper we deal with additional control structures for decorated PT Nets. The main contribution are inhibitor arcs and priorities. The first ensure that a marking can inhibit the firing of a transition. Inhibitor arcs force that the transition may only fire when the place is empty. an order of transitions restrict the firing, so that an transition may fire only if it has the highest priority of all enabled transitions. This concept is shown to be compatible with reconfigurable Petri nets.