Search Results - "De Vink, Erik P"

Lowerbounds for Bisimulation by Partition Refinement by Groote, Jan Friso, Martens, Jan, de Vink, Erik. P.

“…We provide time lower bounds for sequential and parallel algorithms deciding bisimulation on labeled transition systems that use partition refinement. For…”
Get full text

An efficient algorithm to determine probabilistic bisimulation by Groote, J.F., Rivera Verduzco, H.J., de Vink, E.P.

“…We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as…”
Get full text

Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically by Latella, Diego, Massink, Mieke, De Vink, Erik P

“…Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which relate states to functions of states over general…”
Get full text

Rooted branching bisimulation as a congruence for probabilistic transition systems by Lee, Matias D., de Vink, Erik P.

“…We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a…”
Get full text

Comparison of the molecular topologies of stress-activated transcription factors HSF1, AP-1, NRF2, and NF-κB in their induction kinetics of HMOX1 by Pronk, Tessa E., van der Veen, Jochem W., Vandebriel, Rob J., van Loveren, Henk, de Vink, Erik P., Pennings, Jeroen L.A.

“…[Display omitted] •We model the efficiency of HSF1, AP-1, NRF2, and NF-κB to remove inducers of stress.•The TF circuits were modelled at comparable levels of…”
Get full text

Towards a Feature mu-Calculus Targeting SPL Verification by ter Beek, Maurice H., de Vink, Erik P., Willemse, Tim A. C.

“…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…”
Get full text

Coherent branching feature bisimulation by Belder, Tessa, ter Beek, Maurice H., de Vink, Erik P.

“…Progress in the behavioral analysis of software product lines at the family level benefits from further development of the underlying semantical theory. Here,…”
Get full text

Lowerbounds for Bisimulation by Partition Refinement by Groote, Jan Friso, Martens, Jan, de Vink, Erik. P

“…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…”
Get full text

RNA-Editing with Combined Insertion and Deletion Preserves Regularity by de Vink, Erik P, Zantema, Hans, Bosnacki, Dragan

“…We consider two elementary forms of string rewriting called guided insertion/deletion and guided rewriting. The original strings are modified depending on the…”
Get full text

On Bisimilarity for Quasi-discrete Closure Spaces by Ciancia, Vincenzo, Latella, Diego, Massink, Mieke, de Vink, Erik P

“…Closure spaces, a generalisation of topological spaces, have shown to be a convenient theoretical framework for spatial model checking. The closure operator of…”
Get full text

Weak Simplicial Bisimilarity for Polyhedral Models and SLCS_eta -- Extended Version by 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…”
Get full text

Weak Simplicial Bisimilarity and Minimisation for Polyhedral Model Checking by Bezhanishvili, Nick, Bussi, Laura, Ciancia, Vincenzo, Gabelaia, David, Jibladze, Mamuka, Latella, Diego, Massink, Mieke, de Vink, Erik P

“…The work described in this paper builds on the polyhedral semantics of the Spatial Logic for Closure Spaces (SLCS) and the geometric spatial model checker…”
Get full text

Rooted branching bisimulation as a congruence for probabilistic transition systems by Lee, Matias D, de Vink, Erik P

“…EPTCS 194, 2015, pp. 79-94 We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching…”
Get full text

Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically by Latella, Diego, Massink, Mieke, De Vink, Erik P

“…Logical Methods in Computer Science, Volume 11, Issue 4 (December 22, 2015) lmcs:1617 Labeled state-to-function transition systems, FuTS for short, are…”
Get full text

Coherent branching feature bisimulation by Belder, Tessa, ter Beek, Maurice H, de Vink, Erik P

“…EPTCS 182, 2015, pp. 14-30 Progress in the behavioral analysis of software product lines at the family level benefits from further development of the…”
Get full text

Towards a Feature mu-Calculus Targeting SPL Verification by ter Beek, Maurice H, de Vink, Erik P, Willemse, Tim A. C

“…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…”
Get full text