Results 1  10
of
642,835
Model Checking the Branching Time Temporal Logic CTL
, 1997
"... Reachability analysis is a method for analyzing the dynamic behavior of a concurrent system. One way of specifying the properties that the behaviors of the system must fulfill is to use the branching time temporal logic CTL (Computation tree logic). The process of checking whether the behavior of th ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Reachability analysis is a method for analyzing the dynamic behavior of a concurrent system. One way of specifying the properties that the behaviors of the system must fulfill is to use the branching time temporal logic CTL (Computation tree logic). The process of checking whether the behavior
1 A Resolution Calculus for the BranchingTime Temporal Logic CTL
"... The branchingtime temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules. ..."
Abstract
 Add to MetaCart
The branchingtime temporal logic CTL is useful for specifying systems that change over time and involve quantification over possible futures. Here we present a resolution calculus for CTL that involves the translation of formulae to a normal form and the application of a number of resolution rules
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 615 (55 self)
 Add to MetaCart
Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Model checking games for branching time logics
 Journal of Logic and Computation
, 2002
"... This paper defines and examines model checking games for the branching time temporal logic CTL ∗. The games employ a technique called focus which enriches sets by picking out one distinguished element. This is necessary to avoid ambiguities in the regeneration of temporal operators. The correctness ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
This paper defines and examines model checking games for the branching time temporal logic CTL ∗. The games employ a technique called focus which enriches sets by picking out one distinguished element. This is necessary to avoid ambiguities in the regeneration of temporal operators. The correctness
Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic
 In: Kozen, D., Ed., Logics of Programs
, 1982
"... We propose a method of constructing concurrent programs in which the synchronization skeleton of the program ~s automatically synthesized from a highlevel (branching time) Temporal Logic specification. The synchronization skeleton is an abstraction of the actual program where detail irrelevant to ..."
Abstract

Cited by 1019 (55 self)
 Add to MetaCart
We propose a method of constructing concurrent programs in which the synchronization skeleton of the program ~s automatically synthesized from a highlevel (branching time) Temporal Logic specification. The synchronization skeleton is an abstraction of the actual program where detail irrelevant
Formalization of CTL∗ in calculus of inductive constructions
, 2006
"... A modular formalization of the branching time temporal logic CTL∗ is presented. Our formalization subsumes prior formalizations of propositional linear temporal logic (PTL) and computation tree logic (CTL). Moreover, the modularity allows to instantiate our formalization for different formal securi ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A modular formalization of the branching time temporal logic CTL∗ is presented. Our formalization subsumes prior formalizations of propositional linear temporal logic (PTL) and computation tree logic (CTL). Moreover, the modularity allows to instantiate our formalization for different formal
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
A CTLbased logic for program abstractions
 In Proceedings of WoLLIC’10, volume 6188 of LNCS
"... Abstract. We define an actionbased extension of the branchingtime temporal logic CTL which allows path quantifiers to be restricted by interpretation. A reduction from a concrete system to an abstract one may contain spurious traces which can render the verification of the abstract system useless ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. We define an actionbased extension of the branchingtime temporal logic CTL which allows path quantifiers to be restricted by interpretation. A reduction from a concrete system to an abstract one may contain spurious traces which can render the verification of the abstract system
BranchingTime Logics with Path Relativisation
"... We define extensions of the full branchingtime temporal logic CTL ∗ in which the path quantifiers are relativised by formal languages of infinite words, and consider its natural fragments obtained by extending the logics CTL and CTL+ in the same way. This yields a small and twodimensional hierarch ..."
Abstract
 Add to MetaCart
We define extensions of the full branchingtime temporal logic CTL ∗ in which the path quantifiers are relativised by formal languages of infinite words, and consider its natural fragments obtained by extending the logics CTL and CTL+ in the same way. This yields a small and two
Results 1  10
of
642,835