Sciweavers

143 search results - page 7 / 29
» Bisimulation for Labelled Markov Processes
Sort
View
AI
2006
Springer
13 years 11 months ago
Trace Equivalence Characterization Through Reinforcement Learning
In the context of probabilistic verification, we provide a new notion of trace-equivalence divergence between pairs of Labelled Markov processes. This divergence corresponds to the...
Josee Desharnais, François Laviolette, Kris...
ENTCS
2007
96views more  ENTCS 2007»
13 years 7 months ago
An Observational Theory for Mobile Ad Hoc Networks
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
Massimo Merro
AAAI
2010
13 years 9 months ago
Using Bisimulation for Policy Transfer in MDPs
Knowledge transfer has been suggested as a useful approach for solving large Markov Decision Processes. The main idea is to compute a decision-making policy in one environment and...
Pablo Samuel Castro, Doina Precup
ENTCS
2007
111views more  ENTCS 2007»
13 years 7 months ago
Reversibility and Models for Concurrency
There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [2...
Iain Phillips, Irek Ulidowski
SEFM
2006
IEEE
14 years 1 months ago
Product Automata and Process Algebra
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...
Kamal Lodaya