A new approach to upward-closed set backward reachability analysis

Electronic Notes in Theoretical Computer Science

Volumn 138, Issue 3, 2005, Pages 37-48

  Bingham, Jesse ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Broadcast protocol; Parameterized model checking; Petri net; Well structured transition system

Indexed keywords

ALGORITHMS; BROADCASTING; DECISION THEORY; NETWORK PROTOCOLS; PETRI NETS;

BROADCAST PROTOCOL; PARAMETERIZED MODEL CHECKING; REACHABILITY; WELL-STRUCTRURED TRANSITION SYSTEM;

SYSTEMS ANALYSIS;

EID: 29144495877     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.01.045     Document Type: Conference Paper

References (11)

1. P. Aziz Abdulla, K. Cerans, B. Jonsson, and T. Yih-Kuen. General decidability theorems for infinite-state systems. In 10th Annual IEEE Symp. on Logic in Computer Science (LICS'96), pages 313-321, 1996
2. J. Bingham. A new approach to upward-closed set backward reachability analysis. Technical report, University of British Columbia Department of Computer Science, 2004. TR-2004-07
3. R.E. Bryant Graph-based algorithms for boolean function manipulation IEEE Trans. on Computers C-35 8 August 1986 677 691
4. 20 states and beyond. In Conf. on Logic in Computer Science, pages 428-439, 1990
5. G. Delzanno and J.F. Raskin. Symbolic representation of upward-closed sets. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 7th Int'l Conf., pages 426-440, 2000
6. G. Delzanno, J.F. Raskin, and L. Van Begin. Attacking symbolic state explosion. In Proc. of 13th Int'l Conf. on Computer-Aided Verification (CAV), pages 298-310, 2001
7. E.A. Emerson and K.S. Namjoshi. On model checking for non-deterministic infinite-state systems. In 12th Annual IEEE Symp. on Logic in Computer Science (LICS'98), pages 70-80, 1998
8. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In 13th Annual IEEE Symp. on Logic in Computer Science (LICS'99), pages 352-359, 1999
9. A. Finkel, and Ph. Schnoebelen Well structured transition systems everywhere! Theoretical Computer Science 256 1-2 2001 63 92
10. P. Ganty and L. Van Begin. Non deterministic automata for the efficient verification of infinite-state. presented at: CP+CV Workshop at European Joint Conferences on Theory and Practice of Software (ETAPS), 2004
11. F. Somenzi Colorado university decision diagram package (CUDD) webpage http://vlsi.colorado.edu/~fabio/CUDD/cuddIntro.html