Sciweavers

109 search results - page 21 / 22
» A temporal logic for Markov chains
Sort
View
CONCUR
2008
Springer
13 years 7 months ago
Abstraction for Stochastic Systems by Erlang's Method of Stages
ion for Stochastic Systems by Erlang's Method of Stages Joost-Pieter Katoen1 , Daniel Klink1 , Martin Leucker2 , and Verena Wolf3 1 RWTH Aachen University 2 TU Munich 3 EPF La...
Joost-Pieter Katoen, Daniel Klink, Martin Leucker,...
AAAI
1994
13 years 7 months ago
Forming Beliefs about a Changing World
The situation calculus is a popular technique for reasoning about action and change. However, its restriction to a firstorder syntax and pure deductive reasoning makes it unsuitab...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...
TCAD
1998
115views more  TCAD 1998»
13 years 5 months ago
Probabilistic modeling of dependencies during switching activity analysis
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
Radu Marculescu, Diana Marculescu, Massoud Pedram
SIGMETRICS
2002
ACM
115views Hardware» more  SIGMETRICS 2002»
13 years 5 months ago
Maximum likelihood network topology identification from edge-based unicast measurements
Network tomography is a process for inferring "internal" link-level delay and loss performance information based on end-to-end (edge) network measurements. These methods...
Mark Coates, Rui Castro, Robert Nowak, Manik Gadhi...
IANDC
2010
116views more  IANDC 2010»
13 years 4 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...