Results 1  10
of
2,089
The Common Fragment of CTL and LTL
 In IEEE Symposium on Foundations of Computer Science
, 2000
"... It is wellknown that CTL and LTL have incomparable expressive power. In this paper, we give an inductive definition of those ACTL formulas that can be expressed in LTL. In addition, we obtain a procedure to decide whether an ACTL formula lies in LTL, and show that this problem is PSPACE complete. B ..."
Abstract

Cited by 47 (1 self)
 Add to MetaCart
It is wellknown that CTL and LTL have incomparable expressive power. In this paper, we give an inductive definition of those ACTL formulas that can be expressed in LTL. In addition, we obtain a procedure to decide whether an ACTL formula lies in LTL, and show that this problem is PSPACE complete
The Common Fragment of ACTL and LTL
"... The paper explores the relationship between tree languages definable in LTL, CTL, and ACTL, the fragment of CTL where only universal path quantification is allowed. The common fragment of LTL and ACTL is shown to be strictly smaller than the common fragment of LTL and CTL. Furthermore, an algorithm ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
The paper explores the relationship between tree languages definable in LTL, CTL, and ACTL, the fragment of CTL where only universal path quantification is allowed. The common fragment of LTL and ACTL is shown to be strictly smaller than the common fragment of LTL and CTL. Furthermore
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 variety of temporal logic: alternatingtime temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves. While lineartime and branchingtime logics are natural specification languages for closed systems, alternatingtime logics are natural specification languages for open systems. For example, by preceding the temporal operator "eventually" with a selective path quantifier, we can specify that in the game between the system and the environment, the system has a strategy to reach a certain state. Also the problems of receptiveness, realizability, and controllability can be formulated as modelchecking problems for alternatingtime formulas.
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.
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 385 (39 self)
 Add to MetaCart
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like modelchecking for branchingtime logics), we consider the more general class of alternating pushdown systems and use alternating finitestate automata as a representation structure for their sets of configurations. We give a simple and natural procedure to compute sets of predecessors for this representation structure. We apply this procedure and the automatatheoretic approach to modelchecking to define new modelchecking algorithms for pushdown systems and both linear and branchingtime properties. From these results we derive upper bounds for several modelchecking problems, and we also provide matching lower bounds, using reductions based on some techniques introduced by Walukiewicz.
Logic in Computer Science: Modelling and Reasoning about Systems
, 1999
"... ion. ACM Transactions on Programming Languages and Systems, 16(5):15121542, September 1994. Bibliography 401 [Che80] B. F. Chellas. Modal Logic  an Introduction. Cambridge University Press, 1980. [Dam96] D. R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesi ..."
Abstract

Cited by 345 (11 self)
 Add to MetaCart
ion. ACM Transactions on Programming Languages and Systems, 16(5):15121542, September 1994. Bibliography 401 [Che80] B. F. Chellas. Modal Logic  an Introduction. Cambridge University Press, 1980. [Dam96] D. R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Institute for Programming research and Algorithmics. Eindhoven University of Technology, July 1996. [Dij76] E. W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976. [DP96] R. Davies and F. Pfenning. A Modal Analysis of Staged Computation. In 23rd Annual ACM Symposium on Principles of Programming Languages. ACM Press, January 1996. [EN94] R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Benjamin/Cummings, 1994. [FHMV95] Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995. [Fit93] M. Fitting. Basic modal logic. In D. Gabbay, C. Hogger, and J. Robinson, editors, Handbook of Logic in Artificial In...
Evaluating LTL Satisfiability Solvers
"... Abstract. We perform a comprehensive experimental evaluation of offtheshelf solvers for satisfiability of propositional LTL. We consider a wide range of solvers implementing three major classes of algorithms: reduction to model checking, tableaubased approaches, and temporal resolution. Our set of ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We perform a comprehensive experimental evaluation of offtheshelf solvers for satisfiability of propositional LTL. We consider a wide range of solvers implementing three major classes of algorithms: reduction to model checking, tableaubased approaches, and temporal resolution. Our set
unknown title
"... The common fragment of CTL and LTL needs existential modalities The language “all paths belong to (ab) ∗ a(ab) ∗ c ω ” is definable in CTL, but not in ACTL, which is the fragment of CTL that only uses universal modalities. CTL [1] is the temporal branching time logic that uses the modalities: AϕUψ ..."
Abstract
 Add to MetaCart
The common fragment of CTL and LTL needs existential modalities The language “all paths belong to (ab) ∗ a(ab) ∗ c ω ” is definable in CTL, but not in ACTL, which is the fragment of CTL that only uses universal modalities. CTL [1] is the temporal branching time logic that uses the modalities: Aϕ
An AutomataTheoretic Approach to Constraint LTL
, 2003
"... We consider an extension of lineartime temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automatatheoretic technique to show pspace decidability of the logic for the constraint systems (Z, <, =) and (N, <, =). Along the way, we give an automatatheoretic ..."
Abstract

Cited by 32 (7 self)
 Add to MetaCart
We consider an extension of lineartime temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automatatheoretic technique to show pspace decidability of the logic for the constraint systems (Z, <, =) and (N, <, =). Along the way, we give an automata
LTL over integer periodicity constraints
 Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), volume 2987 of LNCS
, 2004
"... Abstract. Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTL mod, an extension of LinearTime Temporal Logic LTL with pasttime operators ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
Abstract. Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTL mod, an extension of LinearTime Temporal Logic LTL with past
Results 1  10
of
2,089