Abstract
In this paper we discuss reachability analysis for infinite-state systems. Infinite-state systems are formalized using transition systems over a first-order structure. We establish a common ground relating a large class of algorithms by analyzing the connections between the symbolic representation of transition systems and formulas used in various reachability algorithms. Our main results are related to the so-called guarded assignment systems. © Springer-Verlag Berlin Heidelberg 2003.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci. |
| Publisher | Springer Nature |
| Pages | 222-237 |
| Number of pages | 15 |
| Volume | 2890 |
| Publication status | Published - 2003 |
| Event | Perspectives of Systems Informatics, 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, 2003, Revised Papers - Duration: 1 Jan 1824 → … http://dblp.uni-trier.de/db/conf/ershov/ershov2003.html#RybinaV03http://dblp.uni-trier.de/rec/bibtex/conf/ershov/RybinaV03.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/ershov/RybinaV03 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|
Conference
| Conference | Perspectives of Systems Informatics, 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, 2003, Revised Papers |
|---|---|
| Period | 1/01/24 → … |
| Internet address |
Keywords
- Infinite-state systems
- Model theory
- Reachability analysis
- Theoretical foundation