Sciweavers

269 search results - page 36 / 54
» Computing with Probabilistic Cellular Automata
Sort
View
74
Voted
IPPS
2007
IEEE
15 years 4 months ago
Implementing Hirschberg's PRAM-Algorithm for Connected Components on a Global Cellular Automaton
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
Johannes Jendrsczok, Rolf Hoffmann, Jörg Kell...
93
Voted
QEST
2010
IEEE
14 years 7 months ago
Fortuna: Model Checking Priced Probabilistic Timed Automata
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
Jasper Berendsen, David N. Jansen, Frits W. Vaandr...
67
Voted
ICCD
2008
IEEE
204views Hardware» more  ICCD 2008»
15 years 6 months ago
Bridging the gap between nanomagnetic devices and circuits
— This paper looks at designing circuit elements that will be constructed with nanoscale magnets within the Quantum-dot Cellular Automata (QCA) computational paradigm. In magneti...
Michael T. Niemier, Xiaobo Sharon Hu, Aaron Dingle...
LICS
1998
IEEE
15 years 1 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
CONCUR
2003
Springer
15 years 2 months ago
A Process-Algebraic Language for Probabilistic I/O Automata
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka