Sciweavers

41 search results - page 5 / 9
» Hyperfinite Approximations to Labeled Markov Transition Syst...
Sort
View
IANDC
2010
116views more  IANDC 2010»
13 years 6 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
BMCBI
2007
173views more  BMCBI 2007»
13 years 7 months ago
Predicting state transitions in the transcriptome and metabolome using a linear dynamical system model
Background: Modelling of time series data should not be an approximation of input data profiles, but rather be able to detect and evaluate dynamical changes in the time series dat...
Ryoko Morioka, Shigehiko Kanaya, Masami Y. Hirai, ...
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
Mario Bravetti
CRV
2005
IEEE
208views Robotics» more  CRV 2005»
14 years 1 months ago
Topology Inference for a Vision-Based Sensor Network
In this paper we describe a technique to infer the topology and connectivity information of a network of cameras based on observed motion in the environment. While the technique c...
Dimitri Marinakis, Gregory Dudek
SAC
2005
ACM
14 years 1 months ago
Formal modeling and quantitative analysis of KLAIM-based mobile systems
KLAIM is an experimental language designed for modeling and programming distributed systems composed of mobile components where distribution awareness and dynamic system architect...
Rocco De Nicola, Diego Latella, Mieke Massink