4485 search results - page 30 / 897 » Equivalences on Observable Processes |
ASPDAC
2007
ACM
14 years 19 days ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
BIRTHDAY
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
UAI
2000
13 years 10 months ago
2000
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
ICIP
2002
IEEE
14 years 10 months ago
2002
IEEE
AI
2006
Springer
14 years 12 days ago
2006
Springer
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...