Transitive closures of regular relations for verifying infinite-state systems

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

Volumn 1785, Issue , 2000, Pages 220-235

  Jonsson, Bengt ^a   Nilsson, Marcus ^a  

^a Dept of Computer Systems ^*  (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE ALPHABET; FINITE STATE TRANSDUCERS; INFINITE STATE SYSTEMS; INFINITE-STATE; LINEAR TOPOLOGY; PARAMETERIZED; PARAMETERIZED SYSTEM; PROGRAM MODELS; REGULAR RELATIONS; SAFETY PROPERTY; TRANSITIVE CLOSURE; ARBITRARY NUMBER; PROGRAM MODELING;

ALGORITHMS; DATA STRUCTURES; INTEGER PROGRAMMING; PARAMETERIZATION;

TOPOLOGY;

EID: 84863921735     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-46419-0_16     Document Type: Article

References (27)

1. th CAV, Volume 1427 of LNCS, pages 305-318, 1998. (Pubitemid 128092348)
2. th CAV, Volume 1633 of LNCS, pages 134-145, 1999.
3. th LICS, pages 414-425, Philadelphia, 1990.
4. th LICS, pages 313-321, 1996.
5. th Annual Symp. Foundations of Computer Science, pages 164-169, 1989.
6. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996. (Pubitemid 126411497)
7. th LICS, 1990.
8. th CAV, Volume 1102 of Lecture Notes in Computer Science, pages 1-12. Springer Verlag, 1996. (Pubitemid 126101265)
9. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In Proc. of the Fourth International Static Analysis Symposium, LNCS. Springer Verlag, 1997.
10. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifochannel systems with nonregular sets of configurations. In Proc. ICALP '97, Volume 1256 of Lecture Notes in Computer Science, 1997.
11. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers, C-35(8):677-691, Aug. 1986.
12. O. Burkart and B. Steffen. Composition, decomposition, and model checking of pushdown processes. Nordic Journal of Computing, 2(2):89-125, 1995.
13. th CAV, Volume 818 of LNCS, pages 55-67. Springer Verlag, 1994.
14. th ACM Symp. on Principles of Programming Languages, pages 238-252, 1977.
15. E.W. Dijkstra, W.H.J. Feijen, and A.J.M. van Gasteren. Derivation of a terminationdetectionalgorithm for distributed somputations. Information Processing Letters, 16(5):217-219, 1983.
16. A. Finkel. Decidability of the termination problem for completely specified protocols. Distributed Computing, 7(3), 1994.
17. L. Fribourg and H. Olsén. Reachability sets of parametrized rings as regular languages. In Proc. 2nd Int. Workshop on Verification of Infinite State Systems (INFINITY'97), Volume 9 of Electronical Notes in Theoretical Computer Science. Elsevier Science Publishers, July 1997.
18. S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, 1992. (Pubitemid 23600392)
19. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, Volume 1019 of LNCS, 1996.
20. J.G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Tools and Algorithms for the Construction and Analysis of Systems, First International Workshop, TACAS '95, LNCS 1019, 1996. Also available through http://www.brics.dk/k˜larlund/Mona/main.html.
21. N. Klarlund and A. Møller. MONA Version 1.3 User Manual. BRICS Notes Series NS-98-3 (2.revision), Department of Computer Science, University of Aarhus, October 1998.
22. th CAV, volume 1254, pages 424-435, Haifa, Israel, 1997. Springer Verlag. (Pubitemid 127088997)
23. P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. Mosel: A flexible toolset for monadic second-order logic. In Proc. of the Int. Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'97), Enschede (NL), Volume 1217 of LNCS, pages 183-202, Heidelberg, Germany, March 1997. Springer-Verlag. (Pubitemid 127053060)
24. th CAV, Volume 1254 of LNCS, pages 412-423, Haifa, Israel, 1997. Springer Verlag.
25. th Int. Conf. on Concurrency Theory, Volume 1119 of LNCS, pages 217-232. Springer Verlag, 1996. (Pubitemid 126117764)
26. st LICS, pages 332-344, June 1986. (Pubitemid 17563569)
27. Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. 10th CAV, Volume 1427 of LNCS, pages 88-97, Vancouver, July 1998. Springer Verlag (Pubitemid 128092330)