Communicating sequential processes
Communicating sequential processes
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Principles of Program Analysis
Principles of Program Analysis
Process algebra and Markov chains
Lectures on formal methods and performance analysis
A partial order approach to branching time logic model checking
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Static analysis for systems biology
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Computer Languages, Systems and Structures
Program analysis and compilation, theory and practice
| Hi-index | 0.00 |
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.