Results 1  10
of
655
On the Expressivity and Complexity of Quantitative BranchingTime Temporal Logics
, 2001
"... We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discretetime framework, and study the expressive power of several relevant logics. When only subscripted modalities are used, polynomialtime model checking is possible even f ..."
Abstract
 Add to MetaCart
We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discretetime framework, and study the expressive power of several relevant logics. When only subscripted modalities are used, polynomialtime model checking is possible even
An AutomataTheoretic Approach to BranchingTime Model Checking
 JOURNAL OF THE ACM
, 1998
"... Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing lineartime modelchecking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automatatheoretic techniques ..."
Abstract

Cited by 354 (66 self)
 Add to MetaCart
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing lineartime modelchecking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata
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 620 (53 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
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 1020 (56 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
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 1388 (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
Memoryfull BranchingTime Logic
"... Abstract. Traditional branchingtime logics such as CTL ⋆ are memoryless: once a path in the computation tree is quantified at a given node, the computation that led to that node is forgotten. Recent work in planing suggests that CTL ⋆ cannot easily express temporal goals that refer to whole computa ..."
Abstract
 Add to MetaCart
Abstract. Traditional branchingtime logics such as CTL ⋆ are memoryless: once a path in the computation tree is quantified at a given node, the computation that led to that node is forgotten. Recent work in planing suggests that CTL ⋆ cannot easily express temporal goals that refer to whole
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
A Decidable Dense Branchingtime Temporal Logic
 In Proc. of the 20th Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS'00, LNCS 1974
, 2000
"... Timed computation tree logic (Tctl) extends Ctl by allowing timing constraints on the temporal operators. The semantics of Tctl is defined on a dense tree. The satisfiability of Tctlformulae is undecidable even if the structures are restricted to dense trees obtained from timed graphs. According ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Timed computation tree logic (Tctl) extends Ctl by allowing timing constraints on the temporal operators. The semantics of Tctl is defined on a dense tree. The satisfiability of Tctlformulae is undecidable even if the structures are restricted to dense trees obtained from timed graphs. According
An extended branchingtime Ockhamist temporal logic
 Journal of Logic, Language and Information
, 1999
"... Abstract. For branchingtime temporal logic based on an Ockhamist semantics, we explore a temporal language extended with two additional syntactic tools. For reference to the set of all possible futures at a moment of time we use syntactically designated “restricted variables ” called fannames. Fo ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. For branchingtime temporal logic based on an Ockhamist semantics, we explore a temporal language extended with two additional syntactic tools. For reference to the set of all possible futures at a moment of time we use syntactically designated “restricted variables ” called fan
BranchingTime Temporal Logics with Minimal Model Quantifiers
, 2009
"... Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the correctness of a system with respect to its desired behavior (specification), by verifying whether a model of the system sat ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
challenging issue is to extend the expressiveness of classical temporal logics, in order to model more complex specifications. In this paper, we address both issues by extending the classical branchingtime temporal logic CTL ∗ with minimal model quantifiers (MCTL ∗). These quantifiers allow to extract, from
Results 1  10
of
655