Skip to main content
SpringerLink
Log in

Alternating Interval Based Temporal Logics

  • Conference paper
Book cover Formal Methods and Software Engineering (ICFEM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6447))

Included in the following conference series:

Abstract

To specify properties of open systems with interval based temporal logics, alternating interval based temporal logics are proposed by introducing Concurrent Game Structures (CGS) to Propositional Projection Temporal Logic (PPTL) and Propositional Interval Temporal Logic (PITL). Further, examples are given to show how properties of open systems can be specified by APTL and AITL formulas. Moreover, to establish the automata based model theory for the new proposed logics, Generalized alternating Büchi automata over Concurrent Game structures (GBCGs) are defined. And a transformation from APTL formulas to GBCGs is presented. In addition, a decision procedure for checking the satisfiability of APTL formulas, and a model checking approach for APTL with Concurrent Game Structures (CGSs) models are presented.

This research is supported by the NSFC Grant No. 61003078, 60433010, 60873018 and 60910004, National Program on Key Basic Research Project of China (973 Program) Grant No.2010CB328102 and SRFDP Grant 200807010012.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Hzenzinger, T.A., Kupferman, O.: Alternating-Time Temporal Logic. Journal of the ACM 49, 672–713 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Wilke, T.: Alternating Tree Automata, Parity Games, and μ-calculus. Bull. Soc. Math. Belg. 8(2) (May 2001)

    Google Scholar 

  3. Moszkowski, B.: Reasoning about digital circuits, Ph.D Thesis, Department of Computer Science, Stanford University, TRSTAN-CS-83-970 (1983)

    Google Scholar 

  4. Duan, Z., Tian, C., Zhang, L.: A Decision Procedure for Propositional Projection Temporal Logic with Infinite Models. Acta Informatica 45(1), 43–78 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Pnueli, A.: The temporal logic of programs. In: Proc. 18th IEEE Symp. Found. of Comp. Sci., pp. 46–57 (1977)

    Google Scholar 

  6. Clark, M., Gremberg, O., Peled, A.: Model Checking. The MIT Press, Cambridge (2000)

    Google Scholar 

  7. Vardi, M.Y.: Verification of Open Systems. In: Ramesh, S., Sivakumar, G. (eds.) FST TCS 1997. LNCS, vol. 1346, pp. 250–266. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  8. de Alfaro, L.: Game Models for Open Systems. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 269–289. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Ben-Ari, M., Manna, Z., Pnueli, A.: The temporal logic of branching time. Acta Informatica 20, 207–226 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  10. Clarke, E.M., Emerson, E.A.: Desigh and syntesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) LP 1981. LNCS, vol. 131. Springer, Heidelberg (1981)

    Google Scholar 

  11. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27, 333–354 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  12. Emerson, E.A.: Temporal and Modal Logic. Computer Science Department, University of Texas at Austin, USA (1995)

    Google Scholar 

  13. Moszkowski, B.: Reasoning about digital circuits. Ph.D Thesis, Department of Computer Science, Stanford University. TRSTAN-CS-83-970 (1983)

    Google Scholar 

  14. Duan, Z.: An Extended Interval Temporal Logic and A Framing Technique for Temporal Logic Programming. PhD thesis, University of Newcastle Upon Tyne (May 1996)

    Google Scholar 

  15. Duan, Z., Tian, C.: A Unified Model checking Approach with Projection Temporal Logic. In: Liu, S., Maibaum, T., Araki, K. (eds.) ICFEM 2008. LNCS, vol. 5256, pp. 167–186. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Tian, C., Duan, Z.: Model Checking Propositional Projection Temporal Logic Based on SPIN. In: Butler, M., Hinchey, M.G., Larrondo-Petrie, M.M. (eds.) ICFEM 2007. LNCS, vol. 4789, pp. 246–265. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Tian, C., Duan£, Z.: Propositional projection temporal logic, buchi automata and omega-regular expressions. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 47–58. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Schewe, S., Finkbeiner, B.: Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 591–605. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Schewe, S.: ATL* Satisfiability Is 2EXPTIME-Complete. ICALP (2), 373–385 (2008)

    Google Scholar 

  20. Vardi, M.Y.: Alternating Automata and Program Verification. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 471–485. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  21. Katoen, J.-P.: Concepts, Algorithms, and Tools for Model Checking. Lecture Notes of the Course Mechanised Validation of Parallel Systems (1999)

    Google Scholar 

  22. Brzozowski, J.A., Leiss, E.: Finite automata, and sequential networks. Theoretical Computer Science 10, 19–35 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  23. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the Association for Computing Machinery 28(1), 114–133 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  24. Vardi, M.Y.: Nontraditional applications of automata theory. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 575–597. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Theory and Technology and ISN Laboratory, Xidian University, Xi’an, 710071, P.R. China

    Cong Tian & Zhenhua Duan

Authors
  1. Cong Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenhua Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, Computer Science Dept, National University of Singapore, 13 Computing Drive, 117417, Singapore, Singapore

    Jin Song Dong

  2. Software Engineering Institute, East China Normal University, 3663 Zhongshan Road (North), 200062, Shanghai, China

    Huibiao Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tian, C., Duan, Z. (2010). Alternating Interval Based Temporal Logics. In: Dong, J.S., Zhu, H. (eds) Formal Methods and Software Engineering. ICFEM 2010. Lecture Notes in Computer Science, vol 6447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16901-4_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16901-4_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16900-7

  • Online ISBN: 978-3-642-16901-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation