Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations

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

Volumn 1256, Issue , 1997, Pages 560-570

  Bouajjani, Ahmed ^a   Habermehl, Peter ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

FIFO CHANNELS; FORWARD-AND-BACKWARD; LINEAR CONSTRAINTS; REACHABILITY ANALYSIS; SYMBOLIC ANALYSIS; SYMBOLIC REACHABILITY ANALYSIS; TRANSITION GRAPHS; VERIFICATION PROBLEMS;

GRAPH THEORY;

EID: 84950991319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_211     Document Type: Conference Paper

References (16)

1. P. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127:91-101, 1996.
2. R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The Algorithmic Analysis of Hybrid Systems. TCS, 138, 1995.
3. R. Alur and D. Dill. A Theory of Timed Automata. TCS, 126, 1994.
4. G.V. Bochmann. Finite State Description of Communication Protocols. Computer Networks, 2, October 1978.
5. B. Boigelot and P. Godefroid. Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. In CAV'96, LNCS 1102, 1996.
6. B. Boigelot and P. Wolper. Symbolic Verification with Periodic Sets. In CAV'94-LNCS 818, 1994.
7. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR '97, 1997.
8. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. 1997. full version available at http://www.imag.fr/VERIMAG/PEOPLE/Peter.Habermehl.
9. A. Bouajjani and O. Maler. Reachability Analysis of Pushdown Automata. In Infinity'96. tech. rep. MIP-9614, Univ. Passau, 1996.
10. D. Brand and P. Zafiropulo. On communicating finite-state machines. JACM, 2(5):323-342, 1983.
11. O. Burkart and Y.M. Quemener. Model-Checking of Infinite Graphs Defined by Graph Grammars. In Infinity '96. tech. rep. MIP-9614, Univ. Passau, 1996.
12. Gerard Cece, Alain Finkel, and S. Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. Information and Computation, 124(1):20-31, 1996.
13. S. Melzer and J. Esparza. Checking System Properties via Integer Programming. In ESOP'96. LNCS 1058, 1996.
14. R.J. Parikh. On Context-Free Languages. JACM, 13, 1966.
15. W. Peng and S. Purushotaman Iyer. Data Flow Analysis of Communicating Finite State Machines. ACM Transactions on Programming Languages and Systems, 13(3):399-442, July 1991.
16. Y.M. Quemener and T. Jeron. Finitely Representing Infinite Reachability Graphs of CFSMs with Graph Grammars. In FORTE/PSTV'96. Chapman and Hall, 1996.