Sciweavers

269 search results - page 28 / 54
» Computing with Probabilistic Cellular Automata
Sort
View
MCU
1998
170views Hardware» more  MCU 1998»
15 years 2 months ago
About the Universality of the Billiard ball model
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of in nite lattices. In the one-dimensionalcase, there exist BCA with 11 states which are unive...
Jérôme Olivier Durand-Lose
GPEM
2007
116views more  GPEM 2007»
15 years 1 months ago
Using evolvable genetic cellular automata to model breast cancer
Cancer is an evolutionary process; mutated cells are selected for abnormal growth and survivability. Here, a computer simulation is used to model ductal carcinoma in situ (DCIS), ...
Armand Bankhead, Robert B. Heckendorn
FOSSACS
2007
Springer
15 years 7 months ago
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
Augusto Parma, Roberto Segala
QEST
2008
IEEE
15 years 7 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...
FOCS
1997
IEEE
15 years 5 months ago
On the Power of Quantum Finite State Automata
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...
Attila Kondacs, John Watrous