Skip to main content

Distributed versions of linear time temporal logic: A trace perspective

  • III Relationship to Other Models
  • Chapter
  • First Online:
Lectures on Petri Nets I: Basic Models (ACPN 1996)

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

Included in the following conference series:

  • 3886 Accesses

Abstract

In this paper we have attempted an overview of linear time temporal logics interpreted over traces. We have mainly concentrated on the satisfiability and model checking problems as well as expressiveness issues. The problem of axiomatizing these logics seems to be a non-trivial task. Some partial results may be found in [39]. In [34] the authors present proof rules for the logic ISTL with a trace semantics together with a relative expressive completeness result. Reisig has also developed a kit of proof rules for a version of UNITY logic [40, 41]. The models of this logic are the non-sequential processes of a net system and the proof rules are mainly designed to help reason about distributed algorithms modelled using net systems.

At present not much is known about corresponding logics in a branching time setting. Most of the attemtps in this direction have lead to logics whose satisfiability problems are undedicable [5,25,36]. It is however the case that the model checking problem often remains tractable [5,36]. We do not know at present whether the properties expressible in such logics have any type of “all-or-none” flavour and if so whether one can develop some reduction techniques for verifying such properties. Some preliminar attempts in this direction have been made in [16,54].

This work has been supported by BRIGS and IFCPAR Project 1502-1.

Basic Research in Computer Science, Centre of the Danish National Research Foundation.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alur, R., Peled, D., Penczek, W.: Model checking of causality properties. Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (1995) 90–100

    Google Scholar 

  2. Bell Labs Design Automation: FormalChecktm. Further information can be obtained at http://www.bell-labs.com/formalcheck/

    Google Scholar 

  3. Bracho, F., Droste, M., Kuske, D.: Representation of computations in concurrent automata by dependence orders. Theoretical Computer Science 174(1-2) (1997) 67–96

    Google Scholar 

  4. Büchi, J. R.: On a decision method in restricted second order arithmetic. Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, Stanford University Press (1960) 1–11

    Google Scholar 

  5. Cheng, A.: Petri nets, traces, and local model checking. Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology, Lecture Notes in Computer Science 936, Springer-Verlag (1995) 322–337

    Google Scholar 

  6. Diekert, V.: Combinatorics of traces. Lecture Notes in Computer Science 454, Springer-Verlag (1990)

    Google Scholar 

  7. Diekert, V., Rozenberg, G. (eds.): The book of traces. World Scientific (1995)

    Google Scholar 

  8. Droste, M.: Recognizable languages in concurrency monoids. Theoretical Computer Science 150(1) (1995) 77–109

    Google Scholar 

  9. Droste, M., Gastin, P.: Asynchronous cellular automata for pomsets without auto-concurrency. Proceedings of the 7th International Conference on Concurrency Theory, Lecture Notes in Computer Science 1119, Springer-Verlag (1996) 627–638

    Google Scholar 

  10. Ebinger, W.: Charakterisierung von sprachklassen unendlicher spuren durch logiken. Dissertation, Institut für Informatik, Universität Stuttgart (1994)

    Google Scholar 

  11. Ebinger, W., Muscholl, A.: Logical definability on infinite traces. Theoretical Computer Science 154(1) (1996) 67–84

    Google Scholar 

  12. Emerson, A. E.: Temporal and modal logic. In Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, Elsevier Science Publishers (1990) 996–1072

    Google Scholar 

  13. Fischer, M. J., Ladner, R. E.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18(2) (1979) 194–211

    Google Scholar 

  14. Gabbay, A., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. Proceedings of the 7th Annual Symposium on Principles of Programming Languages, ACM (1980) 163–173

    Google Scholar 

  15. Gastin, P., Petit, A.: Asynchronous cellular automata for infinite traces. Proceedings of the 19th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science 623, Springer-Verlag (1992) 583–594

    Google Scholar 

  16. Gerth, R., Kuiper, R., Peled, D., Penczek, W.: A partial-order approach to branching time model checking. Proceedings of the 3rd Israeli Symposium on Theory of Computing and Systems, IEEE Computer Society Press (1995) 130–139

    Google Scholar 

  17. Godefroid, P.: Partial-order methods for the verification of concurrent systems. Lecture Notes in Computer Science 1032, Springer-Verlag (1996)

    Google Scholar 

  18. Gerth, R., Peled, D., Vardi, M., Wolper, P.: Simple on-the-fly automatic verification of linear time temporal logic. Proceedings of the 15th IFIP WG 6.1 International Workshop on Protocol Specification, Testing, and Verification, North-Holland (1995)

    Google Scholar 

  19. Henriksen, J. G., Thiagarajan, P. S.: Dynamic linear time temporal logic. Journal of Pure and Applied Logic, Elsevier (to appear)

    Google Scholar 

  20. Henriksen, J. G., Thiagarajan, P. S.: A product version of dynamic linear time temporal logic. Proceedings of the 8th International Conference on Concurrency Theory, Lecture Notes in Computer Science 1243, Springer-Verlag (1997) 45–58

    Google Scholar 

  21. Holzmann, G. J.: An overview of the SPIN model checker. In “On-the-fly Model Checking Tutorial”, BRIGS Autumn School on Verification, Note NS-96-6, BRICS, Department of Computer Science, University of Aarhus (1996)

    Google Scholar 

  22. Huhn, M.: On semantic and logical refinement of actions. Technical Report, Institut für Informatik, Universität Hildesheim, Germany (1996)

    Google Scholar 

  23. Kamp, H. R.: Tense logic and the theory of linear order. Ph.D. thesis, University of California (1968)

    Google Scholar 

  24. Katz, S., Peled, D.: Interleaving set temporal logic. Theoretical Computer Science 73(3) (1992) 21–43

    Google Scholar 

  25. Lodaya, K., Parikh, R., Ramanujam, R., Thiagarajan, P. S.: A logical study of distributed transition systems. Information and Computation 119(1) (1995) 91–118

    Google Scholar 

  26. Manna, Z., Pnueli, A.: The temporal logic of reactive and concurrent systems (specification), Springer-Verlag (1991)

    Google Scholar 

  27. Mazurkiewicz, A.: Concurrent program schemes and their interpretations. Technical report DAIMI PB-78, Department of Computer Science, University of Aarhus, Denmark (1977)

    Google Scholar 

  28. Meyer, R., Petit, A.: Expressive completeness of LTrL on finite traces: an algebraic proof. Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science 1373, Lecture Notes in Computer Science, Springer-Verlag (1998) 533–543

    Google Scholar 

  29. Mukund, M., Sohoni, M.: Keeping track of the latest gossip in a distributed system. Distributed Computing 10(3) (1997) 117–127

    Google Scholar 

  30. Mukund, M., Thiagarajan, P. S.: Linear time temporal logics over Mazurkiewicz traces. Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1113, Springer-Verlag (1996) 62–92

    Google Scholar 

  31. Niebert, P.: A ν-calculus with local views for systems of sequential agents. Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 969, Springer-Verlag (1995) 563–573

    Google Scholar 

  32. Niebert, P.: A temporal logic for the specification and validation of distributed behaviour. Ph.D. thesis, University of Hildesheim (1997)

    Google Scholar 

  33. Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, part I. Theoretical Computer Science 13(1) (1981) 85–108

    Google Scholar 

  34. Peled, D., Pnueli, A.: Proving partial order properties. Theoretical Computer Science 126(2) (1994) 143–182

    Google Scholar 

  35. Peled, D.: Partial order reduction: model checking using representatives. Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1113, Springer-Verlag (1996) 93–112

    Google Scholar 

  36. Penczek, W.: Temporal logics for trace systems: on automated verification. International Journal of the Foundations of Computer Science 4(1) (1993) 31–68

    Google Scholar 

  37. Pnueli, A.: The temporal logic of programs. Proceedings of the 18th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press (1977) 46–57

    Google Scholar 

  38. Ramanujam, R.: Locally linear time temporal logic. Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (1996) 118–127

    Google Scholar 

  39. Ramanujam, R.: Rules for trace consistent reasoning. Proceedings of the 3rd Asian Computing Science Conference, Lecture Notes in Computer Science 1345, Springer-Verlag (1997) 57–71

    Google Scholar 

  40. Reisig, W.: Temporal logic and causality in concurrent systems. Proceedings of CONCURRENCY'88, Lecture Notes in Computer Science 335, Springer-Verlag (1988) 121–139

    Google Scholar 

  41. Reisig, W.: Petri net models for distributed algorithms. In Computer Science Today — Recent Trends and Developments, Lecture Notes in Computer Science 1000, Springer-Verlag (1995) 441–454

    Google Scholar 

  42. Sistla, A. P., Clarke, E.: The complexity of propositional linear temporal logics. Journal of the ACM 32(3) (1985) 733–749

    Google Scholar 

  43. Stockmeyer, L. J.: The complexity of decision problems in automata theory and logic. Ph.D. thesis, MIT, Cambridge, Massachusetts (1974)

    Google Scholar 

  44. Thiagarajan, P. S.: A trace based extension of linear time temporal logic. Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (1994) 438–447

    Google Scholar 

  45. Thiagarajan, P. S.: TrPTL: a trace based extension of linear time temporal logic. Technical report TCS-93-6, School of Mathematics, SPIC Science Foundation, Madras (1993)

    Google Scholar 

  46. Thiagarajan, P. S.: A trace consistent subset of PTL. Proceedings of the 6th International Conference on Concurrency Theory, Lecture Notes in Computer Science 962, Springer-Verlag (1995) 438–452

    Google Scholar 

  47. Thiagarajan, P. S.: PTL over product state spaces. Technical report TCS-95-4, School of Mathematics, SPIC Science Foundation, Madras (1995)

    Google Scholar 

  48. Thiagarajan, P. S., Walukiewicz, I.: An expressively complete linear time temporal logic for Mazurkiewicz traces. Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (1997) 183–194

    Google Scholar 

  49. homas, W.: Automata on infinite objects. In Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, Elsevier Science Publishers (1990) 133–191

    Google Scholar 

  50. Valmari, A.: A stubborn attack on state explosion. Formal Methods in Systems Design 1 (1992) 285–3131

    Google Scholar 

  51. Vardi, M. Y., Wolper, P.: An automata-theoretic approach to automatic program verification. Proceedings of the 1st Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (1986) 332–345

    Google Scholar 

  52. Vardi, M. Y.: An automata-theoretic approach to linear time temporal logic. In Logics for Concurrency — Structure vs. Automata, Lecture Notes in Computer Science 1043, Springer-Verlag (1996) 238–266

    Google Scholar 

  53. Walukiewicz, I.: Difficult configurations — on the complexity of LTrL (extended abstract). Proceedings of the 25th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, Springer-Verlag (to appear)

    Google Scholar 

  54. Willems, B., Wolper, P.: Partial-order methods for model checking: from linear time to branching time. Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (1996) 294–303

    Google Scholar 

  55. Winskel, G., Nielsen, M.: Models for concurrency. In Handbook of Logic and the Foundations of Computer Science, volume 4, Oxford University Press (1995) 1–148

    Google Scholar 

  56. Wolper, P.: Temporal logic can be more expressive. Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press (1981) 340–348

    Google Scholar 

  57. Wolper, P., Vardi, M. Y., Sistla, A. P.: Reasoning about infinite computation paths. Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press (1983) 185–194.

    Google Scholar 

  58. Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. Informatique Théorique et Applications 21 (1987) 99–135

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wolfgang Reisig Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Thiagarajan, P.S., Henriksen, J.G. (1998). Distributed versions of linear time temporal logic: A trace perspective. In: Reisig, W., Rozenberg, G. (eds) Lectures on Petri Nets I: Basic Models. ACPN 1996. Lecture Notes in Computer Science, vol 1491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-65306-6_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-65306-6_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65306-6

  • Online ISBN: 978-3-540-49442-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics