Skip to main content
SpringerLink
Log in

Tableau-based automata construction for dynamic linear time temporal logic*

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

We present a tableau-based algorithm for obtaining a Büchi automaton from a formula in Dynamic Linear Time Temporal Logic (DLTL), a logic which extends LTL by indexing the until operator with regular programs. The construction of the states of the automaton is similar to the standard construction for LTL, but a different technique must be used to verify the fulfillment of until formulas. The resulting automaton is a Büchi automaton rather than a generalized one. The construction can be done on-the-fly, while checking for the emptiness of the automaton. We also extend the construction to the Product Version of DLTL.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Bacchus and F. Kabanza, Planning for temporally extended goals, Annals of Mathematics and Artificial Intelligence 22 (1998) 5–27.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Calvanese, G. De Giacomo and M.Y. Vardi, Reasoning about actions and planning in LTL action theories, in: Proc. Principles of Knowledge Representation and Reasoning, KR'02, (Morgan Kaufmann, 2002) pp. 593–602.

  3. M. Daniele, F. Giunchiglia and M.Y. Vardi, Improved automata generation for linear temporal logic, in: Proc. Computer Aided Verification, 11th International Conference, CAV'99, Lecture Notes in Computer Science, Vol. 1633 (Springer, 1999) pp. 249–260.

  4. R. Gerth, D. Peled, M.Y. Vardi and P. Wolper, Simple on-the-fly automatic verification of linear temporal logic, in: Proc. 15th International Symposium on Protocol Specification, Testing and Verification XV, PSTV 1995 (IFIP Conference Proceedings 38 Chapman & Hall, 1996) pp. 3–18.

  5. L. Giordano, A. Martelli and C. Schwind, Reasoning about actions in dynamic linear time temporal logic, Logic Journal of the IGPL 9(2) (2001) 289–303.

    Article  MathSciNet  Google Scholar 

  6. L. Giordano, A. Martelli and C. Schwind, Specifying and verifying systems of communicating agents in a temporal action logic, in: Proc. AI*IA 2003: Advances in Artificial Intelligence, 8th Congress of the Italian Association for Artificial Intelligence, Lecture Notes in Computer Science, Vol. 2829 (Springer, 2003) pp. 262–274.

  7. L. Giordano, A. Martelli and C. Schwind, Verifying communicating agents by model checking in a temporal action logic, in: Proc. Logics in Artificial Intelligence, 9th European Conference, JELIA 2004, Lecture Notes in Computer Science, Vol. 3229 (Springer, 2004) pp. 57–69.

  8. F. Giunchiglia and P. Traverso, Planning as model checking, in: Proc. The 5th European Conference on Planning, ECP'99, Lecture Notes in Computer Science, Vol. 1809 (Springer, 2000) pp. 1–20.

  9. J.G. Henriksen and P.S. Thiagarajan, A product version of dynamic linear time temporal logic, in: Proc. CONCUR '97: Concurrency Theory, 8th International Conference, Lecture Notes in Computer Science, Vol. 1243 (Springer, 1997) pp. 45–58.

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

    Article  MATH  MathSciNet  Google Scholar 

  11. G.J. Holzmann, The model checker SPIN, IEEE Transaction on Software Engineering 23(5) (1997) 279–295.

    Article  MathSciNet  Google Scholar 

  12. J. Hromkovic, S. Seibert and T. Wilke, Translating regular expressions into small ɛ-free nondeterministic finite automata, in: Proc. STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1200 (Springer, 1997) pp. 55–66.

  13. W. Penczek and A. Lomuscio, Verifying epistemic properties of multi-agent systems via bounded model checking, Fundamenta Informaticae 55(2) (2003) 167–185.

    MATH  MathSciNet  Google Scholar 

  14. M. Pistore and P. Traverso, Planning as model checking for extended goals in non-deterministic domains, in: Proc. of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001 (Morgan Kaufmann, 2001) pp.479–484.

  15. R. Reiter, The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, ed. V. Lifschitz (Academic, 1991) pp. 359–380.

  16. M.P. Singh, Agent communication languages: Rethinking the principles, IEEE Computer 31(12) (1998) 40–47.

    Google Scholar 

  17. A.P. Sistla and E.M. Clarke, The complexity of propositional linear temporal logic, Journal of the ACM 32 (1985) 733–749.

    Article  MATH  MathSciNet  Google Scholar 

  18. R.G. Smith, The contract net protocol: High level communication and control in a distributed problem solver, IEEE Transactions on Computers C-29(12) (1980) 1104–1113.

    Article  Google Scholar 

  19. F. Somenzi and R. Bloem, Efficient Büchi automata from LTL formulae, in: Proc. Computer Aided Verification, 12th International Conference, CAV 2000, Lecture Notes in Computer Science, Vol. 1855 (Springer, 2000) pp. 247–263.

  20. W. van der Hoek and M.J.W. Wooldridge, Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications, Studia Logica 75(1) (2003) 125–157.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. M. Wooldridge, M. Fisher, M.P. Huget and S. Parsons, Model checking multi-agent systems with MABLE, in: Proc. First International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2002 (ACM, 2002) pp. 952–959.

  23. P. Wolper, Temporal logic can be more expressive, Information and Control 56 (1983) 72–99.

    Article  MATH  MathSciNet  Google Scholar 

  24. P. Wolper, Constructing automata from temporal logic formulas: A tutorial, in: Lectures on Formal Methods and Performance Analysis FMPA 2000, Lecture Notes in Computer Science, Vol. 2090 (Springer, 2001) pp. 261–277.

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università del Piemonte Orientale, Alessandria, Italy

    Laura Giordano

  2. Dipartimento di Informatica, Università di Torino, Corso Svizzera 185, Torino, Italy

    Alberto Martelli

Authors
  1. Laura Giordano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Martelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alberto Martelli.

Additional information

*This research has been partially supported by the project MIUR PRIN 2005 ‘Specification and verification of agent interaction protocols’.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Giordano, L., Martelli, A. Tableau-based automata construction for dynamic linear time temporal logic*. Ann Math Artif Intell 46, 289–315 (2006). https://doi.org/10.1007/s10472-006-9020-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-006-9020-7

Keywords

AMS subject classification

Search

Navigation