Decidability in pratt's process logics

  • Z. Habasiński
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 215)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. ChHMP 81.
    Chandra, A., J. Lalpern, A. Meyer and R. Parikh: "Equations between regular terms and an application to Process Logic", STOC'81, 384–390.Google Scholar
  2. FL 79.
    Fischer, M. J. and R. E. Ladner: "Propositional Dynamic Logic of regular programs", JCSS 18(2), 194–211.Google Scholar
  3. Hab 84.
    Habasiński, Z.: "Process Logic: two decidability results", LNCS 176, 282–290.Google Scholar
  4. Har 79.
    Harel, D.: "Two results on Process Logic", Inf. Processing Letters, 8(4), 195–198.Google Scholar
  5. HKP 82.
    Harel, D., D. Kozen and R. Parikh: "Process Logic: expressiveness, decidability, completeness", JCSS 25, 144–170.Google Scholar
  6. Pra 79.
    Pratt, V. R.: "Process Logic: preliminary report", POPL'79, 93–100.Google Scholar
  7. SPH 81.
    Sherman, R., A. Pnueli and D. Harel: "Is the interesting part of Process Logic uninteresting?", Rep. of Weizmann Inst. of Sci. Rehovot.Google Scholar
  8. Str 81.
    Street, R. S.: "Propositional Dynamic Logic of Looping and Converse", STOC'81, 375–381.Google Scholar
  9. Wol 82.
    Wolper, P. L.: "Synthesis of the Communicating Processes from Temporal Logic specifications", Rep. of Dep. Comp. Sci., Stanford.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Z. Habasiński
    • 1
    • 2
  1. 1.Computer CentreTechnical UniversityPoznańPoland
  2. 2.Mathematical Institute of PASPoznań

Personalised recommendations