Conference paper
Reachability for Finite-State Process Algebras Using Static Analysis
In
Lecture Notes in Computer Science
—
2011, pp. 231-244
Abstract
In this work we present an algorithm for solving the reachability problem in finite systems that are modelled with process algebras. Our method uses Static Analysis, in particular, Data Flow Analysis, of the syntax of a process algebraic system with multi-way synchronisation. The results of the Data Flow Analysis are used in order to “cut off” some of the branches in the reachability analysis that are not important for determining, whether or not a state is reachable.
In this way, it is possible for our reachability algorithm to avoid building large parts of the system altogether and still solve the reachability problem in a precise way.
| Language: | English |
|---|---|
| Publisher: | Springer |
| Year: | 2011 |
| Pages: | 231-244 |
| Proceedings: | International Workshop on Reachability Problems |
| Series: | Lecture Notes in Computer Science |
| Journal subtitle: | 5th Internationalworkshop, Rp 2011 Genoa, Italy, September 28-30, 2011, Proceedings |
| ISBN: | 3642242871 , 364224288X , 364224288x , 9783642242878 and 9783642242885 |
| ISSN: | 03029743 |
| Types: | Conference paper |
| DOI: | 10.1007/978-3-642-24288-5_20 |
| ORCIDs: | Nielson, Flemming |
Keywords
Other keywords
