Geodesic
TTL : a formalism to describe local and global properties of distributed systems
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 2, pp. 115-149.

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1992__26_2_115_0,
     author = {Masini, A. and Maggiolo-Schettini, A.},
     title = {TTL : a formalism to describe local and global properties of distributed systems},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {115--149},
     publisher = {EDP-Sciences},
     volume = {26},
     number = {2},
     year = {1992},
     mrnumber = {1166784},
     zbl = {0766.68035},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1992__26_2_115_0/}
}
TY  - JOUR
AU  - Masini, A.
AU  - Maggiolo-Schettini, A.
TI  - TTL : a formalism to describe local and global properties of distributed systems
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1992
SP  - 115
EP  - 149
VL  - 26
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1992__26_2_115_0/
LA  - en
ID  - ITA_1992__26_2_115_0
ER  - 
%0 Journal Article
%A Masini, A.
%A Maggiolo-Schettini, A.
%T TTL : a formalism to describe local and global properties of distributed systems
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1992
%P 115-149
%V 26
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1992__26_2_115_0/
%G en
%F ITA_1992__26_2_115_0
Masini, A.; Maggiolo-Schettini, A. TTL : a formalism to describe local and global properties of distributed systems. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 2, pp. 115-149. http://geodesic.mathdoc.fr/item/ITA_1992__26_2_115_0/

1. J. Van Benthem, Modal Logic and Classical Logic, Bibliopolis, Napoli, 1985. | Zbl | MR

2. M. Ben-Ari, A. Pnueli and Z. Manna, The Temporal Logic of Branching Time, Acta Inform., 1983, 20, pp. 207-226. | Zbl | MR

3. E. M. Clarke, E. A. Emerson and A. P. Sistla, Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, A.C.M. Trans. Prog. Lang. Syst., 1986, 8, pp. 244-263. | Zbl

4. E. M. Clarke, O. Grumberg and R. P. Kurshan, A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems, "Logic at Botik '89", Lect. Notes in Comput. Sci., 1989, 363, Springer, Berlin, pp. 81-90. | Zbl | MR

5. E. M. Clarke, D. E. Long and K. L. Mcmillan, Compositional Model Checking, "Fourth Annual Symposium on Logic in Computer Science", I.E.E.E. Computer Society Press, Washington, D.C., 1989, pp. 353-362. | Zbl

6. M. Danelutto and A. Masini, A Temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems, "CSL'88", Lecture Notes in Comput. Sci, 1989, 385, Springer, Berlin, pp. 63-79. | Zbl | MR

7. P. Degano, R. De Nicola and U. Montanari, A Distributed Operational Semantics for CCS Based on Condition/Event Systems, Acta Inform., 1987, 26, pp. 59-91. | Zbl | MR

8. E. A. Emerson, Alternative Semantics for Temporal Logics, Theoret. Comput. Sci., 1983, 26, pp. 121-130. | Zbl | MR

9. E. A. Emerson and E. M. Clarke, Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons, Sci. Comput. Programming, 1982, 2, pp. 241-266. | Zbl

10. E. A. Emerson and J. Y. Halpern, Décision Procedures and Expressiveness in the Temporal Logic of Branching Time, J. Comput. System Sci., 1985, 30, pp. 1-24. | Zbl | MR

11. E. A. Emerson and J. Y. Halpern, "Sometimes" and "Not Never" Revisited: On Branching Versus Linear Time Temporal Logic, J. A.C.M., 1986, 33, pp. 151-178. | Zbl | MR

12. E. A. Emerson and C. L. Lei, Modalities for Model Checking: Branching Time Strikes Back, 12th A.C.M. Symposium on Principles of Programming Languages, 1985, pp. 84-96.

13. E. A. Emerson and A. P. Sistla, Deciding Full Branching Time Logic, Inform. and Control, 1984, 61, pp. 175-201. | Zbl | MR

14. P. Enjalbert and M. Michel, Many-Sorted Temporal Logic for Multi-Process Systems, "Mathematical Foundations of Computer Science, 1984", Lecture Notes in Comput. Sci., 176, Springer, Berlin, 1984, pp. 273-281. | Zbl | MR

15. F. Kröger, Temporal Logic of Programs, Springer, Berlin, 1987. | Zbl | MR

16. L. Lamport, "Sometimes" is Sometimes "Not Never": On the Temporal Logic of Programs, 7th A.C.M. Symposium on Principles of Programming Languages, 1980, pp. 174-185.

17. K. Lodaya and P. S. Thiagarajan, A Modal Logic for a Subclass of Event Structures, Automata Languages and Programming '87, Lecture Notes in Comput. Sci., 1987. 267, Springer, Berlin, pp. 290-303. | Zbl | MR

18. Z. Manna and P. Wolper, Synthesis of Communicating Process from Temporal Logic Specifications, A.C.M. Trans. Prog. Lang. Syst., 1984, 6, pp. 68-93. | Zbl

19. A. Masini, I Sistemi di Interazione: una proposta di formalizzazione logico-temporale e di realizzazione semanticamente corretta, Tesi di Laurea in Scienze dell'Informazione,Università di Pisa, 1986.

20. V. Nguyen, A. Demers, D. Gries and S. Owicki, A Model and Temporal Proof System for Networks of Processes, Distributed Computing, 1986, 1, pp. 7-25. | Zbl

21. H. F. Wedde, An Iterative and Starvation-Free Solution for a General Class of Distributed Control Problems Based on Interaction Primitives, Theoret. Comput. Sci., 1983, 24, pp. 1-20. | Zbl | MR