Results 1  10
of
108,017
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
DenseTimed Pushdown Automata
"... Abstractâ€”We propose a model that captures the behavior of realtime recursive systems. To that end, we introduce densetimed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of realvalued clocks, and ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Abstractâ€”We propose a model that captures the behavior of realtime recursive systems. To that end, we introduce densetimed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of realvalued clocks
Verification Methods for the Divergent Runs Of Clock Systems
 FTRTFT 94: Formal Techniques in Realtime and Faulttolerant Systems, Lecture Notes in Computer Science 863
, 1994
"... We present a methodology for proving temporal properties of the divergent runs of reactive systems with realvalued clocks. A run diverges if time advances beyond any bound. Since the divergent runs of a system may satisfy liveness properties that are not satisfied by some convergent runs, the st ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We present a methodology for proving temporal properties of the divergent runs of reactive systems with realvalued clocks. A run diverges if time advances beyond any bound. Since the divergent runs of a system may satisfy liveness properties that are not satisfied by some convergent runs
Reducing the Number of Clock Variables of Timed Automata
 Proc. RTSS'96, 7381, IEEE
, 1996
"... We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks whose values are relevant for the evolution of the system. The second one detects sets of clocks that are always equal. We ..."
Abstract

Cited by 77 (7 self)
 Add to MetaCart
automata [3, 13], are automata extended with a finite set of realvalued clocks that proceed at a uniform rate and constrain the times at which transitions occur. Since the time component makes the underlying transition system to be infinite, verification algorithms depend on the construction of a finite
Multiclock timed networks
 In Proc.LICS' 04
, 2004
"... Abstract. We consider verification of safety properties for parameterized systems of timed processes, so called timed networks. A timed network consists of a finite state process, called a controller, and an arbitrary set of identical timed processes. In a previous work, we showed that checking safe ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
safety properties is decidable in the case where each timed process is equipped with a single realvalued clock. It was left open whether the result could be extended to multiclock timed networks. We show that the problem becomes undecidable when each timed process has two clocks. On the other hand, we
Clock Difference Diagrams
 Nordic Journal of Computing
, 1999
"... We sketch a BDDlike structure for representing unions of simple convex polyhedra, describing the legal values of a set of clocks given bounds on the values of clocks and clock differences. 1 Introduction The basic problem we are trying to tackle is the combination BDD's and DBM's (differ ..."
Abstract

Cited by 26 (8 self)
 Add to MetaCart
algorithm for timed bisimulation ([WL97]). 2 Definition of CDD's We assume a finite set of realvalued clocks C = fX 1 ; : : : ; X k g. We are interested in a data structure to represent and manipulate sets of possible values of these clocks. In particular, we shall confine ourselves to sets being
Computing Optimal Reachability Costs in Priced DenseTimed Pushdown Automata
"... Abstract. We study priced densetimed pushdown automata that are a generalization of the classic model of pushdown automata, in the sense that they operate on realvalued clocks, and that the stack symbols have realvalued ages. Furthermore, the model allows a cost function that assigns transition c ..."
Abstract
 Add to MetaCart
Abstract. We study priced densetimed pushdown automata that are a generalization of the classic model of pushdown automata, in the sense that they operate on realvalued clocks, and that the stack symbols have realvalued ages. Furthermore, the model allows a cost function that assigns transition
Zenoness for Timed Pushdown Automata
"... Timed pushdown automata are pushdown automata extended with a finite set of realvalued clocks. Additionaly, each symbol in the stack is equipped with a value representing its age. The enabledness of a transition may depend on the values of the clocks and the age of the topmost symbol. Therefore, de ..."
Abstract
 Add to MetaCart
Timed pushdown automata are pushdown automata extended with a finite set of realvalued clocks. Additionaly, each symbol in the stack is equipped with a value representing its age. The enabledness of a transition may depend on the values of the clocks and the age of the topmost symbol. Therefore
Results 1  10
of
108,017