Download:
|
by Ecole Normale, Suprieure Cachan, A. Rabinovich
http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/rr-lsv-2000-8.rr.ps
Add To MetaCart
Abstract:
We show that ECTL, the classical extension of CTL with fairness properties, is expressively equivalent to BTL2. BTL2 is the branching time logic with abritrary quantication over paths, and where path formulas are restricted to quantier depth rst-order formulas in the monadic logic of order. This result provides a natural yardstick by which to measure the expressive power of ECTL
Citations
|
1633
|
Computational Complexity
– Papadimitriou
- 1994
|
|
1515
|
Model Checking
– Clarke, Grumberg, et al.
- 1999
|
|
1371
|
The Temporal Logic of Reactive and Concurrent Systems
– Manna, Pnueli
- 1992
|
|
923
|
E.A.: Temporal and modal logic
– Emerson
- 1990
|
|
594
|
Design and synthesis of synchronization skeletons using branching time temporal logic
– Clarke, Emerson
- 1981
|
|
190
|
Tense Logic and the Theory of Linear Order
– Kamp
- 1968
|
|
148
|
An application of games to the completeness problem for formalized theories, Fund
– Ehrenfeucht
- 1961
|
|
136
|
The temporal logic of branching time
– Ben-Ari, Manna, et al.
- 1983
|
|
124
|
Limits to Parallel Computation: P-Completeness Theory
– Greenlaw, Hoover, et al.
- 1995
|
|
97
|
Decision procedures and expressiveness in the temporal logic of branching time
– Emerson, Halpern
- 1985
|
|
87
|
Characterizing correctness properties of parallel programs Using Fixpoints
– Emerson, Clarke
- 1980
|
|
78
|
Automatic veri of concurrent systems using temporal logic speci
– Clarke, Emerson, et al.
- 1986
|
|
36
|
Fairness and Related Properties in Transition Systems — A Temporal Logic to Deal with Fairness
– Queille, Sifakis
- 1983
|
|
35
|
Temporal Veri of Reactive Systems: Safety
– Manna, Pnueli
- 1995
|
|
31
|
The complexity of propositional linear temporal logics in simple cases
– Demri, Schnoebelen
|
|
24
|
Sometime' is sometimes `not never
– Lamport
- 1980
|
|
19
|
The decision problem for branching time logic
– Gurevich, Shelah
- 1985
|
|
19
|
Quantitative temporal logic
– Hirshfeld, Rabinovich
- 1998
|
|
17
|
Sometimes" and \not never" Revisited: on Branching vs. Linear Time
– Emerson, Halpern
- 1986
|
|
13
|
Computation tree logic CTL and path quanti in the monadic theory of the binary tree
– Hafer, Thomas
- 1987
|
|
11
|
On the expressive power of CTL
– Moller, Rabinovich
- 1999
|
|
10
|
and Chin-Laung Lei. Modalities for model checking: Branching time logic strikes back
– Emerson
- 1987
|
|
4
|
Why so many temporal logics climb up the trees
– Rabinovich, Maoz
- 2000
|
|
3
|
Logique temporelle avec passe pour la speci et la veri des systemes reactifs. These de Doctorat, I.N.P. de
– Laroussinie
- 1994
|
|
1
|
Model checking CTL + is hard
– Schnoebelen
- 2000
|
