Free Access
RAIRO-Theor. Inf. Appl.
Volume 26, Number 2, 1992
Page(s) 115 - 149
Published online 01 February 2017
  1. 1. J. VAN BENTHEM, Modal Logic and Classical Logic, Bibliopolis, Napoli, 1985. [MR: 832432] [Zbl: 0639.03014] [Google Scholar]
  2. 2. M. BEN-ARI, A. PNUELI and Z. MANNA, The Temporal Logic of Branching Time, Acta Inform., 1983, 20, pp. 207-226. [MR: 733676] [Zbl: 0533.68036] [Google Scholar]
  3. 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: 0591.68027] [Google Scholar]
  4. 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. [MR: 1030568] [Zbl: 0688.68019] [Google Scholar]
  5. 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: 0716.68035] [Google Scholar]
  6. 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. [MR: 1035562] [Zbl: 0746.68030] [Google Scholar]
  7. 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. [MR: 969870] [Zbl: 0656.68061] [Google Scholar]
  8. 8. E. A. EMERSON, Alternative Semantics for Temporal Logics, Theoret. Comput. Sci., 1983, 26, pp. 121-130. [MR: 726915] [Zbl: 0559.68050] [Google Scholar]
  9. 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: 0514.68032] [Google Scholar]
  10. 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. [MR: 788828] [Zbl: 0559.68051] [Google Scholar]
  11. 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. [MR: 820103] [Zbl: 0629.68020] [Google Scholar]
  12. 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. [Zbl: 0615.68019] [Google Scholar]
  13. 13. E. A. EMERSON and A. P. SISTLA, Deciding Full Branching Time Logic, Inform. and Control, 1984, 61, pp. 175-201. [MR: 773404] [Zbl: 0593.03007] [Google Scholar]
  14. 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. [MR: 783456] [Zbl: 0558.68026] [Google Scholar]
  15. 15. F. KRÖGER, Temporal Logic of Programs, Springer, Berlin, 1987. [MR: 889458] [Zbl: 0609.03007] [Google Scholar]
  16. 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. [Google Scholar]
  17. 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. [MR: 912717] [Zbl: 0643.68026] [Google Scholar]
  18. 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: 0522.68030] [Google Scholar]
  19. 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. [Google Scholar]
  20. 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: 0598.68025] [Google Scholar]
  21. 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. [MR: 707645] [Zbl: 0511.68013] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.