Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations (1998)
Cached
Download Links
- [www.liafa.jussieu.fr]
- [www-verimag.imag.fr]
- DBLP
Other Repositories/Bibliography
| Venue: | Theoretical Computer Science |
| Citations: | 55 - 12 self |
BibTeX
@INPROCEEDINGS{Bouajjani98symbolicreachability,
author = {Ahmed Bouajjani and Peter Habermehl},
title = {Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations},
booktitle = {Theoretical Computer Science},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We address the verification problem of FIFO-channel systems. We apply the symbolic analysis principle to these systems. We represent their sets of configurations using structures called CQDD's combining finite-state automata with linear arithmetical constraints on number of occurrences of symbols. We show that CQDD's allow forward and backward reachability analysis of systems with nonregular sets of configurations. Moreover, we prove that CQDD's allow to compute the exact effect of the repeated execution of any fixed cycle in the transition graph of a system. We use this fact to define a generic reachability analysis semi-algorithm parametrized by a set of cycles \Theta. Given a set of configurations, this semi-algorithm performs a least fixpoint calculation to construct the set of its successors (or predecessors). At each step, this calculation is accelerated by considering the cycles in \Theta as additional "meta-transitions" in the transition graph, generalizing the approach of [5].
Citations
No citations identified.
