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

Theoretical Computer Science

Volumn 221, Issue 1-2, 1999, Pages 211-250

  Bouajjani, Ahmed ^a   Habermehl, Peter ^a  

^a VERIMAG   (France)

Author keywords

Automata; FIFO channel systems; Infinite state systems; Linear constraints; Non regular sets; Symbolic reachability analysis; Verification

Indexed keywords

EID: 0005293993     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00033-X     Document Type: Article

References (19)

1. P. Abdulla, B. Jonsson, Verifying programs with unreliable channels, Inform. Comput. 127 (1996) 91-101.
2. R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine, The algorithmic analysis of hybrid systems, Theoret. Comput. Sci. 138(1) (1995) 3-34.
3. R. Alur, D. Dill, A theory of timed automata, Theoret. Comput. Sci. 126(2) (1994) 183-235.
4. G.V. Bochmann, Finite state description of communication protocols, Comput. Networks 2 (1978).
5. B. Boigelot, P. Godefroid, Symbolic verification of communication protocols with infinite state spaces using QDDs, in: CAV'96, Lecture Notes in Computer Science, vol. 1102, Springer, Berlin, 1996.
6. B. Boigelot, P. Godefroid, B. Willems, P. Wolper, The power of QDDs, in: Static Analysis Symp., Lecture Notes in Computer Science, vol. 1302, Springer, Berlin, 1997.
7. B. Boigelot, P. Wolper, Symbolic verification with periodic sets, in: CAV'94, Lecture Notes in Computer Science, vol. 818, Springer, Berlin, 1994.
8. A. Bouajjani, J. Esparza, O. Maler, Reachability analysis of pushdown automata: application to model checking, in: CONCUR'97, Lecture Notes in Computer Science, vol. 1243, Springer, Berlin, 1997.
9. A. Bouajjani, O. Maler, Reachability analysis of pushdown automata, in: Infinity'96, Tech. Report MIP-9614, Univ. Passau, 1996.
10. D. Brand, P. Zafiropulo, On communicating finite-state machines, J. ACM 2(5) (1983) 323-342.
11. O. Burkart, Y.M. Quemener, Model-checking of infinite graphs defined by graph grammars, in: Infinity'96, Tech. Report MIP-9614, Univ. Passau, 1996.
12. G. Cécé, A. Finkel, S. Purushothaman Iyer, Unreliable channels are easier to verify than perfect channels, Inform. Comput. 124(1) (1996) 20-31.
13. A. Finkel, O. Marcé, Verification of infinite regular communicating automata, Internal report, LSV, ENS-Cachan, 1996.
14. A. Finkel, B. Willems, P. Wolper, A direct symbolic approach to model checking pushdown systems, in: Infinity'97, Technical Report, Univ. Uppsala, 1997.
15. T. Jéron, C. Jard, Testing for unboundedness of Fifo channels, Theoret. Comput. Sci. 113(1) (1993) 93-117.
16. S. Melzer, J. Esparza, Checking system properties via integer programming, in: ESOP'96, Lecture Notes in Computer Science, vol. 1058, Springer, Berlin, 1996.
17. Jan Pachl, Protocol description and analysis based on a state transition model with channel expressions, in: Protocol Specification, Testing, and Verification VII, Elsevier Science Publishers, North-Holland, 1987, pp. 207-219.
18. W. Peng, S. Puroshothaman, Data flow analysis of communicating finite state machines, ACM Trans. Programming Languages Systems 13(3) (1991) 399-442.
19. Y.M. Quemener, T. Jéron, Finitely representing infinite reachability graphs of CFSMs with graph grammars, in: FORTE/PSTV'96, Chapman & Hall, New York, 1996.