Results 1  10
of
184,371
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
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
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
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.
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
Parametric Shape Analysis via 3Valued Logic
, 2001
"... Shape Analysis concerns the problem of determining "shape invariants"... ..."
Abstract

Cited by 660 (79 self)
 Add to MetaCart
Shape Analysis concerns the problem of determining "shape invariants"...
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
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
On the complexity of branchingtime logics
 of Lecture Notes in Computer Science
, 2009
"... Abstract. Hybrid branchingtime logics are introduced as extensions of CT Llike logics with state variables and the downarrowbinder. Following recent work in the linear framework, only logics with a single variable are considered. The expressive power and the complexity of satisfiability of the re ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. Hybrid branchingtime logics are introduced as extensions of CT Llike logics with state variables and the downarrowbinder. Following recent work in the linear framework, only logics with a single variable are considered. The expressive power and the complexity of satisfiability
A Simple Model of Capital Market Equilibrium with Incomplete Information
 JOURNAL OF FINANCE
, 1987
"... The sphere of modern financial economics encompases finance, micro investment theory and much of the economics of uncertainty. As is evident from its influence on other branches of economics including public finance, industrial organization and monetary theory, the boundaries of this sphere are both ..."
Abstract

Cited by 720 (2 self)
 Add to MetaCart
The sphere of modern financial economics encompases finance, micro investment theory and much of the economics of uncertainty. As is evident from its influence on other branches of economics including public finance, industrial organization and monetary theory, the boundaries of this sphere
Results 1  10
of
184,371