Sciweavers

2632 search results - page 80 / 527
» Alternating Timed Automata
Sort
View
ATVA
2010
Springer
175views Hardware» more  ATVA 2010»
15 years 2 months ago
The Complexity of Codiagnosability for Discrete Event and Timed Systems
In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform c...
Franck Cassez
STOC
1987
ACM
104views Algorithms» more  STOC 1987»
15 years 5 months ago
The Boolean Formula Value Problem Is in ALOGTIME
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
Samuel R. Buss
FSTTCS
1998
Springer
15 years 5 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif
ISVLSI
2006
IEEE
95views VLSI» more  ISVLSI 2006»
15 years 7 months ago
PLAs in Quantum-dot Cellular Automata
Abstract— Research in the fields of physics, chemistry and electronics has demonstrated that Quantum-dot Cellular Automata (QCA) is a viable alternative for nano-scale computing...
Xiaobo Sharon Hu, Michael Crocker, Michael T. Niem...
CORR
2010
Springer
89views Education» more  CORR 2010»
15 years 1 months ago
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
David Doty