Results 1  10
of
89,612
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
using finitely many realvalued clock variables. Automated analysis of timed automata relies on the construction of a finite quotient of the infinite space of clock valuations. Over the years, the formalism has been extensively studied leading to many results establishing connections to circuits
UPPAAL in a Nutshell
, 1997
"... . This paper presents the overall structure, the design criteria, and the main features of the tool box Uppaal. It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a realtime system, to simulate its dynamical behavior, ..."
Abstract

Cited by 662 (51 self)
 Add to MetaCart
and verification of realtime systems, based on constraintsolving and onthefly techniques, developed jointly by Uppsala University and Aalborg University. It is appropriate for systems that can be modeled as a collection of nondeterministic processes with finite control structure and realvalued clocks
Real Clock Time Animation Support for Developing Software Visualizations
 Australian Computer Journal
, 1995
"... Developers building software visualizations must use a graphics library and user interface toolkit as an underlying support platform. Often, these support environments are large, difficult to learn, lowlevel, and lacking primitives for capabilities such as animation. We have developed a graphics su ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
support environment called PolkaRC for building software visualizations. PolkaRC is a second generation system that leverages the continuous animation primitives of the mature system Polka, and adds the capability of specifying real clock timebased animation activations and durations. The new Polka
RHex: A simple and highly mobile hexapod robot
, 2001
"... In this paper, the authors describe the design and control of RHex, a power autonomous, untethered, compliantlegged hexapod robot. RHex has only six actuators—one motor located at each hip— achieving mechanical simplicity that promotes reliable and robust operation in realworld tasks. Empirically ..."
Abstract

Cited by 314 (53 self)
 Add to MetaCart
In this paper, the authors describe the design and control of RHex, a power autonomous, untethered, compliantlegged hexapod robot. RHex has only six actuators—one motor located at each hip— achieving mechanical simplicity that promotes reliable and robust operation in realworld tasks. Empirically
Optimal Clock Synchronization
 Journal of the ACM
, 2003
"... We present a simple, efficient, and unified solution to the problems of synchronizing, initializing, and integrating clocks for systems with different types of failures: crash, omission, and arbitrary failures with and without message authentication. This is the ft known solution that achieves optim ..."
Abstract

Cited by 158 (0 self)
 Add to MetaCart
optimal accuracy  the accuracy of synchronized clocks (with respect to real time) is as good as that specified for the underlying hardware clocks. The solution is also optimal with respect to the number of faulty processes that can be tolerated to achieve this accuracy.
5th EUROPEAN FREQUENCY AND TIME FORUM BESANGON 121314 MARCH 1991 Promise into Practice: Implementing TA2 on Real Clocks at NIST
"... TA2 is a time scale algorithm designed to run as a postprocessor by smoothing, i.e. combining estimates from runs in both forward and backward temporal directions. It has been tasted using the timescale data at NIST from 1989 through the first half of 1990. We review the characterization parameter ..."
Abstract
 Add to MetaCart
parameters for clocks with white Fn, om, and randomwalk FU, a,, and the dependence of these estimates on integration tine, r. We also discuss the transformation of these parameters from their use as time deviations to frequency variances. Ue compare the scale generated by TA2 over 541 d starting
What Good Are Digital Clocks?
, 1992
"... . Realtime systems operate in "real," continuous time and state changes may occur at any realnumbered time point. Yet many verification methods are based on the assumption that states are observed at integer time points only. What can we conclude if a realtime system has been shown ..."
Abstract

Cited by 141 (14 self)
 Add to MetaCart
. Realtime systems operate in "real," continuous time and state changes may occur at any realnumbered time point. Yet many verification methods are based on the assumption that states are observed at integer time points only. What can we conclude if a realtime system has been shown
Logics and Models of Real Time: A Survey
"... We survey logicbased and automatabased languages and techniques for the specification and verification of realtime systems. In particular, we discuss three syntactic extensions of temporal logic: timebounded operators, freeze quantification, and time variables. We also discuss the extension of ..."
Abstract

Cited by 221 (15 self)
 Add to MetaCart
We survey logicbased and automatabased languages and techniques for the specification and verification of realtime systems. In particular, we discuss three syntactic extensions of temporal logic: timebounded operators, freeze quantification, and time variables. We also discuss the extension
Results 1  10
of
89,612