Languages, Rewriting systems, and Verification of Infinite-State Systems (2001)
| Venue: | in: Proc. ICALP ’01, LNCS 2076, 2001 |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Bouajjani01languages,rewriting,
author = {Ahmed Bouajjani},
title = {Languages, Rewriting systems, and Verification of Infinite-State Systems},
booktitle = {in: Proc. ICALP ’01, LNCS 2076, 2001},
year = {2001},
pages = {24--39},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Reachability Graph of the Lift Controller 13 5 Related Work Several papers propose symbolic reachability analysis techniques for infinitestate systems based on using representations of languages to define sets of configurations. In these works, sets of configurations are represented by means of various kinds of automata, regular expressions, and formulas of monadic first or second order logics (see e.g., [BG96,BEM97,BH97,BGWW97,KMM + 97,WB98] [BJNT00,PS00,FIS00]).
