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.
Original language | English |
---|---|
Title of host publication | Reachability Problems : 5th InternationalWorkshop, RP 2011 Genoa, Italy, September 28-30, 2011, Proceedings |
Volume | 6945 |
Publisher | Springer |
Publication date | 2011 |
Pages | 231-244 |
ISBN (Print) | 978-3-642-24287-8 |
ISBN (Electronic) | 978-3-642-24288-5 |
DOIs | |
Publication status | Published - 2011 |
Event | 5th International Workshop on Reachability Problems - Genoa, Italy Duration: 28 Sept 2011 → 30 Sept 2011 Conference number: 5 |
Conference
Conference | 5th International Workshop on Reachability Problems |
---|---|
Number | 5 |
Country/Territory | Italy |
City | Genoa |
Period | 28/09/2011 → 30/09/2011 |
Series | Lecture Notes in Computer Science |
---|---|
ISSN | 0302-9743 |
Keywords
- Static analysis
- Reachability
- Process algebra