49 search results - page 5 / 10 » Clearing Restarting Automata |
NAACL
2003
14 years 11 months ago
2003
We investigate the optimal LM treatment of abundant filled pauses (FP) in spontaneous monologues of a professional dictation task. Questions addressed here are (1) how to deal wi...
HYBRID
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we present a new design methodology for synchronous reactive systems, based on a clear separation between control and data flow parts. This methodology allows to fa...
ATVA
2008
Springer
15 years 10 days ago
2008
Springer
The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...
ESOP
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. In the eld of reactive system programming, data ow synchronous languages like Lustre BCH+85,CHPP87 or Signal GBBG85 o er a syntax similar to block-diagrams, and can be e ...
SEFM
2006
IEEE
15 years 4 months ago
2006
IEEE
We define a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is defin...