5 search results - page 1 / 1 » Deciding Bisimilarity and Similarity for Probabilistic Proce... |
JCSS
2000
13 years 5 months ago
2000
FOSSACS
2003
Springer
13 years 10 months ago
2003
Springer
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...
FORMATS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
GECCO
2010
Springer
13 years 10 months ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...