Results 1  10
of
166
TCTL Inevitability Analysis of DenseTime Systems
 LNCS 2759
, 2003
"... Inevitability properties in branching temporal logics are of the syntax ∀♦φ, where φ is an arbitrary (timed) CTL formula. In the sense that ”good things will happen”, they are parallel to the ”liveness” properties in linear temporal logics. Such inevitability properties in densetime logics can be a ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
Inevitability properties in branching temporal logics are of the syntax ∀♦φ, where φ is an arbitrary (timed) CTL formula. In the sense that ”good things will happen”, they are parallel to the ”liveness” properties in linear temporal logics. Such inevitability properties in densetime logics can
ModelChecking DenseTime Duration Calculus
, 1998
"... Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of Duration Calculus [ZHS93] it is wellknown that decidable fragments of Duration Calculus can only be obtained through withdrawal of much of the interesting vocabulary of this logic. While this was formerly taken ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of Duration Calculus [ZHS93] it is wellknown that decidable fragments of Duration Calculus can only be obtained through withdrawal of much of the interesting vocabulary of this logic. While this was formerly
ModelChecking DenseTime Duration Calculus
 Proceedings of the Duration Calculus Track of the 33rd European Summer School on Logic, Language and Information. Universita Saarbrucken
, 1998
"... . Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of densetime Duration Calculus [ZHS93] it is wellknown that decidable fragments of Duration Calculus can only be obtained through withdrawal of much of the interesting vocabulary of this logic. While this was f ..."
Abstract
 Add to MetaCart
. Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of densetime Duration Calculus [ZHS93] it is wellknown that decidable fragments of Duration Calculus can only be obtained through withdrawal of much of the interesting vocabulary of this logic. While
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 327 (7 self)
 Add to MetaCart
Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends
A DenseTime Temporal Logic with nice Compositionality Properties
, 1997
"... . A dense temporal logic specification method for the development of reactive systems is introduced. The two development constructs of this method are refinement and composition. A reactive system is specified by a pair consisting of a machine and a condition on the computations of this machine. In ..."
Abstract
 Add to MetaCart
. A dense temporal logic specification method for the development of reactive systems is introduced. The two development constructs of this method are refinement and composition. A reactive system is specified by a pair consisting of a machine and a condition on the computations of this machine
Using Stochastic State Classes in Quantitative Evaluation of DenseTime Reactive Systems
"... Abstract—In the verification of reactive systems with nondeterministic densely valued temporal parameters, the statespace can be covered through equivalence classes, each composed of a discrete logical location and a dense variety of clock valuations encoded as a Difference Bounds Matrix (DBM). The ..."
Abstract

Cited by 16 (12 self)
 Add to MetaCart
Abstract—In the verification of reactive systems with nondeterministic densely valued temporal parameters, the statespace can be covered through equivalence classes, each composed of a discrete logical location and a dense variety of clock valuations encoded as a Difference Bounds Matrix (DBM
Digitizing Interval Duration Logic
 IN CAV 2003
, 2003
"... Interval Duration Logic, (IDL), is a dense time logic for specifying properties of realtime systems. Its validity is undecidable. A corresponding discretetime logic QDDC has decidable validity. In this paper, we consider a reduction of IDL validity question to QDDC validity using notions of digiti ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Interval Duration Logic, (IDL), is a dense time logic for specifying properties of realtime systems. Its validity is undecidable. A corresponding discretetime logic QDDC has decidable validity. In this paper, we consider a reduction of IDL validity question to QDDC validity using notions
Model Checking via Reachability Testing for Timed Automata
, 1997
"... In this paper we develop an approach to modelchecking for timed automata via reachability testing. As our specification formalism, we consider a densetime logic with clocks. This logic may be used to express safety and bounded liveness properties of realtime systems. We show how to automatically ..."
Abstract

Cited by 47 (13 self)
 Add to MetaCart
In this paper we develop an approach to modelchecking for timed automata via reachability testing. As our specification formalism, we consider a densetime logic with clocks. This logic may be used to express safety and bounded liveness properties of realtime systems. We show how to automatically
The Benefits of Relaxing Punctuality
, 1996
"... The most natural, compositional, way of modeling realtime systems uses a dense domain for time. The satis ability of timing constraints that are capable of expressing punctuality in this model, however, is known to be undecidable. We introduce a temporal language that can constrain the time differe ..."
Abstract

Cited by 257 (17 self)
 Add to MetaCart
difference between events only with finite, yet arbitrary, precision and show the resulting logic to be EXPSPACEcomplete. This result allows us to develop an algorithm for the verification of timing properties of realtime systems with a dense semantics.
Dense Realtime Games
 IN LICS 02
, 2002
"... The rapid development of complex and safetycritical systems requires the use of reliable verification methods and tools for system design (synthesis). Many systems of interest are reactive, in the sense that their behavior depends on the interaction with the environment. A natural framework to mode ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
. We express winning conditions by formulas of the branchingtime temporal logic TCTL. While timed games have been studied in the literature, timed games with densetime winning conditions constitute a new research topic. The main result of this paper is an exponentialtime algorithm to check
Results 1  10
of
166