Results 1  10
of
112,990
The synchronous dataflow programming language LUSTRE
 Proceedings of the IEEE
, 1991
"... This paper describes the language Lustre, which is a dataflow synchronous language, designed for programming reactive systems  such as automatic control and monitoring systems  as well as for describing hardware. The dataflow aspect of Lustre makes it very close to usual description tools in t ..."
Abstract

Cited by 646 (50 self)
 Add to MetaCart
in these domains (blockdiagrams, networks of operators, dynamical samplessystems, etc: : : ), and its synchronous interpretation makes it well suited for handling time in programs. Moreover, this synchronous interpretation allows it to be compiled into an efficient sequential program. Finally, the Lustre
Some Results on the Decidability of Duration Calculus under Synchronous Interpretation
 LNCS
, 1996
"... Duration Calculus (or DC in short) presents a formal notation to specify properties of realtime systems and a calculus to formally prove such properties. Decidability is the underlying foundation to automated reasoning. But, excepting some of its simple fragments, DC has been shown to be undecidable ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Duration Calculus (or DC in short) presents a formal notation to specify properties of realtime systems and a calculus to formally prove such properties. Decidability is the underlying foundation to automated reasoning. But, excepting some of its simple fragments, DC has been shown to be undecidable. DC takes the set of real numbers to represent time. The main reason of undecidability comes from the assumption that, in a realtime system, state changes can occur at any time point. But an implementation of a specification is ultimately executed on a computer, and there states change according to a system clock. Under such an assumption, it has been shown that the decidability results can be extended to cover relatively richer subsets of DC. In this report, we extend such decidability results to still richer subsets of DC.
Some Decidability Results for Duration Calculus under Synchronous Interpretation
 FORMAL TECHNIQUES IN REALTIME AND FAULTTOLERANT SYSTEMS (FTRTFT'98), VOLUME 1486 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1998
"... Duration Calculus (or DC in short) presents a formal notation to specify properties of realtime systems and a calculus to formally prove such properties. Decidability is the underlying foundation to automated reasoning. But, excepting some of its simple fragments, DC has been shown to be undecidab ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Duration Calculus (or DC in short) presents a formal notation to specify properties of realtime systems and a calculus to formally prove such properties. Decidability is the underlying foundation to automated reasoning. But, excepting some of its simple fragments, DC has been shown to be undecidable. DC takes the set of real numbers to represent time. The main reason of undecidability comes from the assumption that, in a realtime system, state changes can occur at any time point. But an implementation of a specification is ultimately executed on a computer, and there states change according to a system clock. Under such an assumption, it has been shown that the decidability results can be extended to cover relatively richer subsets of DC. In this paper, we extend such decidability results to still richer subsets of DC.
Measuring phasesynchrony in brain signals
 Hum. Brain Mapp
, 1999
"... r r Abstract: This article presents, for the first time, a practical method for the direct quantification of frequencyspecific synchronization (i.e., transient phaselocking) between two neuroelectric signals. The motivation for its development is to be able to examine the role of neural synchronie ..."
Abstract

Cited by 346 (6 self)
 Add to MetaCart
r r Abstract: This article presents, for the first time, a practical method for the direct quantification of frequencyspecific synchronization (i.e., transient phaselocking) between two neuroelectric signals. The motivation for its development is to be able to examine the role of neural
CoArray Fortran for parallel programming
 ACM FORTRAN FORUM
, 1998
"... CoArray Fortran, formerly known as F, is a small extension of Fortran 95 for parallel processing. A CoArray Fortran program is interpreted as if it were replicated a number of times and all copies were executed asynchronously. Each copy has its own set of data objects and is termed an image. The ..."
Abstract

Cited by 278 (7 self)
 Add to MetaCart
CoArray Fortran, formerly known as F, is a small extension of Fortran 95 for parallel processing. A CoArray Fortran program is interpreted as if it were replicated a number of times and all copies were executed asynchronously. Each copy has its own set of data objects and is termed an image
A Static Analyzer for Large SafetyCritical Software
, 2003
"... We show that abstract interpretationbased static program analysis can be made e#cient and precise enough to formally verify a class of properties for a family of large programs with few or no false alarms. This is achieved by refinement of a general purpose static analyzer and later adaptation to p ..."
Abstract

Cited by 271 (54 self)
 Add to MetaCart
We show that abstract interpretationbased static program analysis can be made e#cient and precise enough to formally verify a class of properties for a family of large programs with few or no false alarms. This is achieved by refinement of a general purpose static analyzer and later adaptation
Turbo synchronization: an EM algorithm interpretation
 In Proc. IEEE International Conference on Communications (ICC
, 2003
"... This paper is devoted to turbo synchronization, that is to say the use of soft information to estimate parameters like carrier phase, frequency offset or timing within a turbo receiver. It is shown how maximumlikelihood estimation of those synchronization parameters can be implemented by means of t ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
This paper is devoted to turbo synchronization, that is to say the use of soft information to estimate parameters like carrier phase, frequency offset or timing within a turbo receiver. It is shown how maximumlikelihood estimation of those synchronization parameters can be implemented by means
Analysis of Synchronization and Aliasing with Abstract Interpretation
"... We present a framework for the automatic determination of synchronization and aliasing properties of a functional language extended with concurrency constructs (a subset of Concurrent ML). Synchronization properties state which processes, and at what process histories, may be simultaneously active d ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We present a framework for the automatic determination of synchronization and aliasing properties of a functional language extended with concurrency constructs (a subset of Concurrent ML). Synchronization properties state which processes, and at what process histories, may be simultaneously active
Results 1  10
of
112,990