Symbolic representation of upward-closed sets

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

Volumn 1785 LNCS, Issue , 2000, Pages 426-441

  Delzanno, Giorgio ^a   Raskin, Jean François ^b,c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; VECTORS; MODEL CHECKING;

ABSTRACT ALGORITHM; BROADCAST PROTOCOLS; INFINITE STATE SYSTEMS; STATE EXPLOSION PROBLEMS; SYMBOLIC MODEL CHECKERS; SYMBOLIC REPRESENTATION; VECTOR ADDITION SYSTEMS; VERIFICATION PROBLEMS;

MODEL CHECKING; ALGORITHMS;

EID: 84863907611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46419-0_29     Document Type: Conference Paper

References (30)

1. P. A. Abdulla, K. Čerāns, B. Jonsson, and Y.-K. Tsay. General Decidability Theorems for Infinite-state Systems. In Proceedi ngs of the 11th Annual Symposium on Logic in Computer Science (LICS'96), pages 313-321. IEEE Computer Society Press, 1996.
2. P. A. Abdulla, B. Jonsson, M. Kindahl, and D. Peled. A General Approach to Partial Order Reductions in Symbolic Verification. In Proceedi ngs of the 10th Conference on Computer Aided Verification (CAV'98), Volume 1427 of LNCS, pages 379-390. Springer, 1998. (Pubitemid 128092354)
3. G. Behrmann, K. G. Larsen, J. Pearson, C. Weise, and W. Yi. Efficient Timed Reachability Analysis Using Clock Difference Diagrams. In Proceedings of the 11th Conference on Computer Aided Verification (CAV'99), Volume 1633 of LNCS, pages 341-353. Springer 1999.
4. B. Boigelot, P. Wolper. Verifying systems with infinite but regular state space. In Proceedings of the 10th International Conference on Computer Aided Verification (CAV'98), Volume 1427 of LNCS, pages 88-97. Springer, 1998. (Pubitemid 128092330)
5. A. Bouajjani and R. Mayr. Model Checking Lossy Vector Addition Systems. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS'99), Volume 1563 of LNCS, pages 323-333. Springer, 1999.
6. R. E. Bryant. Graph-based Algorithms for Boolean Function Manipulation. IEEE Transaction on Computers, C-35(8):667-691, August, 1986.
7. T. Bultan, R. Gerber, and W. Pugh. Symbolic Model Checking of Infinitestate Systems using Presburger Arithmetics. In Proc. 9th Conf. on Computer Aided Verification (CAV'97), LNCS 1254, pages 400-411. Springer-Verlag, 1997. (Pubitemid 127088995)
8. 20 States and Beyond. In Proceedings of the 5th IEEE Symposium on Logic in Computer Science, pages 428-439. IEEE Computer Society Press, 1990.
9. K. Čerāns. Deciding Properties of Integral Relational Automata. In Proceedings of the International Conferences on Automata and Languages for Programming (ICALP 94), Volume 820 of LNCS, pages 35-46. Springer, 1994.
10. G. Ciardo. Petri nets with marking-dependent arc multiplicity: properties and analysis. In Proceedings of the 15th Int. Conf. on Application and Theory of Petri Nets 1994, LNCS 815, pages 179-198. Springer-Verlag, 1994.
11. E. Clarke, M. Fujita, and X. Zhao. Multi-terminal Binary Decision Diagrams and Hybrid Decision Diagrams. In Representations of Discrete Functions, pages 93-108. Kluwer Academic Publishers, 1996.
12. G. Delzanno, J. Esparza, and A. Podelski. Constraint-based Analysis of Broadcast Protocols. In Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'99), Volume 1683 of LNCS, pag. 50-66. Springer, 1999.
13. G. Delzanno and A. Podelski, Model Checking in CLP. In W. R. Cleaveland, editor, Proc. 5th Int. Con. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), LNCS 1579, pages 223-239. Springer-Verlag, 1999.
14. G. Delzanno and J. F. Raskin. Symbolic Representation of Upward-Closed Sets. Technical report MPI-I-1999-2-007, Max-Planck-Institut für Informatik, November 1999. Available on the web at http://www.mpisb.mpg.de/ units/ag2/.
15. E. A. Emerson and K. S. Namjoshi. On Model Checking for Nondeterministic Infinite-state Systems. In Proceedi ngs of the 13th Annual Symposium on Logic in Computer Science (LICS '98), pages 70-80. IEEE Computer Society Press, 1998.
16. J. Esparza, A. Finkel, and R. Mayr. On the Verification of Broadcast Protocols. In Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 352-359. IEEE Computer Society Press, 1999.
17. A. Finkel. Reduction and Covering of Infinite Reachability Trees. Information and Computation 89(2), pages 144-179. Academic Press, 1990.
18. A. Finkel and P. Schnoebelen. Well-structured Transition Systems Everywhere! Theoretical Computer Science, 1999. To appear.
19. F. Gagnon, J.-Ch. Grégoire, and D. Zampuniéris. Sharing Trees for 'On-the-fly' Verification. In Proceedings of the International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE'95), 1995.
20. B. Grahlmann. The PEP Tool. In Proceedings of the 9th Conference on Computer Aided Verification (CAV'97), Volume 1254 of LNCS, pages 440-443. Springer, 1997. (Pubitemid 127088999)
21. M. R. Henzinger, T. A. Henzinger, P. K. Kopke. Computing Simulations on Finite and Infinite Graphs. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS'95), pages 453-462. IEEE Society Press, 1995.
22. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HYTECH: a Model Checker for Hybrid Systems. In Proceedings of the 9th Conference on Computer Aided Verification (CAV'97), Volume 1254 of LNCS, pages 460-463. Springer, 1997. (Pubitemid 127089004)
23. K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic, 1993.
24. N. M. Minsky. Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, N.Y., 1967.
25. A. Srinivasan, T. Kam, S. Malik, and R. K. Brayton. Algorithms for Discrete Functions Manipulation. In Proceedi ngs of the IEEE I nternati onal Conference on Computer-Aided Design (ICCAD'90), 1990.
26. K. Strehl, L. Thiele. Interval Diagram Techniques For Symbolic Model Checking of Petri Nets. In Proceedings of the Design, Automation and Test in Europe Conference (DATE'99), pages 756-757, 1999.
27. E. Teruel. Structure Theory of Weighted Place/Transition Net Systems: The Equal Conflict Hiatus. Ph.D. Thesis, University of Zaragoza, 1994.
28. G. Wimmel. A BDD-based Model Checker for the PEP Tool. Technical Report, University of Newcastle Upon Tyne, 1997.
29. D. Zampuniéris. The Sharing Tree Data Structure: Theory and Applications in Formal Verification. PhD Thesis. Facultés Universitaires Notre-Dame de la Paix, Namur, Belgium, May 1997.
30. D. Zampuniéris, and B. Le Charlier. Efficient Handling of Large Sets of Tuples with Sharing Trees. In Proceedings of the Data Compressions Conference (DCC'95), 1995.