Forward analysis for wsts, part II: Complete WSTS

Logical Methods in Computer Science

Volumn 8, Issue 3, 2012, Pages

  Finkel, Alain ^a   Goubault Larrecq, Jean ^a,b  

^a CNRS   (France)

^b INRIA SACLAY   (France)

Author keywords

Clover; Completion; Cover; Dcpo; Verification; Well structured transition systems

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; VERIFICATION; WELL COMPLETION;

CLOVER; COVER; DCPO; DOWNWARD CLOSURE; FORWARD ANALYSIS; LOSSY CHANNEL SYSTEMS; NOCV1; REACHABILITY SET; WELL-STRUCTURED TRANSITION SYSTEMS;

PETRI NETS;

EID: 85011661212     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-8(3:28)2012     Document Type: Article

References (46)

1. Parosh Abdulla, Ahmed Bouajjani, and Bengt Jonsson. On-the-fly analysis of systems with unbounded, lossy Fifo channels. In Proc. 10th Intl. Conf. Computer Aided Verification (CAV’98), pages 305-318, Vancouver, Canada, June 1998. Springer Verlag LNCS 1427.
2. Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani, and Bengt Jonsson. Using forwardreachability analysis for verification of lossy channel systems. Formal Methods in System Design, 25(1):39-65, 2004.
3. Parosh Aziz Abdulla, Karlis Čerāns, Bengt Jonsson, and Yih-Kuen Tsay. Algorithmic analysisof programs with well quasi-ordered domains. Information and Computation, 160(1-2):109-127, 2000.
4. Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, and Aletta Nylén. Forward reachabilityanalysis of timed Petri nets. In FORMATS/FTRTFT, pages 343-362. Springer Verlag LNCS 3253, 2004.
5. Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, and Aletta Nylén. Forward reachabilityanalysis of timed Petri nets. In Yassine Lakhnech and Sergio Yovine, editors, FORMATS/FTRTFT, volume 3253 of Lecture Notes in Computer Science, pages 343-362. Springer, 2004.
6. Samson Abramsky and Achim Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Oxford University Press, 1994.
7. Parosh Aziz Abdulla and Aletta Nylén. Better isbetter than well: On efficient verification of infinite-state systems. In Proc. 14th IEEE Symp. Logic in Computer Science (LICS’00), pages 132-140, 2000.
8. Sébastien Bardin, Alain Finkel, Jérôme Leroux, and Philippe Schnoebelen. Flat accelerationin symbolic model checking. In Proc. 3rd Intl. Symp. Automated Technology for Verification and Analysis (ATVA’05), pages 474-488. Springer Verlag LNCS 3707, 2005.
9. Laura Bozzelli and Pierre Ganty. Complexity analysisof the backward coverability algorithm for vass. In Proceedings of the 5th international conference on Reachability problems, RP’11, pages 96-109, Berlin, Heidelberg, 2011. Springer-Verlag.
10. Gérard Cécé, Alain Finkel, and S. Purushothaman Iyer. Unreliable channelsare easier to verify than perfect channels. Information and Computation, 124(1):20-31, January 1996.
11. Pierre Chambart, Alain Finkel, and Sylvain Schmitz. Forward analysisand model checking for trace bounded WSTS. In Lars M. Kristensen and Laure Petrucci, editors, Proceedings of the 32nd International Conference on Applications and Theory of Petri Nets (ICATPN’11), volume 6709 of Lecture Notes in Computer Science, Newcastle upon Tyne, UK, June 2011. Springer.
12. Stéphane Demri, Alain Finkel, Valentin Goranko, and Govert van Drimmelen. Towards amodelchecker for counter systems. In 4th ATVA, pages 493-507. Springer Verlag LNCS 4218, 2006.
13. Catherine Dufourd, Alain Finkel, and Philippe Schnoebelen. Reset netsbetween decidability and undecidability. In Proc. 25th Intl. Coll. Automata, Languages and Programming (ICALP’98), pages 103-115. Springer Verlag LNCS 1443, 1998.
14. Javier Esparza, Alain Finkel, and Richard Mayr. On theverification of broadcast protocols. In 14th LICS, pages 352-359, 1999.
15. E. Allen Emerson and Kedar S. Namjoshi. On model-checking for non-deterministic infinitestate systems. In 13th LICS, pages 70-80, 1998.
16. Alain Finkel and Jean Goubault-Larrecq. Forward analysisfor WSTS, part I: Completions. In Susanne Albers and Jean-Yves Marion, editors, Proceedings of the 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS’09), volume 3 of Leibniz International Proceedings in Informatics, pages 433-444, Freiburg, Germany, February 2009. Leibniz-Zentrum für Informatik.
17. Alain Finkel and Jean Goubault-Larrecq. Forward analysisfor WSTS, part I: Completions. In preparation, 2012. Journal version of [FG09].
18. Alain Finkel. A generalization of the procedure of Karp and Miller to well structured transition systems. In Proc. 13th Intl. Coll. Automata, Languages and Programming (ICALP’87), pages 499-508. Springer Verlag LNCS 267, 1987.
19. Alain Finkel. Reduction andcovering of infinite reachability trees. Information and Computation, 89(2):144-179, 1990.
20. Alain Finkel. The minimalcoverability graph for Petri nets. In 12th Intl. Conf. Advances in Petri Nets, pages 210-243. Springer Verlag LNCS 674, 1993.
21. Alain Finkel, Pierre McKenzie, and Claudine Picaronny. A well-structured framework for analysing Petri net extensions. Information and Computation, 195(1-2):1-29, 2004.
22. Alain Finkel and Philippe Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
23. Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael Mislove, and Dana S. Scott. Continuous lattices and domains. In Encyclopedia of Mathematics and its Applications, volume 93. Cambridge University Press, 2003.
24. Jean Goubault-Larrecq. On Noetherian spaces. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS’07), pages 453-462, Wrocław, Poland, July 2007. IEEE Computer Society Press.
25. Pierre Ganty, Jean-François Raskin, and Laurent van Begin. A complete abstract interpretation framework for coverability properties of WSTS. In E. Allen Emerson and Kedar S. Namjoshi, editors, Proc. 7th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI’06), pages 49-64. Springer Verlag LNCS 3855, 2006.
26. Gilles Geeraerts, Jean-François Raskin, and Laurent van Begin. Expand, enlarge and check: New algorithms for the coverability problem of WSTS. J. Comp. and System Sciences, 72(1):180-203, 2006.
27. Gilles Geeraerts, Jean-François Raskin, and Laurent van Begin. On theefficient computation of the minimal coverability set for Petri nets. In Proc. 5th Intl. Symp. Automated Technology for Verification and Analysis (ATVA’05), pages 98-113. Springer LNCS 4762, 2007.
28. Seymour Ginsburg and Edwin H. Spanier. Bounded Algol-like languages. Trans. American Mathematical Society, 113(2):333-368, 1964.
29. J. Hopcroft and J. J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8:135-159, 1979.
30. Petr Jancar. A note on well quasi-orderings for powersets. Information Processing Letters, 72(5-6):155-160, 1999.
31. R. M. Karp and R. E. Miller. Parallel program schemata. J. Comp. and System Sciences, 3(2):147-195, 1969.
32. Richard Laver. On Fraïssé‘s order type conjecture. Annals ofMathematics (2), 93:89-111, 1971.
33. Alberto Marcone. Foundations ofBQO theory. Trans. Amer. Math. Soc., 345(2):641-660, 1994.
34. Richard Mayr. Undecidable problemsin unreliable computations. Theor. Comput. Sci., 297(1-3):337-354, 2003.
35. Richard Mayr. Undecidable problemsin unreliable computations. Theoretical Computer Science, 297(1-3):337-354, 2003.
36. E. C. Milner. Basic WQO-and BQO-theory. In I. Rival, editor, Graphs and Order. The Role of Graphs in the Theory of Ordered Sets and Its Applications, pages 487-502. D. Reidel Publishing Co., 1985.
37. Ernst W. Mayr andAlbert R. Meyer. The complexity of the finite containment problem for petri nets. J. ACM, 28(3):561-576, 1981.
38. Crispin Saint-John Alvah Nash-Williams. On well-quasi-ordering infinite trees. Proc. Cambridge Philosophical Society, 61:697-720, 1965.
39. Charles Rackoff. The coveringand boundedness problems for vector addition systems. Theor Comput. Sci., 6:223-231, 1978.
40. Richard Rado. Partial well-ordering of sets of vectors. Mathematika, 1:89-95, 1954.
41. Neil Robertson and P.D. Seymour. Graph minors. XX. Wagner’s conjecture. Journal of Combinatorial Theory, Series B, 92(2):325-357, 2004.
42. Philippe Schnoebelen. Bisimulation andother undecidable equivalences for lossy channel systems. In Naoki Kobayashi and Benjamin C. Pierce, editors, Proceedings of the 4th International Workshop on Theoretical Aspects of Computer Software (TACS’01), volume 2215 of Lecture Notes in Computer Science, pages 385-399, Sendai, Japan, October 2001. Springer.
43. Rüdiger Valk. Self-modidying nets, a natural extension of Petri nets. In Proceedings of the 5th International Colloquium on Automata, Languages and Programming (ICALP’78), pages 464-476. Springer Verlag LNCS 62, 1978.
44. Kumar N. Verma and Jean Goubault-Larrecq. Karp-Miller trees for a branching extension of VASS. Discrete Mathematics & Theoretical Computer Science, 7(1):217-230, November 2005.
45. Thomas Wies, Damien Zufferey, and Thomas A. Henzinger. Forward analysisof depth-bounded processes. In C.-H. Luke Ong, editor, FOSSACS, volume 6014 of Lecture Notes in Computer Science, pages 94-108. Springer, 2010.
46. Damien Zufferey, Thomas Wies, and Thomas A. Henzinger. Ideal abstractionsfor wellstructured transition systems. In VMCAI, pages 445-460, 2012.