Skip to main content
SpringerLink
Log in

Extending temporal logic by explicit concurrency

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1991 (MFCS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 520))

Abstract

I define a logic with structural operators for sequential and parallel composition. It is shown to characterize the state spaces of occurrence nets. The logic has the finite model property and a sound and complete axiomatization. It is the first formalism to combine negation with structural operators.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.Ehrenfeucht, G.Rozenberg Partial (set) 2-structures, Part I,II (Acta Informatica 27,4, 1990)

    Google Scholar 

  2. D.Harel Dynamic Logic (D.Gabbay, F.Guenthner (eds.) Handbook of philosophical logic, Vol. II, pp 497–604, 1984)

    Google Scholar 

  3. F.Kröger Temporal logics of programs (EATCS Monographs on TCS, Vol. 8, Springer, 1987)

    Google Scholar 

  4. A. Mazurkiewicz, E. Ochmanski, W. Penczek Concurrent systems and inevitability (TCS 64, pp 281–304, 1989)

    Google Scholar 

  5. Z. Manna, A. Pnueli Completing the temporal picture (ICALP, LNCS 372, pp 534–558, Springer, 1989)

    Google Scholar 

  6. M. Mukund, P.S. Thiagarajan An axiomatization of event structures (LNCS 405, pp 143–160, Springer, 1989)

    Google Scholar 

  7. M. Nielsen, G. Rozenberg, P.S. Thiagarajan Behavioural notions for elementary net systems (Distributed Computing 4, pp 45–57, 1990)

    Google Scholar 

  8. R.Parikh Decidability and Undecidability in distributed transition systems (”A perspective in theoretical computer science”, Vol.16, 1988)

    Google Scholar 

  9. B. Paech Gentzen-Systems for propositional temporal logics (CSL, LNCS 385, pp 240–253, Springer, 1988)

    Google Scholar 

  10. B.Paech concurrency as a modality (LMU München, Ph.D.thesis, 1990)

    Google Scholar 

  11. D. Peleg Communication in Concurrent Dynamic Logic (JCSS 35, pp 23–58, 1987)

    Google Scholar 

  12. W. Penczek A temporal logic for event structures (Fundamenta Informaticae XI, pp 297–326, 1988)

    Google Scholar 

  13. W. Penczek A concurrent branching time temporal logic (CSL, LNCS 440, pp 337–354, 1989)

    Google Scholar 

  14. D. Peled, A. Pnueli Proving partial order liveness properties (ICALP, LNCS 443, pp 553–571, 1990)

    Google Scholar 

  15. W.Reisig Petri Nets — An introduction (EATCS Monographs on TCS, Vol. 4, Springer, 1985)

    Google Scholar 

  16. R.Rosner, A.Pnueli A Choppy Logic (Logic in Computer Science, pp 306–314, 1986)

    Google Scholar 

  17. D.Taubner The finite representation of abstract programs (LNCS 369, Springer, 1989)

    Google Scholar 

  18. P.S. Thiagarajan Elementary net systems (Advances in PN, LNCS 254, pp 26–59, Springer, 1987)

    Google Scholar 

  19. J. Winkowski Behaviour of concurrent systems (TCS 12, pp39–60, 1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Ludwig-Maximilians-Universität, Theresienstr.39, D-8000, München 2

    Barbara Paech

Authors
  1. Barbara Paech
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paech, B. (1991). Extending temporal logic by explicit concurrency. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_81

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54345-9

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation