A. Rabinovich. Automata over continuous time. Manuscript, 32 p., 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Streams, Stream Transformers and Domain Representations - Blanck.. (Correct)
....called signal operators. x Fig. 4. DA conversion of a digital signal o. Signals and operators on signals have been much studied in the literature from a computer science point of view, in particular in connection with hybrid systems [16] Automata over continuous time is considered in [51, 39]. As mentioned earlier, the only continuous functions from I into a discrete data set A are the constant functions. Thus the class of continuous signals is no more interesting than the data set A. On the other hand it should be clear, and will be apparent later, that the class of all signals is ....
A. RABINOVICH, Automata over continuous time, manuscript,1997.
A First Order Logic for Specification of Timed.. - Danièle.. (1999) (1 citation) (Correct)
....on the fact that the underlying theory of reals is decidable. And we have in fact only one logic to consider as compared with numerous temporal logics. The unifying framework [HR99, HR99] for temporal logics or the version of B uchi s second order monadic logic for continuous time [Tra98, Rab97, Rab98a, Rab98c] neither give sucient power of expressibility, though preserve the decidability. The decidable class of the veri cation problem we introduce here, models some niteness properties of practical systems of control. The niteness properties are formulated in terms of formula ....
A. Rabinovich. Automata over continuous time. Manuscript, 32 p., 1998.
Decidable Verification for Reducible Timed Automata.. - Beauquier, Slissenko (1998) (Correct)
No context found.
A. Rabinovich. Automata over continuous time. Manuscript, 32 p., 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC