Zobrazeno 1 - 10
of 65
pro vyhledávání: '"de Vink, Erik P."'
Autor:
Bezhanishvili, Nick, Ciancia, Vincenzo, Gabelaia, David, Jibladze, Mamuka, Latella, Diego, Massink, Mieke, de Vink, Erik P.
In the context of spatial logics and spatial model checking for polyhedral models -- mathematical basis for visualisations in continuous space -- we propose a weakening of simplicial bisimilarity. We additionally propose a corresponding weak notion o
Externí odkaz:
http://arxiv.org/abs/2404.06131
Publikováno v:
EPTCS 387, 2023, pp. 42-58
We show a cancellation property for probabilistic choice. If distributions mu + rho and nu + rho are branching probabilistic bisimilar, then distributions mu and nu are also branching probabilistic bisimilar. We do this in the setting of a basic proc
Externí odkaz:
http://arxiv.org/abs/2309.07306
Closure spaces, a generalisation of topological spaces, have shown to be a convenient theoretical framework for spatial model checking. The closure operator of closure spaces and quasi-discrete closure spaces induces a notion of neighborhood akin to
Externí odkaz:
http://arxiv.org/abs/2301.11634
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 topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial structures, such as
Externí odkaz:
http://arxiv.org/abs/2005.05578
Autor:
Wiklicky, Herbert, de Vink, Erik
Publikováno v:
EPTCS 250, 2017
This volume of the EPTCS contains the proceedings of the 15th international workshop on Qualitative Aspects of Programming Languages and Systems, QAPL 2017, held at April 23, 2017 in Uppsala, Sweden as a satellite event of ETAPS 2017, the 20th Europe
Externí odkaz:
http://arxiv.org/abs/1707.03668
Publikováno v:
EPTCS 206, 2016, pp. 61-75
The modal mu-calculus mu-L is a well-known fixpoint logic to express and model check properties interpreted over labeled transition systems. In this paper, we propose two variants of the mu-calculus, mu-Lf and mu-Lf', for feature transition systems.
Externí odkaz:
http://arxiv.org/abs/1604.00350
Publikováno v:
Logical Methods in Computer Science, Volume 11, Issue 4 (December 22, 2015) lmcs:1617
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which relate states to functions of states over general semirings, equipped with a rich set of higher-order operators. As such, FuTS constitute a convenien
Externí odkaz:
http://arxiv.org/abs/1511.05866
Publikováno v:
EPTCS 194, 2015, pp. 63-78
FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov chains, interactive Markov chains, and Markov automata. A general scheme
Externí odkaz:
http://arxiv.org/abs/1509.08563
Autor:
Lee, Matias D., de Vink, Erik P.
Publikováno v:
EPTCS 194, 2015, pp. 79-94
We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the qualitative case. Fo
Externí odkaz:
http://arxiv.org/abs/1509.08564