Constraint-based analysis of broadcast protocols

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

Volumn 1683, Issue , 1999, Pages 50-66

  Delzanno, Giorgio ^a   Esparza, Javier ^b   Podelski, Andreas ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC VERIFICATION; BROADCAST PROTOCOLS; CONSTRAINT-BASED ANALYSIS; OPTIMIZED ALGORITHMS; SAFETY PROPERTY;

COMPUTER CIRCUITS;

EID: 84956862107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_5     Document Type: Conference Paper

References (16)

1. P. A. Abdulla, K. Cerans, B. Jonsson and Y.-K. Tsay. General Decidabi- lity Theorems for Infinite-State Systems. In Proc. 10th IEEE Int. Symp. on Logic in Computer Science, pp. 313-321, 1996.
2. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. Series in Parallel Computing. John Wiley & Sons, 1995.
3. B. Bérard, and L. Fribourg. Reachability analysis of (timed) Petri nets using real arithmetic. In Proc.10th Int. Conf. on Concurrency Theory (CONCUR’99), Eindhoven, The Netherlands, August, 1999. To appear.
4. T. Bultan, R. Gerber, and W. Pugh. Symbolic Model Checking of Infinite- state Systems using Presburger Arithmetics. In Orna Grumberg, editor, Proc. 9th Conf. on Computer Aided Verification (CAV’97), LNCS 1254, pp. 400-411. Springer-Verlag, 1997.
5. 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, pp. 223-239. Springer-Verlag, 1999.
6. E. A. Emerson and K. S. Namjoshi. On Model Checking for Non-Deterministic Infinite-State Systems. In Proc. 13th IEEE Int. Symp. on Logic in Computer Science, 1998. 66 G. Delzanno, J. Esparza, and A. Podelski
7. J. Esparza, A. Finkel, and R. Mayr. On the Verification of Broadcast Protocols. In Proc. 14th IEEE Int. Symp. on Logic in Computer Science, 1998.
8. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Technical Report LSV-98-4, Laboratoire Spécification et Vérification, Ecole Normale Supérieure de Cachan. April 1998. To appear in Theoretical Computer Science, 1999.
9. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1978.
10. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: a Model Checker for Hybrid Systems. In Orna Grumberg, editor, Proc. 9th Conf. on Com- puter Aided Verification (CAV’97), LNCS 1254, pp. 460-463. Springer- Verlag, 1997.
11. M. Kindahl. Verification of Infinite State Systems: Decision Problems and Efficient Algorithms. Ph.D. thesis, Department of Computer Systems, Uppsala University, June 1999. Available as report DoCS 110.
12. R. M. Karp and R. E. Miller. Parallel Program Schemata. Journal of Computer and System Sciences, 3, pp. 147-195, 1969.
13. K. McAloon. Petri Nets and Large Finite Sets. Theoretical Computer Science 32, pp. 173-183, 1984.
14. D. Srivistava. Subsumption and indexing in constraint query languages with linear arithmetic constraints. In 2nd Int. Symp. on Artificial Intelligence and Mathematics, Fort Lauderdale, 1992.
15. E. Teruel. Structure Theory of Weighted Place/Transition Net Systems: The Equal Conflict Hiatus. Ph.D. Thesis, University of Zaragoza, 1994.
16. M. Y. Vardi and P. Wolper. Automata-Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences. 32(2), pp. 183-221, April, 1986.