Algebre de machines et logique temporelle

  • Max Michel
Contibuted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)


This paper shows the relation between linear temporal logic and theory of languages of concurrent processes. To this purpose, we give an algebraic correspondence between temporal logic systems and some non deterministic sequential machines. This correspondence lies on an effective method which composes machines as temporal operators. So we can synthetise processes from temporal logic formulas and solve logic problems by algorithms applied to machines.


Temporal Logic Linear Temporal Logic Temporal Logic Formula Nous Allons Branch Time Temporal Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A-N]
    A. ARNOLD et M. NIVAT: "Comportements de processus" Rapport LITP 82-12. Université de Paris VII. 1982.Google Scholar
  2. [BMP]
    M. BEN ARI, Z. MANNA, A. PNUELI: "The Temporal Logic of Branching Time". Proceedings of the Eighth ACM Symposium on Principles of Programming Languages, Williamsburg, VA, 1981.Google Scholar
  3. [CE]
    E.M. CLARKE, E.A. EMERSON: "Design and Synthesis of synchronisation skeleton using branching time temporal logic". Proceedings of Workshop on Logics of Programs, Lecture Note in Computer Science no 131.Google Scholar
  4. [CES]
    E.M. CLARKE, E.A. EMERSON, A.P. SISTLA: "Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications". A practical Approach". ACM 1983.Google Scholar
  5. [CS]
    E.M. CLARKE, A.P. SISTLA: "The complexity of propositional linear temporal logics"; ACM 1982.Google Scholar
  6. [EIL]
    EILENBERG: "Automata, Languages and Machines". Vol. A. Academic Press (1974).Google Scholar
  7. [MIC]
    M. MICHEL: "Machines Algebra and Temporal Logic" (A paraître).Google Scholar
  8. [MP]
    Z. MANNA et A. PNUELI: "Verification of concurrent Programs: The temporal framework" in the Correctness Problem in Computer Science (R.S. Boyer et J.S. Moore Eds.), International Lecture Series in C.S., AP Londres 1981.Google Scholar
  9. [MW]
    Z. MANNA et P. WOLPER: "Synthesis of communicating processes from temporal logic specifications". Proceedings of Workshop Logics of Programs, Lecture Note in Computer Science no 131.Google Scholar
  10. [NIV]
    M. NIVAT: "Behaviours of synchronized systems of Processes", Rapport LITP 81-64. Université de Paris VII (1981).Google Scholar
  11. [PNU1]
    A. PNUELI: "The Temporal Logic of Programs", Proc. 18th FOCS, Providence, RI, November 1977.Google Scholar
  12. [PNU2]
    A. PNUELI: "The Temporal Semantics of Concurrent Programs", Proc. Symposium on Semantics of Concurrent Computations. Evian, France (1979). L.N.C.S. no 70.Google Scholar
  13. [T-B]
    TRAKHTENBRODT et BARZDIN: "Finite Automata" North Holland-American Elsevier (1973).Google Scholar
  14. [WOL]
    P. WOLPER: "Temporal Logic can be more expressive", Proceedings of the Twenty-Second Symposium on Foundations of Computer Science, Nashville, TN, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Max Michel
    • 1
  1. 1.LCR/ENST/LITP-Paris 7Paris

Personalised recommendations