4 papers
math.CO2022
A Result on the Small Quasi-Kernel Conjecture
Allan van Hulst
Any directed graph in this work is assumed to be finite and without self-loops. A source in a directed graph is a vertex having at least one ingoing arc. A quasi-ke…
cs.LO2021
A Complete Axiom System for 1-Free Kleene Star Expressions under Bisimilarity: An Elementary Proof
Allan van Hulst
Grabmayer and Fokkink recently presented a finite and complete axiomatization for 1-free process terms over the binary Kleene star under bismilarity equivalence (proceedings of LIC…
math.CO2021
Adjoining edges to to construct a minimal dominating set of size
Allan van Hulst
For graphs it is possible to add edges to the Cartesian product such that a minimal dominating set of size e…
cs.FL2014
Maximally Permissive Controlled System Synthesis for Modal Logic
Allan van Hulst, Michel Reniers, Wan Fokkink
We propose a new method for controlled system synthesis on non-deterministic automata, which includes the synthesis for deadlock-freeness, as well as invariant and reachability exp…