4485 search results - page 29 / 897 » Equivalences on Observable Processes |
119
click to vote
FSTTCS
2006
Springer
15 years 5 months ago
2006
Springer
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
108
click to vote
IANDC
2006
15 years 1 months ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
118
click to vote
PRICAI
2000
Springer
15 years 5 months ago
2000
Springer
This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converte...
124
click to vote
SOSP
2007
ACM
15 years 10 months ago
2007
ACM
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
129
click to vote
CMSB
2009
Springer
15 years 8 months ago
2009
Springer
A major challenge in computational systems biology is the articulation of a biological process in a form which can be understood by the biologist yet is amenable to computational e...