Skip to main content
SpringerLink
Log in

Forward Analysis and Model Checking for Trace Bounded WSTS

  • Conference paper
Applications and Theory of Petri Nets (PETRI NETS 2011)

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

Abstract

We investigate a subclass of well-structured transition systems (WSTS), the bounded—in the sense of Ginsburg and Spanier (Trans. AMS 1964) —complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (ICALP 2009). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all ω-regular properties on the set of infinite traces of the system.

Work supported by ANR project AVeriSS (ANR-06-SETIN-001).

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdulla, P.A., Čerans, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inform. and Comput. 160, 109–127 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Form. Methods in Syst. Des. 25, 39–65 (2004)

    Article  MATH  Google Scholar 

  3. Abdulla, P.A., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. Inform. and Comput. 130, 71–90 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inform. and Comput. 127, 91–101 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Annichini, A., Bouajjani, A., Sighireanu, M.: TREX: A tool for reachability analysis of complex systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 368–372. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: Fast: acceleration from theory to practice. Int. J. Softw. Tools Technol. Transfer 10, 401–424 (2008)

    Article  Google Scholar 

  7. Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat acceleration in symbolic model checking. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 474–488. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Blockelet, M., Schmitz, S.: Model checking coverability graphs of vector addition systems (2011) (in preparation)

    Google Scholar 

  9. Boigelot, B., Wolper, P.: Symbolic verification with periodic sets. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 55–67. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  10. Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. Theor. Comput. Sci. 221, 211–250 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bozga, M., Iosif, R., Lakhnech, Y.: Flat parametric counter automata. Fund. Inform. 91, 275–303 (2009)

    MathSciNet  MATH  Google Scholar 

  12. Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups. In: Proc. STOC 1976, pp. 50–54. ACM Press, New York (1976)

    Google Scholar 

  13. Chambart, P., Finkel, A., Schmitz, S.: Forward analysis and model checking for trace bounded WSTS. Research report, LSV (2010), http://arxiv.org/abs/1004.2802 (cs.LO)

  14. Comon, H., Cortier, V.: Flatness is not a weakness. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 262–276. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and Presburger arithmetic. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 268–279. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  16. Cortier, V.: About the decision of reachability for register machines. Theor. Inform. Appl. 36, 341–358 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  17. Demri, S.: On Selective Unboundedness of VASS. In: Proc. INFINITY 2010. Elec. Proc. in Theor. Comput. Sci., vol. 39, pp. 1–15 (2010)

    Google Scholar 

  18. Demri, S., Finkel, A., Goranko, V., van Drimmelen, G.: Model-checking CTL* over flat Presburger counter systems. J. Appl. Non-Classical Log. 20, 313–344 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  19. Dufourd, C., Jančar, P., Schnoebelen, P.: Boundedness of reset P/T nets. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 301–310. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  20. Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinite-state systems. In: Proc. LICS 1998, pp. 70–80. IEEE, Los Alamitos (1998)

    Google Scholar 

  21. Esparza, J.: Decidability of model checking for infinite-state concurrent systems. Acta Inf. 34, 85–107 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  22. Finkel, A.: Reduction and covering of infinite reachability trees. Inform. and Comput. 89, 144–179 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  23. Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: Completions. In: Proc. STACS 2009. LIPIcs, vol. 3, pp. 433–444. LZI (2009)

    Google Scholar 

  24. Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part II: Complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 188–199. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  25. Finkel, A., Leroux, J.: How to compose presburger-accelerations: Applications to broadcast protocols. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 145–156. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  26. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256, 63–92 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  27. Fribourg, L., Olsén, H.: Proving safety properties of infinite state systems by compilation into Presburger arithmetic. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 213–227. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  28. Ganty, P., Majumdar, R., Rybalchenko, A.: Verifying liveness for asynchronous programs. In: Proc. POPL 2009, pp. 102–113. ACM Press, New York (2009)

    Google Scholar 

  29. Gawrychowski, P., Krieger, D., Rampersad, N., Shallit, J.: Finding the growth rate of a regular or context-free language in polynomial time. Int. J. Fund. Comput. Sci. 21, 597–618 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  30. Geeraerts, G., Raskin, J., Begin, L.V.: Well-structured languages. Acta Inf. 44, 249–288 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  31. Ginsburg, S., Spanier, E.H.: Bounded Algol-like languages. T. Amer. Math. Soc. 113, 333–368 (1964)

    MathSciNet  MATH  Google Scholar 

  32. Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3, 147–195 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  33. Krohn, M., Kohler, E., Kaashoek, M.F.: Events can make sense. In: Proc. USENIX 2007, pp. 87–100 (2007)

    Google Scholar 

  34. The Liège automata-based symbolic handler (Lash), http://www.montefiore.ulg.ac.be/~boigelot/research/lash/

  35. Leroux, J., Sutre, G.: Flat counter automata almost everywhere! In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 489–503. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  36. Mayr, R.: Undecidable problems in unreliable computations. Theor. Comput. Sci. 297, 337–354 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  37. Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223–231 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  38. Safra, S.: On the complexity of ω-automata. In: Proc. FOCS 1988, pp. 319–327. IEEE Computer Society Press, Los Alamitos (1988)

    Google Scholar 

  39. Siromoney, R.: A characterization of semilinear sets. Proc. Amer. Math. Soc. 21, 689–694 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  40. Valk, R., Vidal-Naquet, G.: Petri nets and regular languages. J. Comput. Syst. Sci. 23, 299–325 (1981)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSV, ENS Cachan & CNRS, Cachan, France

    Pierre Chambart, Alain Finkel & Sylvain Schmitz

Authors
  1. Pierre Chambart
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alain Finkel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sylvain Schmitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Engineering, Bergen University College, Norway

    Lars M. Kristensen

  2. LIPN, CNRS UMR 7030, Université Paris XIII, 99, avenue Jean-Baptiste Clément, F-93430, Villetaneuse, France

    Laure Petrucci

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chambart, P., Finkel, A., Schmitz, S. (2011). Forward Analysis and Model Checking for Trace Bounded WSTS. In: Kristensen, L.M., Petrucci, L. (eds) Applications and Theory of Petri Nets. PETRI NETS 2011. Lecture Notes in Computer Science, vol 6709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21834-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21834-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21833-0

  • Online ISBN: 978-3-642-21834-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation