Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Martens, Jan"'
Autor:
Martens, Jan, Groote, Jan Friso
We study the problem of computing minimal distinguishing formulas for non-bisimilar states in finite LTSs. We show that this is NP-hard if the size of the formula must be minimal. Similarly, the existence of a short distinguishing trace is NP-complet
Externí odkaz:
http://arxiv.org/abs/2307.05265
Autor:
Martens, Jan
In this paper, we present a proof of the NP-completeness of computing the smallest Deterministic Finite Automaton (DFA) that distinguishes two given regular languages as DFAs. A distinguishing DFA is an automaton that recognizes a language which is a
Externí odkaz:
http://arxiv.org/abs/2306.03533
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 2 (May 11, 2023) lmcs:9212
We provide time lower bounds for sequential and parallel algorithms deciding bisimulation on labeled transition systems that use partition refinement. For sequential algorithms this is $\Omega((m \mkern1mu {+} \mkern1mu n ) \mkern-1mu \log \mkern-1mu
Externí odkaz:
http://arxiv.org/abs/2203.07158
The most efficient way to calculate strong bisimilarity is by calculation the relational coarsest partition on a transition system. We provide the first linear time algorithm to calculate strong bisimulation using parallel random access machines (PRA
Externí odkaz:
http://arxiv.org/abs/2105.11788
Autor:
Meyermans, Roel, Heylen, Olivier, Bouhuijzen Wenger, Jessica, Martens, Jan, Buys, Nadine *, Janssens, Steven *
Publikováno v:
In Poultry Science January 2024 103(1)
We present a way to implement term rewriting on a GPU. We do this by letting the GPU repeatedly perform a massively parallel evaluation of all subterms. We find that if the term rewrite systems exhibit sufficient internal parallelism, GPU rewriting s
Externí odkaz:
http://arxiv.org/abs/2009.07174
Autor:
Kuperberg, Denis, Martens, Jan
We study the relation of containment up to unknown regular resynchronization between two-way non-deterministic transducers. We show that it constitutes a preorder, and that the corresponding equivalence relation is properly intermediate between origi
Externí odkaz:
http://arxiv.org/abs/2002.07558
Autor:
Martens, Jan, Blankenbach, Jörg
Publikováno v:
In Graphical Models December 2023 130
Publikováno v:
In Advanced Engineering Informatics August 2023 57