On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4246 LNAI, Issue , 2006, Pages 347-361

  Baier, Christel ^a   Bertrand, Nathalie ^b   Schnoebelen, Philippe ^b  

^a UNIVERSITY OF BONN   (Germany)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; THEOREM PROVING;

FINITE CONVERGENCE THEOREM; LOSSY CHANNEL SYSTEMS; MODEL CHECKING;

COMPUTATIONAL METHODS;

EID: 33845203433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_24     Document Type: Conference Paper

References (30)

1. P. A. Abdulla, N. Bertrand, A. Rabinovich, and Ph Schnoebelen. Verification of probabilistic systems with faulty communication. Information and Computation, 202(2): 141-165, 2005.
2. P. A. Abdulla, A. Bouajjani, and J. d'Orso. Deciding monotonic games. In Proc. 17th Int. Workshop Computer Science Logic (CSL 2003) and 8th Kurt Gödel Coll. (KGL 2003), Vienna, Austria, Aug. 2003, volume 2803 of Lecture Notes in Computer Science, pages 1-14. Springer, 2003.
3. P. A. Abdulla, K. Čerāns, B. Jonsson, and Yih-Kuen Tsay. Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, 160(1/2): 109-127, 2000.
4. P. A. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71-90, 1996.
5. P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
6. P. A. Abdulla and B. Jonsson. Channel representation in protocol verification. In Proc. 12th Int. Conf. Concurrency Theory (CONCUR 2001), Aalborg, Denmark, Aug. 2001, volume 2154 of Lecture Notes in Computer Science, pages 1-15. Springer, 2001.
7. A. Arnold and D. Niwiński. Rudiments of μ-Calculus, volume 146 of Studies in Logic and the Foundations of Mathematics. Elsevier Science, 2001.
8. C. Baier, N. Bertrand, and Ph. Schnoebelen. A note on the attractor-property of infinite-state Markov chains. Information Processing Letters, 97(2):58-63, 2006.
9. C. Baier, N. Bertrand, and Ph. Schnoebelen. Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Transactions on Computational Logic, 2006. To appear, available at http://arxiv.org/abs/cs.LO/0511023.
10. S. Bardin, A. Finkel, J. Leroux, and Ph. Schnoebelen. Flat acceleration in symbolic model checking. In Proc. 3rd Int. Symp. Automated Technology for Verification and Analysis (ATVA 2005), Taipei, Taiwan, Oct. 2005, volume 3707 of Lecture Notes in Computer Science, pages 474-488. Springer, 2005.
11. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In Proc. 12th Int. Conf. Computer Aided Verification (CAV2000), Chicago, IL, USA, July 2000, volume 1855 of Lecture Notes in Computer Science, pages 403-418. Springer, 2000.
12. G. Cécé, A. Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20-31, 1996.
13. K. Chatterjee, L. de Alfaro, and T. A. Henzinger. The complexity of stochastic Rabin and Streett games. In Proc. 32nd Int. Coll. Automata, Languages, and Programming (ICALP 2005), Lisbon, Portugal, July 2005, volume 3580 of Lecture Notes in Computer Science, pages 878-890. Springer, 2005.
14. L. de Alfaro, T. A. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In Proc. 12th Int. Conf. Concurrency Theory (CONCUR 2001), Aalborg, Denmark, Aug. 2001, volume 2154 of Lecture Notes in Computer Science, pages 536-550. Springer, 2001.
15. A. Finkel. Decidability of the termination problem for completely specificied protocols. Distributed Computing, 7(3):129-135, 1994.
16. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
17. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of Lecture Notes in Computer Science. Springer, 2002.
18. T. A. Henzinger, R. Majumdar, and J.-F. Raskin. A classification of symbolic transition systems. ACM Trans. Computational Logic, 6(1): 1-32, 2005.
19. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. Theoretical Computer Science, 256(1-2):93-112, 2001.
20. J. B. Kruskal. The theory of well-quasi-ordering: A frequently discovered concept. Journal of Combinatorial Theory, Series A, 13(3):297-305, 1972.
21. A. Kučera and Ph. Schnoebelen. A general approach to comparing infinite-state systems with their finite-state specifications. Theoretical Computer Science, 358(2-3):315-333, 2006.
22. D. A. Martin. The determinacy of Blackwell games. The Journal of Symbolic Logic, 63(4):1565-1581, 1998.
23. R. Mayr. Undecidable problems in unreliable computations. Theoretical Computer Science, 297(1-3):337-354, 2003.
24. 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, 1985.
25. J. Ouaknine and J. Worrell. On metric temporal logic and faulty Turing machines. In Proc. 9th Int. Conf. Foundations of Software Science and Computation Structures (FOSSACS 2006), Vienna, Austria, Mar. 2006, volume 3921 of Lecture Notes in Computer Science, pages 217-230. Springer, 2006.
26. D. Perrin. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 1, pages 1-57. Elsevier Science, 1990.
27. J.-F. Raskin, M. Samuelides, and L. Van Begin. Petri games are monotonie but difficult to decide. Tech. Report 2003.21, Centre Fédé ré en Vérification, 2003. Available at http://www.ulb.ac.be/di/ ssd/cfv/TechReps.
28. J.-F. Raskin, M. Samuelides, and L. Van Begin. Games for counting abstractions. In Proc. 4th Int. Workshop on Automated Verification of Critical Systems (AVoCS 2004), London, UK, Sep. 2004, volume 128(6) of Electronic Notes in Theor. Comp. Sci., pages 69-85. Elsevier Science, 2005.
29. Ph. Schnoebelen. The verification of probabilistic lossy channel systems. In Validation of Stochastic Systems - A Guide to Current Research, volume 2925 of Lecture Notes in Computer Science, pages 445-465. Springer, 2004.
30. J. Sifakis. A unified approach for studying the properties of transitions systems. Theoretical Computer Science, 18:227-258, 1982.