State Space Reduction for Process Algebra Specifications

  • Hubert Garavel
  • Wendelin Serwe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3116)


Data-flow analysis to identify “dead” variables and reset them to an “undefined” value is an effective technique for fighting state explosion in the enumerative verification of concurrent systems. Although this technique is well-adapted to imperative languages, it is not directly applicable to value-passing process algebras, in which variables cannot be reset explicitly due to the single-assignment constraints of the functional programming style. This paper addresses this problem by performing data-flow analysis on an intermediate model (Petri nets extended with state variables) into which process algebra specifications can be translated automatically. It also addresses important issues, such as avoiding the introduction of useless reset operations and handling shared read-only variables that children processes inherit from their parents.


Network Model Root Unit Shared Variable Label Transition System Process Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading (1986)Google Scholar
  2. 2.
    Ailloud, G.: Verification in Ecrins of Lotos Programs. In: Towards Practical Verification of Lotos specifications, Universiteit Twente, Technical Report ESPRIT/ SEDOS/C2/N48.1 (1986)Google Scholar
  3. 3.
    Bozga, M., Fernandez, J.-C., Ghirvu, L.: State Space Reduction based on Live Variables Analysis. In: Cortesi, A., Filé, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 164–178. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  4. 4.
    Bozga, M., Fernandez, J.-C., Ghirvu, L.: State Space Reduction based on Live Variables Analysis. Science of Computer Programming 47(2–3), 203–220 (2003)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Bozga, M., Fernandez, J.-C., Ghirvu, L., Graf, S., Krimm, J.-P., Mounier, L.: If: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol. 1708, p. 307. Springer, Heidelberg (1999)Google Scholar
  6. 6.
    Dong, Y., Ramakrishnan, C.R.: An Optimizing Compiler for Efficient Model Checking. In: FORTE’99, Beijing, October 1999, pp. 241–256. Kluwer, Dordrecht (1999)Google Scholar
  7. 7.
    Londono, J.G.: Analyse de flot de données dans un système parallèle. Mémoire de DEA, Institut National Polytechnique de Grenoble and Université Joseph Fourier, Grenoble. Supervised by Hubert Garavel and defended on June 22, 1993 before the jury composed of Hubert Garavel, Farid Ouabdesselam, Claude Puech, and Jacques Voiron (1993)Google Scholar
  8. 8.
    Garavel, H.: Compilation et vérification de programmes Lotos. Thèse de doctorat, Université Joseph Fourier, Grenoble (November 1989)Google Scholar
  9. 9.
    Garavel, H., Lang, F., Mateescu, R.: An Overview of Cadp 2001. EASST Newsletter, 4:13–24, Also INRIA Technical Report RT-0254 (August 2002)Google Scholar
  10. 10.
    Garavel, H., Sifakis, J.: Compilation and Verification of Lotos Specifications. In: 10th International Symposium on Protocol Specification, Testing and Verification, June 1990. IFIP, pp. 379–394 (1990)Google Scholar
  11. 11.
    Graf, S., Richier, J.-L., Rodr´ıguez, C., Voiron, J.: What are the Limits of Model Checking Methods for the Verification of Real Life Protocols? In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 275–285. Springer, Heidelberg (1990)Google Scholar
  12. 12.
    Holzmann, G.J.: The Engineering of a Model Checker: The Gnu i-Protocol Case Study Revisited. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) SPIN 1999. LNCS, vol. 1680, pp. 232–244. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  13. 13.
    ISO/IEC. Lotos – A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. International Standard 8807, ISO, Genève (September 1989)Google Scholar
  14. 14.
    Melton, R., Dill, D.L.: Murphi Annotated Reference Manual (1996), Release 3.1. Updated by C. Norris Ip and Ulrich Stern. Available at

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Hubert Garavel
    • 1
  • Wendelin Serwe
    • 1
  1. 1.INRIA Rhône-Alpes / VASYMontbonnot St MartinFrance

Personalised recommendations