Sciweavers

384 search results - page 37 / 77
» On the Semantics of Markov Automata
Sort
View
QEST
2006
IEEE
15 years 8 months ago
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems
LiQuor is a tool for verifying probabilistic reactive systems modelled Probmela programs, which are terms of a probabilistic guarded command language with an operational semantics...
Frank Ciesinski, Christel Baier
AAAI
2007
15 years 4 months ago
Finding Related Pages Using Green Measures: An Illustration with Wikipedia
We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, ...
Yann Ollivier, Pierre Senellart
BC
2008
134views more  BC 2008»
15 years 2 months ago
Interacting with an artificial partner: modeling the role of emotional aspects
In this paper we introduce a simple model based on probabilistic finite state automata to describe an emotional interaction between a robot and a human user, or between simulated a...
Isabella Cattinelli, Massimiliano Goldwurm, N. Alb...
FGCS
2006
83views more  FGCS 2006»
15 years 1 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart
ENTCS
2002
139views more  ENTCS 2002»
15 years 1 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman