Skip to main content
Springer Nature Link
Log in

Complete and Tractable Local Linear Time Temporal Logics over Traces

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2002)

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

Included in the following conference series:

  • 2320 Accesses

Abstract

We present the first expressively complete and yet tractable temporal logics, Past-TrLTL and TrLTL, to reason about distributed behaviours, modelled as Mazurkiewicz traces. Both logics admit singly exponential automata-theoretic decision procedures. General formulas of Past-TrLTL are boolean combinations of local formulas which assert rich properties of local histories of the behaviours. Past-TrLTL has the same expressive power as the first order theory of finite traces. TrLTL provides formulas to reason about recurring local Past-TrLTL properties and equals the complete first order theory in expressivity. The expressive completeness criteria are based on new local normal forms for the first order logic. We illustrate the use of our logics for specification of global properties.

The work of this author was supported by an Infosys Fellowship.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

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. B. Adsul AND M. Sohoni: First-Order Logic over Traces, Technical Report, Dept. of Computer Science & Engineering, I. I. T. Mumbai, India (2002). Also see http://www.cse.iitb.ac.in/~abharat/logics.html

    Google Scholar 

  2. V. Diekert AND P. Gastin: LTL is Expressively Complete for Mazurkiewicz Traces, Proc. ICALP’ 00, LNCS 1853 (2000) 211–222.

    Google Scholar 

  3. V. Diekert AND P. Gastin: Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets, Proc. LPAR’ 01, LNAI 2250 (2000) 55–69.

    Google Scholar 

  4. V. Diekert AND A. Muscholl: Deterministic Asynchronous Automata for Infinite Traces, Acta Inf., 31 (1993) 379–397.

    Article  MathSciNet  Google Scholar 

  5. V. Diekert AND G. Rozenberg (Eds.): The Book of Traces, World Scientific, Singapore (1995).

    Google Scholar 

  6. W. Ebinger AND A. Muscholl: Logical Definability on Infinite Traces, Proc. ICALP’ 93, LNCS 700 (1993) 335–346.

    Google Scholar 

  7. O. Maler AND A. Pnueli: Tight bounds on the Complexity of Cascaded Decomposition of Automata, Proc. 31st IEEE FOCS’ 90 (1990) 672–682.

    Google Scholar 

  8. Z. Manna AND A. Pnueli: The Temporal Logic of Reactive and Concurrent Systems (Specification), Springer-Verlag, Berlin (1991).

    MATH  Google Scholar 

  9. R. McNaughton AND S. Papert: Counter-free Automata, MIT Press, Cam-bridge (1971).

    MATH  Google Scholar 

  10. M. Mukund AND M. Sohoni: Keeping Track of the Latest Gossip in a Distributed System, Distributed Computing, 10(3) (1997) 137–148.

    Article  Google Scholar 

  11. M. Mukund AND P.S. Thiagarajan: Linear Time Temporal Logics over Mazurkiewicz Traces, Proc. MFCS’96, LNCS 1113 (1996) 62–92.

    Google Scholar 

  12. P.S. Thiagarajan: A Trace Based Extension of Linear Time Temporal Logic, Proc. 9th IEEE LICS (1994) 438–447.

    Google Scholar 

  13. W. Thomas: Languages, Automata and Logic, in: Handbook of Formal Languages Vol. 3 — Beyond Words, Springer-Verlag, New York (1997) 389–456.

    Google Scholar 

  14. P.S. Thiagarajan AND I. Walukiewicz: An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces, Proc. 12th IEEE LICS (1997) 183–194.

    Google Scholar 

  15. I. Walukiewicz: Difficult Configurations-On the Complexity of LTrL, Proc. ICALP’ 98, LNCS 1443 (1998) 140–151.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Mumbai, 400 076, India

    Bharat Adsul & Milind Sohoni

Authors
  1. Bharat Adsul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Milind Sohoni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zentrum, ETH Zürich, 8092, Zürich, Switzerland

    Peter Widmayer  & Stephan Eidenbenz  & 

  2. Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Francisco Triguero , Rafael Morales  & Ricardo Conejo ,  & 

  3. School of Cognitive and Computing Sciences, University of Sussex, Falmer, Brighton, BN1 9QN, UK

    Matthew Hennessy

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adsul, B., Sohoni, M. (2002). Complete and Tractable Local Linear Time Temporal Logics over Traces. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_79

Download citation

  • DOI: https://doi.org/10.1007/3-540-45465-9_79

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45465-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics