Skip to main content
SpringerLink
Log in

Inherent Vacuity in Lattice Automata

  • Chapter
  • First Online:
Fields of Logic and Computation II

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

Abstract

Vacuity checking is traditionally performed after model checking has terminated successfully. It ensures that all the elements of the specification have played a role in its satisfaction by the system. The need to check the quality of specifications is even more acute in property-based design, where the specification is the only input, serving as a basis to the development of the system. Inherent vacuity adapts the theory of vacuity in model checking to the setting of property-based design. Essentially, a specification is inherently vacuous if it can be mutated into a simpler equivalent specification, which is known, in the case of specifications in linear temporal logic, to coincide with the fact the specification is satisfied vacuously in all systems.

A recent development in formal methods is an extension of the Boolean setting to a multi-valued one. In particular, instead of Boolean automata, which either accept or reject their input, there is a growing interest in weighted automata, which map an input word to a value from a semiring over a large domain. A distributive finite lattice is a special case of a semiring, and lattice automata are used in several methods for reasoning about multi-valued objects. We study inherent vacuity in the setting of lattice automata, namely the ability to mutate the value of a transition in the automaton without changing its language. We define the concept of inherent vacuity in lattice automata, study the complexity of deciding different types of vacuity, and relate the setting to the one known for linear temporal logics.

The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007–2013) / ERC grant agreement no 278410, and from The Israel Science Foundation (grant no 1229/10).

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

References

  1. Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 15–27. Springer, Heidelberg (2013)

    Google Scholar 

  2. Almagor, S., Kupferman, O.: Latticed-LTL synthesis in the presence of noisy inputs. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol. 8412, pp. 226–241. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  3. Alur, R., Kanade, A., Weiss, G.: Ranking automata and games for prioritized requirements. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 240–253. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Armoni, R., Fix, L., Flaisher, A., Grumberg, O., Piterman, N., Tiemeyer, A., Vardi, M.Y.: Enhanced vacuity detection in linear temporal logic. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 368–380. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Beer, I., Ben-David, S., Eisner, C., Rodeh, Y.: Efficient detection of vacuity in ACTL formulas. Formal Methods Syst. Des. 18(2), 141–162 (2001)

    Article  MATH  Google Scholar 

  6. Birkhoff, G.: Rings of sets. Duke Math. J. 3(3), 443–454 (1937)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bloem, R., Cavada, R., Pill, I., Roveri, M., Tchaltsev, A.: RAT: a tool for the formal analysis of requirements. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 263–267. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Bruns, G., Godefroid, P.: Model checking partial state spaces with 3-valued temporal logics. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 274–287. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Bruns, G., Godefroid, P.: Temporal logic query checking. In: Proceedings of 16th IEEE Symposium on Logic in Computer Science, pp. 409–420. IEEE Computer Society (2001)

    Google Scholar 

  10. Bustan, D., Flaisher, A., Grumberg, O., Kupferman, O., Vardi, M.Y.: Regular vacuity. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 191–206. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Chan, W.: Temporal-logic queries. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 450–463. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Chechik, M., Devereux, B., Gurfinkel, A.: Model-checking infinite state-space systems with fine-grained abstractions using SPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 16–36. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Chockler, H., Strichman, O.: Easier and more informative vacuity checks. In: Proceedings of 5th International Conference on Formal Methods and Models for Co-Design, pp. 189–198 (2007)

    Google Scholar 

  14. Ciric, M., Ignjatovic, J., Damljanovic, N., Basic, M.: Bisimulations for fuzzy automata. Fuzzy Sets Syst. 186(1), 100–139 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  15. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  16. Easterbrook, S., Chechik, M.: A framework for multi-valued reasoning over inconsistent viewpoints. In: Proceedings 23rd Internatioanl Conference on Software Engineering, pp. 411–420. IEEE Computer Society Press (2001)

    Google Scholar 

  17. Fisman, D., Kupferman, O., Sheinvald-Faragy, S., Vardi, M.Y.: A framework for inherent vacuity. In: Chockler, H., Hu, A.J. (eds.) HVC 2008. LNCS, vol. 5394, pp. 7–22. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Gurfinkel, A., Chechik, M.: Extending extended vacuity. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 306–321. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Halamish, S., Kupferman, O.: Approximating deterministic lattice automata. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 27–41. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  20. Halamish, S., Kupferman, O.: Minimizing deterministic lattice automata. ACM Trans. Computat. Logic 16(1), 1–21 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  21. Henzinger, T.A.: From Boolean to quantitative notions of correctness. In: Proceedings of 37th ACM Symposium on Principles of Programming Languages, pp. 157–158 (2010)

    Google Scholar 

  22. Hoskote, Y., Kam, T., Ho, P.-H., Zhao, X.: Coverage estimation for symbolic model checking. In: Proceedings of 36th Design Automation Conference, pp. 300–305 (1999)

    Google Scholar 

  23. Hussain, A., Huth,M.: On model checking multiple hybrid views. Technical report TR-2004-6, University of Cyprus (2004)

    Google Scholar 

  24. Immerman, N.: Nondeterministic space is closed under complement. Inf. Comput. 17, 935–938 (1988)

    MathSciNet  MATH  Google Scholar 

  25. Jones, N.D.: Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci. 11, 68–75 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  26. Kupferman, O.: Sanity checks in formal verification. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 37–51. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  27. Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 199–213. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  28. Kupferman, O., Vardi, M.Y.: Vacuity detection in temporal model checking. Softw. Tools Technol. Transfer 4(2), 224–233 (2003)

    Article  MATH  Google Scholar 

  29. Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential time. In: Proceedings of 13th IEEE Symposium on Switching and Automata Theory, pp. 125–129 (1972)

    Google Scholar 

  30. Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269–311 (1997)

    MathSciNet  Google Scholar 

  31. Namjoshi, K.S.: An efficiently checkable, proof-based formulation of vacuity in model checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 57–69. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  32. PROSYD.: The Prosyd project on property-based system design (2007). http://www.prosyd.org

  33. Roveri, M.: Novel techniques for property assurance. Technical report, PROSYD FP6-IST-507219 (2007)

    Google Scholar 

  34. Rozier, K.Y., Vardi, M.Y.: LTL satisfiability checking. In: Bošnački, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 149–167. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  35. Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72–83. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  36. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1–37 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, The Hebrew University, Jerusalem, Israel

    Hila Gonen & Orna Kupferman

Authors
  1. Hila Gonen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Orna Kupferman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Orna Kupferman .

Editor information

Editors and Affiliations

  1. Steklov Mathematical Institute, Moscow, Russia

    Lev D. Beklemishev

  2. University of Michigan, Ann Arbor, Michigan, USA

    Andreas Blass

  3. Tel Aviv University, Tel Aviv, Israel

    Nachum Dershowitz

  4. Universität des Saarlandes, Saarbrücken, Germany

    Bernd Finkbeiner

  5. Microsoft Research, REDMOND, Washington, USA

    Wolfram Schulte

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Gonen, H., Kupferman, O. (2015). Inherent Vacuity in Lattice Automata. In: Beklemishev, L., Blass, A., Dershowitz, N., Finkbeiner, B., Schulte, W. (eds) Fields of Logic and Computation II. Lecture Notes in Computer Science(), vol 9300. Springer, Cham. https://doi.org/10.1007/978-3-319-23534-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23534-9_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23533-2

  • Online ISBN: 978-3-319-23534-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation