Sciweavers

ENTCS
2008
103views more  ENTCS 2008»
13 years 3 months ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
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...
M. Praveen, Kamal Lodaya
ENTCS
2008
64views more  ENTCS 2008»
13 years 3 months ago
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
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 ...
Pieter Collins, Daniel S. Graça
ENTCS
2008
106views more  ENTCS 2008»
13 years 3 months ago
Computability and Representations of the Zero Set
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...
Pieter Collins
ENTCS
2008
115views more  ENTCS 2008»
13 years 3 months ago
Branching Bisimulation Congruence for Probabilistic Systems
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...
Nikola Trcka, Sonja Georgievska
ENTCS
2008
110views more  ENTCS 2008»
13 years 3 months ago
Game-Based Probabilistic Predicate Abstraction in PRISM
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...
ENTCS
2008
146views more  ENTCS 2008»
13 years 3 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
ENTCS
2008
101views more  ENTCS 2008»
13 years 3 months ago
On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation
We explore the relation between the stochastic semantic associated to stochastic Concurrent Constrain Programming (sCCP) and its fluid-flow approximation. Writing the master equat...
Luca Bortolussi
ENTCS
2008
89views more  ENTCS 2008»
13 years 3 months ago
Relational Analysis and Precision via Probabilistic Abstract Interpretation
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...
ENTCS
2008
73views more  ENTCS 2008»
13 years 3 months ago
Oracle-Based Partial Evaluation
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 ...
Claudio Ochoa, Germán Puebla
ENTCS
2008
99views more  ENTCS 2008»
13 years 3 months ago
Modelling Intracellular Fate of FGF Receptors With BioAmbients
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...