Abstract. We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a suitable formalism for verification. We present a tableau-based decision procedure and a model-checking algorithm for TPTL. Several genemlizations of TPTL are shown to be highly undecidable
We define a new temporal logic called CTL[k-QDDC]. It extends CTL with the ability to specify branch...
We investigate the verification problem of timed automata w.r.t. linear-time dense time temporal log...
AbstractWe investigate extensions of CTL allowing to express quantitative requirements about an abst...
We survey logic-based and automata-based languages and techniques for the specification and verific...
Abstract. A substantially large class of programs operate in distributed and real-time nvironments, ...
We present a new temporal logic for the specification and verification of real-time systems. This lo...
We develop a timeout based extension of propositional linear tempo-ral logic (which we call TLTL) to...
Temporal logic is a useful tool for specifying correctness properties of reactive programs. In parti...
We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted o...
We investigate extensions of CTL allowing to express quantitative requirements about an abstract not...
. We extend the specification language of temporal logic, the corresponding verification framework, ...
This paper presents a new methodology for model checking real-time systems based on the abstraction ...
Various logical formalisms with the freeze quantifier have been recently considered to model compute...
Formal properties represent a cornerstone of the system-correctness proofs based on formal verificat...
AbstractIn this paper, we present several timed extensions of temporal logics, that can be used for ...
We define a new temporal logic called CTL[k-QDDC]. It extends CTL with the ability to specify branch...
We investigate the verification problem of timed automata w.r.t. linear-time dense time temporal log...
AbstractWe investigate extensions of CTL allowing to express quantitative requirements about an abst...
We survey logic-based and automata-based languages and techniques for the specification and verific...
Abstract. A substantially large class of programs operate in distributed and real-time nvironments, ...
We present a new temporal logic for the specification and verification of real-time systems. This lo...
We develop a timeout based extension of propositional linear tempo-ral logic (which we call TLTL) to...
Temporal logic is a useful tool for specifying correctness properties of reactive programs. In parti...
We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted o...
We investigate extensions of CTL allowing to express quantitative requirements about an abstract not...
. We extend the specification language of temporal logic, the corresponding verification framework, ...
This paper presents a new methodology for model checking real-time systems based on the abstraction ...
Various logical formalisms with the freeze quantifier have been recently considered to model compute...
Formal properties represent a cornerstone of the system-correctness proofs based on formal verificat...
AbstractIn this paper, we present several timed extensions of temporal logics, that can be used for ...
We define a new temporal logic called CTL[k-QDDC]. It extends CTL with the ability to specify branch...
We investigate the verification problem of timed automata w.r.t. linear-time dense time temporal log...
AbstractWe investigate extensions of CTL allowing to express quantitative requirements about an abst...