Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
In this note we consider the computability of the solution of the initial-value problem for ordinary differential equations with continuous right-hand side. We present algorithms ...
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
The notion of branching bisimulation for the alternating model of probabilistic systems is not a congruence with respect to parallel composition. In this paper we first define ano...
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
We explore the relation between the stochastic semantic associated to stochastic Concurrent Constrain Programming (sCCP) and its fluid-flow approximation. Writing the master equat...
istic Abstract Interpretation Alessandra Di Pierro1 Pascal Sotin2 Herbert Wiklicky3 Within the context of a quantitative generalisation of the well established framework of Abstra...
Alessandra Di Pierro, Pascal Sotin, Herbert Wiklic...
We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an ...
In this paper we consider a model of different sorting of receptors for Fibroblast Growth Factor via the endocytotic pathway. In order to accurately model the relocation in the di...
Steffen van Bakel, Ikra Khan, Maria Grazia Vigliot...