Skip to main content
SpringerLink
Log in

Transformation from PLTL to automata via NFGs

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

A new linear transformation from PLTL formulas to alternating automata is proposed in this paper. To this end, C-F normal forms and normal form graphs (NFGs) are defined for PLTL formulas. Further, based on NFGs, generalized alternating Büchi automata (GABA) of PLTL formulas are built. Beside the conciseness in theoretical aspect, the new transformation is useful in improving the scalability of LTL model checking tools in practise. Also, based on the new transformation, an intuitive on-the-fly model checking approach can be implemented.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Brzozowski JA, Leiss E (1980) Finite automata, and sequential networks. Theor Comput Sci 10:19–35

    Article  MATH  MathSciNet  Google Scholar 

  • Chandra AK, Kozen DC, Stockmeyer LJ (1981) Alternation. J Assoc Comput Mach 28(1):114–133

    Article  MATH  MathSciNet  Google Scholar 

  • Clarke EM, Grumberg O, Hamaguchi K (1994) Another look at LTL model checking. CAV94, Springer, pp 415–427

  • Daniele N, Guinchiglia F, Vardi MY (1999) Improved automata generation for linear temporal logic. CAV99, LNCS 1633, Springer, pp 249–260

  • Duan Z (1996) An extended interval temporal logic and a framing technique for temporal logic programming. Ph.D thesis, University of Newcastle Upon Tyne

  • Duan Z, Tian C, Zhang L (2008) A decision procedure for propositional projection temporal logic with infinite models. Acta Inform 45(1):43–78

    Article  MATH  MathSciNet  Google Scholar 

  • Emerson AE (1990) Temporal and modal logic, In: Jan van Leeuwen (ed) Handbook of theoretical computer science, volume B: Formal methods and semantics, pp 995–1072

  • Etessami K, Holzmann GJ (2000) Optimizing Büchi automata. In: Proceedings of 11th international conference on concurrency theory, LNCS 1877, Springer, pp 153–167

  • Fritz C (2003) Constructing Büchi automata from linear temporal logic using simulation relations for alternating bchi automata. ICIAA03, LNCS 2759, Springer, pp 35–48

  • Fritz C (2005) Concepts of automata construction from LTL. In: Proceedings of ICLPAIR 2005, LNCS 3835, Springer, pp 728–742

  • Gerth R, Peled D, Vardi MY, Wolper P (1995) Simple on-the-fly automatic verification of linear temporal logic. In: Dembiski P, Sredniawa M (eds) Protocol specification, testing, and verification. Chapman & Hall, Vancouver, pp 3–18

  • Katoen JP (1999) Concepts, algorithms, and tools for model checking. Lecture notes of the course mechanised validation of parallel systems

  • Pnueli A (1977) The temporal logic of programs. In: Proceedings of 18th symposium on foundations of computer science, pp 46–57

  • Sistla AP, Clarke EM (1985) The complexity of propositional linear temporal logics. J ACM 32(3):733–749

    Article  MATH  MathSciNet  Google Scholar 

  • Somenzi F, Bloem R (2000) Efficient Büchi automata from LTL formulae. CAV00, Lecture notes in computer science, vol 1855. Springer, pp 248–263

  • Thirioux X (2002) Simple and efficient translation from LTL formulas to Büchi automata. Electr Notes Theor Comput Sci 66(2):145–159

    Google Scholar 

  • Vardi MY, Wolper P (1994) Reasoning about infinite computations. Inf Comput 115(1):1–37

    Article  MATH  MathSciNet  Google Scholar 

  • Vardi MY (1994) Nontraditional applications of automata theory. In: International symposium on theoretical aspects of computer software, LNCS 789, Springer, pp 575–597

  • Vardi MY (1995) Alternating automata and program verification. In: Computer science today. LNCS 1000, Springer, pp 471–485

  • Vardi MY (2007) Automata-theoretic model checking revisited. VMCAI 07. LNCS 4349. Springer, New York, pp 137–150

  • Wolper P, Vardi MY, Sistla AP (1983) Reasoning about infinite computation paths. In: Proceedings of 24th IEEE symposium on foundations of computer science, Tucson, pp 185–194

Download references

Acknowledgments

This research is supported by the NSFC Grant No. 61003078, 61133001, 61272117, 61272118, 61202038 and 60910004, 973 Program Grant No. 2010CB328102 and ISN Lab Grant No. ISN1102001.

Author information

Authors and Affiliations

  1. ICTT and ISN Lab, Xidian University, Xi’an, 710071, People’s Republic of China

    Cong Tian & Zhenhua Duan

  2. China Academy of Space Technology, Beijing, 100094, People’s Republic of China

    Mengfei Yang

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

  3. Mengfei Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhenhua Duan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tian, C., Duan, Z. & Yang, M. Transformation from PLTL to automata via NFGs. J Comb Optim 29, 406–417 (2015). https://doi.org/10.1007/s10878-013-9601-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-013-9601-4

Keywords

Search

Navigation