Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Theoretical Aspects of Computing

ICTAC 2012: Theoretical Aspects of Computing – ICTAC 2012 pp 30–45Cite as

How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata

  • Conference paper

  • 387 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7521))

Abstract

This paper presents results that enable efficient translations of extensions of linear temporal logic (LTL) into alternating automata, which can be applied to improve algorithms for the automata-theoretic approach to model-checking. In particular, we introduce—using a game theoretic framework—a novel finer grain complementation theorem for the parity condition. This result allows simple and efficient translations of extended temporal operators into pairs of automata accepting complementary languages, using only up to 3 colors. Our results: (1) allow to translate directly operators from LTL and different extensions (2)that can be combined without restriction; and (3) does not require to eliminate negation upfront, or to start from formulas in negation normal form.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   72.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armando, A., Ranise, S., Rusinowitch, M.: A rewriting approach to satisfiability procedures. Information and Computation 183(2), 140–164 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Beer, I., Ben-David, S., Eisner, C., Fisman, D., Gringauze, A., Rodeh, Y.: The Temporal Logic Sugar. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 363–367. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Dax, C., Klaedtke, F.: Alternation Elimination by Complementation (Extended Abstract). In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 214–229. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: FOCS 1991, pp. 368–377. IEEE Computer Society (1991)

    Google Scholar 

  5. Fisman, D., Eisner, C., Havlicek, J.: Formal syntax and Semantics of PSL: App. B of Accellera Property Language Ref. Manual, v1.1 (March 2004)

    Google Scholar 

  6. Gastin, P., Oddoux, D.: Fast LTL to Büchi Automata Translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Henriksen, J.G., Thiagarajan, P.S.: Dynamic linear time temporal logic. Annals of Pure and Applied Logic 96(1-3), 187–207 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kupferman, O., Piterman, N., Vardi, M.Y.: Extended Temporal Logic Revisited. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 519–535. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Transactions on Computational Logic 2(3), 408–429 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Leucker, M., Sánchez, C.: Regular Linear Temporal Logic. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 291–305. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems. Springer (1995)

    Google Scholar 

  12. Muller, D.E., Schupp, P.E.: Altenating automata on infinite trees. TCS 54, 267–276 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pnueli, A.: The temporal logic of programs. In: FOCS 1977, pp. 46–67 (1977)

    Google Scholar 

  14. Sánchez, C., Leucker, M.: Regular Linear Temporal Logic with Past. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 295–311. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Thomas, W.: Complementation of Büchi automata revisited. In: Jewels are Forever, pp. 109–120. Springer (1999)

    Google Scholar 

  16. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: LICS 1986, pp. 332–344. IEEE CS Press (1986)

    Google Scholar 

  17. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation 115, 1–37 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMDEA Software Institute, Madrid, Spain

    César Sánchez & Julian Samborski-Forlese

  2. Institute for Applied Physics, CSIC, Madrid, Spain

    César Sánchez

Authors
  1. César Sánchez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julian Samborski-Forlese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National University of Singapore, Computing Drive 13, 117417, Singapore, Singapore

    Abhik Roychoudhury

  2. International Institute of Information Technology, Eletronics City 26-C, 560100, Bangalore, India

    Meenakshi D’Souza

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sánchez, C., Samborski-Forlese, J. (2012). How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata. In: Roychoudhury, A., D’Souza, M. (eds) Theoretical Aspects of Computing – ICTAC 2012. ICTAC 2012. Lecture Notes in Computer Science, vol 7521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32943-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32943-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32942-5

  • Online ISBN: 978-3-642-32943-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation