Sciweavers

495 search results - page 4 / 99
» Automata and differentiable words
Sort
View
ENTCS
2006
96views more  ENTCS 2006»
13 years 6 months ago
Weighted Timed Automata: Model-Checking and Games
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...
Patricia Bouyer
JUCS
2002
91views more  JUCS 2002»
13 years 6 months ago
On Quasi-Products of Tree Automata
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...
Ferenc Gécseg
ICALP
2010
Springer
13 years 11 months ago
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
Hugo Gimbert, Youssouf Oualhadj
AMW
2010
13 years 7 months ago
What You Must Remember When Processing Data Words
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...
Michael Benedikt, Clemens Ley, Gabriele Puppis
TYPES
1993
Springer
13 years 10 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...