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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baier, C., Katoen, J.-P.: Principles of Model Checking (Representation and Mind Series). The MIT Press, Cambridge (2008)
Brinksma, E., Hermanns, H.: Process Algebra and Markov Chains. In: Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.) EEF School 2000 and FMPA 2000. LNCS, vol. 2090, pp. 183–231. Springer, Heidelberg (2001)
Gerth, R., Kuiper, R., Peled, D., Penczek, W.: A partial order approach to branching time logic model checking. In: Proceedings of ISTCS 1995 (1995)
Hermanns, H.: Interactive Markov Chains. LNCS, vol. 2428, pp. 129–154. Springer, Heidelberg (2002)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Nielson, F., Nielson, H.R., Hankin, C.L.: Principles of Program Analysis. Springer, Heidelberg (1999) Second printing, 2005
Nielson, F., Nielson, H.R., Priami, C., Rosa, D.: Static analysis for systems biology. In: Proceedings of WISICT 2004. Trinity College Dublin (2004)
Nielson, H.R., Nielson, F.: Data flow analysis for CCS. In: Reps, T., Sagiv, M., Bauer, J. (eds.) Wilhelm Festschrift. LNCS, vol. 4444, pp. 311–327. Springer, Heidelberg (2007)
Nielson, H.R., Nielson, F.: A monotone framework for CCS. Comput. Lang. Syst. Struct. 35(4), 365–394 (2009)
Pilegaard, H.: Language Based Techniques for Systems Biology. PhD thesis, Technical University of Denmark (2007)
Plotkin, G.D.: A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, University of Aarhus (1981)
Skrypnyuk, N.: Verification of Stochastic Process Calculi. PhD thesis, Technical University of Denmark (2011)
Skrypnyuk, N., Nielson, F.: Pathway Analysis for IMC. Journal of Logic and Algebraic Programming (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skrypnyuk, N., Nielson, F. (2011). Reachability for Finite-State Process Algebras Using Static Analysis. In: Delzanno, G., Potapov, I. (eds) Reachability Problems. RP 2011. Lecture Notes in Computer Science, vol 6945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24288-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-24288-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24287-8
Online ISBN: 978-3-642-24288-5
eBook Packages: Computer ScienceComputer Science (R0)