On Lamport's comparison between linear and branching time temporal logic
Graf, Susanne
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984), p. 345-353 / Harvested from Numdam
Publié le : 1984-01-01
@article{ITA_1984__18_4_345_0,
     author = {Graf, Susanne},
     title = {On Lamport's comparison between linear and branching time temporal logic},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {18},
     year = {1984},
     pages = {345-353},
     mrnumber = {775837},
     zbl = {0551.68033},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1984__18_4_345_0}
}
Graf, Susanne. On Lamport's comparison between linear and branching time temporal logic. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984) pp. 345-353. http://gdmltest.u-ga.fr/item/ITA_1984__18_4_345_0/

1. E. M. Clarke and E. A. Emerson, Design and synthesis of synchronization skeletons using branching time logic, Harvard University TR-12-81.

2. E. A. Emerson, Alternative semantics for temporal logics, University of Texas at Austin, TR-182.

3. E. A. Emerson and J. Y Halpern, Decision procedure and expressiveness in temporal logic of branching time, 14th Annual ACM Symp. on Theory of Computing, 1982.

4. E. A. Emerson and J. Y. Halpern, "Sometimes" and "Not Never" revisited: on branching versus linear time, ACM Symp. on Principals of Programming Languages.

5. L. Lamport, "Sometimes" is sometimes "Not Never", 7th Annual ACM Symp. on Principals of Programming Languages, 1980.

6. A. Pnueli, The temporal logic of concurrent Programs, 19th Annual Symp. on Foundations on Computer Science, 1971.

7. J. P. Queille and J. Sifakis, Specification and verification of concurrent Systems in CESAR, 5th International Symp. on Programming, 1982. | MR 807187 | Zbl 0482.68028