Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...
Michael von der Beeck, Volker Braun, Andreas Cla&s...
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...