Results 1  10
of
7,557
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
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
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 10 (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
Branching Time Temporal Logic and Tree Automata
, 1995
"... In temporallogic model checking, we verify the correctness of a program with respect to a desired behavior by checking whether a structure that models the program satisfies a temporal logic formula that specifies this behavior. The close connection between lineartime temporal logics and the theory ..."
Abstract
 Add to MetaCart
of automata on infinite words has been an active area of research. In particular, automatatheoretic techniques have proven to be an effective approach to lineartime model checking. On the other hand, for branchingtime temporal logics, current automatatheoretic techniques involve an exponential blow up
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
Pushdown Module Checking for BranchingTime Temporal Logics
"... In system modeling, a main distinction is between closed systems, whose behavior is totally determined by the program, and open systems, which are systems where the program interacts with an external environment [HP85, Hoa85]. In order to check whether a closed system satisfies a required property, ..."
Abstract
 Add to MetaCart
, we translate the system into a formal model (such as a transition system), specify the property with a temporallogic formula (such as CTL [CE81], CTL โ [EH86], and ยตcalculus [Koz83]), and check formally that the model satisfies the formula. This process is called model checking ([CE81, QS81
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
A Clausal Resolution Method for CTL BranchingTime Temporal Logic
, 1999
"... In this paper we extend our clausal resolution method for linear time temporal logics to a branchingtime framework. Thus, we propose an efficient deductive method useful in a variety of applications requiring an expressive branchingtime temporal logic in AI. The branchingtime temporal logic consi ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
In this paper we extend our clausal resolution method for linear time temporal logics to a branchingtime framework. Thus, we propose an efficient deductive method useful in a variety of applications requiring an expressive branchingtime temporal logic in AI. The branchingtime temporal logic
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

Cited by 1 (0 self)
 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
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
Results 1  10
of
7,557