Advertisement

Axiomatizations of temporal logics on trace systems

  • Wojciech Penczek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 665)

Abstract

Partial order temporal logics interpreted on trace systems have been shown not to have finitary complete axiomatizations. The paper gives infinitary complete proof systems for several temporal logics on trace systems e.g. Partial Order Logic (POL), Computation Tree Logic with backward modalities, and an essential subset of Interleaving Set Temporal Logic (ISTL).

Keywords

Partial Order Temporal Logics Concurrency Trace Systems 

Classification

Theory of Parallel and Distributed Computation Logic in Computer Science Semantics and Logics of Programming Languages 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [GW91]
    Godefroid, P., Wolper, P., A Partial Approach to Model Checking, Proc. of LICS, 1991.Google Scholar
  2. [GKP92]
    Goltz, U., Kuiper, R., and Penczek, W., Propositional temporal logics and equivalences, Proc. of CONCUR'92, LNCS 630, pp. 222–236, 1992.Google Scholar
  3. [KP87]
    Katz, S., Peled, D., Interleaving Set Temporal Logic, 6th ACM Symposium on Principles of Distributed Computing, Vancouver Canada, pp. 178–190, 1987.Google Scholar
  4. [LPRT92]
    Lodaya, K., Parikh, R., Ramanujam, R., and Thiagarajan, P.S., A Logical Study of Distributed Transition Systems, submitted to publication.Google Scholar
  5. [Ma88]
    Mazurkiewicz, A., Basic Notions of Trace Theory, LNCS 354, pp. 285–363, 1988.Google Scholar
  6. [MS87]
    Mirkowska, G., and Salwicki, A., Algorithmic Logic, Reidel, Dordrecht and PWN, Warsaw 1987.Google Scholar
  7. [NRT91]
    Nielsen, M., Rozenberg, G., and Thiagarajan, Transition Systems, Event Structures and Unfoldings, in preparation, 1991.Google Scholar
  8. [Pa91]
    Paech, B., Concurrency as a Modality, PhD thesis, Munchen University, 1991.Google Scholar
  9. [Pe87]
    Peleg, D., Concurrent Dynamic Logic, Journal of ACM 34 (2), pp. 450–479, 1987.Google Scholar
  10. [Pe90]
    Penczek, W., A Concurrent Branching Time Temporal Logic, Proceedings of the Workshop on Computer Science Logic, Kaiserslautern, LNCS 440, pp. 337–354, 1990.Google Scholar
  11. [Pe92a]
    Penczek, W., Temporal Logics on Trace Systems, Proc. of the Workshop on Infinite Traces, Tubingen, 1992, also to appear in IJFCS.Google Scholar
  12. [Pe92b]
    Penczek, W., On Undecidability of Temporal Logics on Trace Systems, IPL 43, pp. 147–153, 1992.Google Scholar
  13. [PKP91]
    Peled, D., Katz, S., and Pnueli, A., Specifying and Proving Serializability in Temporal Logic, Proc. of LICS, 1991.Google Scholar
  14. [PP90]
    Peled, D., Pnueli, A., Proving Partial Order Liveness Properties, Proc. of ICALP, pp. 553–571, 1990.Google Scholar
  15. [PW84]
    Pinter, S.S., Wolper, P., A Temporal Logic for Reasoning about Partially Ordered Computations, Proc. 3rd Symp. on Principles of Distributed Computing, pp. 28–37, Vancouver 1984.Google Scholar
  16. [Re89]
    Reisig, W., Towards a Temporal Logic of Causality and Choice in Distributed Systems, LNCS 354, pp. 606–627, 1989.Google Scholar
  17. [Ro90]
    Rozoy, B., On Distributed Languages and Models for Distributed Computation, Technical Report 563, L.R.I., 1990.Google Scholar
  18. [RS70]
    Rasiowa, H., and Sikorski, R., The Mathematics of Metamathematics, PWN, Warsawa, 1970.Google Scholar
  19. [Si90]
    Sinachopoulos A, Partial Order Logics for Elementary Net Systems: State-and Event — approches, Proc. of CONCUR'90, 1990.Google Scholar
  20. [Sz87]
    Szalas, A., A complete axiomatic characterization of first-order temporal logic of linear time, TCS 54, pp. 199–214, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Wojciech Penczek
    • 1
  1. 1.Institute of Computer SciencePolish Academy of SciencesWarsawPoland

Personalised recommendations