Sciweavers

512 search results - page 4 / 103
» Automata as Abstractions
Sort
View
WIA
2004
Springer
14 years 23 days ago
Testability of Oracle Automata
d abstract) Gaoyan Xie, Cheng Li, and Zhe Dang   School of Electrical Engineering and Computer Science Washington State University Pullman, WA 99164, USA Abstract. In this paper, ...
Gaoyan Xie, Cheng Li, Zhe Dang
TYPES
1993
Springer
13 years 11 months ago
Proof-Checking a Data Link Protocol
Abstract. A data link protocol developed and used by Philips Electronics is modeled and veri ed using I/O automata theory. Correctness is computer-checked with the Coq proof develo...
Leen Helmink, M. P. A. Sellink, Frits W. Vaandrage...
ATVA
2006
Springer
121views Hardware» more  ATVA 2006»
13 years 11 months ago
On the Succinctness of Nondeterminism
Abstract. Much is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on infinite words. Much less is known about the...
Benjamin Aminof, Orna Kupferman
ICALP
1998
Springer
13 years 11 months ago
Power of Cooperation and Multihead Finite Systems
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowsk...
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 7 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux