Handling global conditions in parametrized system verification

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

Volumn 1633, Issue , 1999, Pages 134-145

  Abdulla, Parosh Aziz ^a   Bouajjani, Ahmed ^b   Jonsson, Bengt ^a   Nilsson, Marcus ^a  

^a Dept of Computer Systems ^*  (Sweden)

^b VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; PARAMETERIZATION;

ARBITRARY NUMBER; GLOBAL CONDITIONS; LOCAL CONDITIONS; MUTUAL EXCLUSION PROTOCOL; PARAMETERIZED SYSTEM; PARAMETRIZED SYSTEMS; SYMBOLIC REACHABILITY; SYMBOLIC VERIFICATION;

MODEL CHECKING;

EID: 84957059164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48683-6_14     Document Type: Conference Paper

References (21)

1. th Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 305-318, 1998.
2. th IEEE Int. Symp. on Logic in Computer Science, pages 414-425, Philadelphia, 1990.
3. [AJ96] Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unre liable channels. Information and Computation, 127(2):91-101, 1996.
4. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1384 of Lecture Notes in Computer Science, pages 298-312, 1998.
5. th Int. Conf. on Computer Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 1-12. Springer Verlag, 1996.
6. [BGWW97] B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In Proc. of the Fourth International Static Analysis Symposium, Lecture Notes in Computer Science. Springer Verlag, 1997.
7. [BH97] A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. In Proc. ICALP '97, number 1256 in Lecture Notes in Computer Science, 1997.
8. [BS95] O. Burkart and B. Steffen. Composition, decomposition, and model checking of pushdown processes. Nordic Journal of Computing, 2(2):89-125, 1995.
9. [Cer94] K. Cerans. Deciding properties of integral relational automata. In Abite-boul and Shamir, editors, Proc. ICALP '94, volume 820 of Lecture Notes in Computer Science, pages 35-46. Springer Verlag, 1994.
10. th Int. Conf. on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 395-407. Springer Ver-lag, 1995.
11. [Esp95] J. Esparza. Petri nets, commutative context-free grammers, and basic parallel processes. In Proc. Fundamentals of Computation Theory, number 965 in Lecture Notes in Computer Science, pages 221-232, 1995.
12. [GS92] S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, 1992.
13. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, number 1384 in Lecture Notes in Computer Science, pages 424-438, 1998.
14. [Jan90] P. Jancar. Decidability of a temporal logic problem for Petri nets. Theo retical Computer Science, 74:71-93, 1990.
15. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, number 1384 in Lecture Notes in Computer Science, pages 409-423, 1998.
16. th ACM Symp. on Principles of Distributed Computing, Canada, pages 239-247, Edmonton, Alberta, 1989.
17. th Int. Conf. on Computer Aided Verification, volume 1254, pages 424-435, Haifa, Israel, 1997. Springer Verlag.
18. [MAB+94] Z. Manna, A. Anuchitanukul, N. Bjørner, A. Browne, E. chang, M. Colon, L. de Alfaro, H. Devarajan, H. Sipma, and T. Uribe. STEP: the stanfor temporal prover. Draft Manuscript, June 1994.
19. [MP90] Z. Manna and A. Pnueli. An exercise in the verification of multi-process programs. In W.H.J. Feijen, A.J.M van Gasteren, D. Gries, and J. Misra, editors, Beauty is Our Business, pages 289-301. Springer-Verlag, 1990.
20. [WL89] P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants (extended abstract). In Sifakis, editor, Proc. Workshop on Computer Aided Verification, number 407 in Lecture Notes in Computer Science, pages 68-80, 1989.
21. th ACM Symp. on Principles of Programming Languages, pages 184-193, Jan. 1986.