Zobrazeno 1 - 6
of 6
pro vyhledávání: '"van Hulst, Allan"'
Autor:
van Hulst, Allan
Any directed graph $D=(V(D),A(D))$ 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-kernel $Q\subseteq V(D)$ is an independent set in $D$ such that every ve
Externí odkaz:
http://arxiv.org/abs/2212.12764
Autor:
van Hulst, Allan
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 LICS 2020, preprint available). A different and considerably simpler proo
Externí odkaz:
http://arxiv.org/abs/2111.11144
Autor:
van Hulst, Allan
For graphs $G,H$ it is possible to add $(|V(G)|-\gamma(G))(|V(H)|-\gamma(H))$ edges to the Cartesian product $G\mathbin{\square}H$ such that a minimal dominating set $D$ of size $\gamma(G)\gamma(H)$ emerges. We hypothesize that $D$ is also a minimum
Externí odkaz:
http://arxiv.org/abs/2111.08371
Autor:
van Hulst, Allan
A directed graph $D=(V(D),A(D))$ has a kernel if there exists an independent set $K\subseteq V(D)$ such that every vertex $v\in V(D)-K$ has an ingoing arc $u\mathbin{\longrightarrow}v$ for some $u\in K$. There are directed graphs that do not have a k
Externí odkaz:
http://arxiv.org/abs/2110.00789
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 expressions. Our technique restricts the behavior of a Kripke-structure w
Externí odkaz:
http://arxiv.org/abs/1408.3317
Publikováno v:
EPTCS 60, 2011, pp. 36-55
A supervisory controller controls and coordinates the behavior of different components of a complex machine by observing their discrete behaviour. Supervisory control theory studies automated synthesis of controller models, known as supervisors, base
Externí odkaz:
http://arxiv.org/abs/1108.1863