Search Results - "de Vink, Erik"
-
1
Lowerbounds for Bisimulation by Partition Refinement
Published in Logical methods in computer science (01-01-2023)“…We provide time lower bounds for sequential and parallel algorithms deciding bisimulation on labeled transition systems that use partition refinement. For…”
Get full text
Journal Article -
2
An efficient algorithm to determine probabilistic bisimulation
Published in Algorithms (01-09-2018)“…We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as…”
Get full text
Journal Article -
3
Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
Published in Logical methods in computer science (22-12-2015)“…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
Journal Article -
4
RNA-Editing with Combined Insertion and Deletion Preserves Regularity
Published in Scientific annals of computer science (01-01-2013)“…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
Journal Article -
5
A Definition Scheme for Quantitative Bisimulation
Published in Electronic proceedings in theoretical computer science (28-09-2015)“…FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as…”
Get full text
Journal Article -
6
Comparison of the molecular topologies of stress-activated transcription factors HSF1, AP-1, NRF2, and NF-κB in their induction kinetics of HMOX1
Published in BioSystems (01-10-2014)“…[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
Journal Article -
7
Rooted branching bisimulation as a congruence for probabilistic transition systems
Published in Electronic proceedings in theoretical computer science (28-09-2015)“…We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a…”
Get full text
Journal Article -
8
Decoupled execution of synchronous coordination models via behavioural automata
Published in Electronic proceedings in theoretical computer science (29-07-2011)“…Synchronous coordination systems allow the exchange of data by logically indivisible actions involving all coordinated entities. This paper introduces…”
Get full text
Journal Article -
9
Lowerbounds for Bisimulation by Partition Refinement
Published 10-05-2023“…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
Journal Article -
10
Towards a Feature mu-Calculus Targeting SPL Verification
Published in Electronic proceedings in theoretical computer science (28-03-2016)“…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
Journal Article -
11
Coherent branching feature bisimulation
Published in Electronic proceedings in theoretical computer science (12-04-2015)“…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
Journal Article -
12
Towards reduction of Paradigm coordination models
Published in Electronic proceedings in theoretical computer science (06-08-2011)“…The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component…”
Get full text
Journal Article -
13
-
14
-
15
-
16
A Cancellation Law for Probabilistic Processes
Published in Electronic proceedings in theoretical computer science (14-09-2023)Get full text
Journal Article -
17
Reo + mCRL2 : A framework for model-checking dataflow in service compositions
Published in Formal aspects of computing (01-03-2012)“…The paradigm of service-oriented computing revolutionized the field of software engineering. According to this paradigm, new systems are composed of existing…”
Get full text
Journal Article -
18
On Formal Methods Thinking in Computer Science Education
Published in Formal aspects of computing (01-06-2024)“…Formal Methods (FM) radically improve the quality of the code artefacts they help to produce. They are simple, probably accessible to first-year undergraduate…”
Get full text
Journal Article -
19
Compositional and behavior-preserving reconfiguration of component connectors in Reo
Published in Journal of visual languages and computing (01-06-2013)“…It is generally accepted that building software out of loosely coupled components, such as in service-oriented systems or mobile networks, yields applications…”
Get full text
Journal Article -
20
A hierarchy of probabilistic system types
Published in Theoretical computer science (25-10-2004)“…We arrange various classes of probabilistic systems studied in the literature in an expressiveness hierarchy. Our expressiveness criterion is the existence of…”
Get full text
Journal Article Conference Proceeding