Advertisement

Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems

  • Taolue Chen
  • Bas Ploeger
  • Jaco van de Pol
  • Tim A. C. Willemse
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4703)

Abstract

In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving Parameterized Boolean Equation Systems. We prove correctness, and illustrate the approach with an unbounded queue example. We also provide some adaptations to obtain similar transformations for weak bisimulation and simulation equivalence.

Keywords

Model Check Equivalence Check Label Transition System Predicate Variable Focus Method 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Andersen, H.R.: Model checking and boolean graphs. Theoretical Computer Science 126(1), 3–30 (1994)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Andersen, H.R., Vergauwen, B.: Efficient checking of behavioural relations and modal assertions using fixed-point inversion. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 142–154. Springer, Heidelberg (1995)Google Scholar
  4. 4.
    Basten, T.: Branching bisimilarity is an equivalence indeed! Information Processing Letters 58, 141–147 (1996)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Bolognesi, T., Brinksma, E.: Introduction to the ISO specification language LOTOS. Computer Networks 14, 25–59 (1987)Google Scholar
  6. 6.
    Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading (1988)MATHGoogle Scholar
  7. 7.
    Chen, T., Ploeger, B., van de Pol, J., Willemse, T.A.C.: Equivalence checking for infinite systems using parameterized boolean equation systems. CS-Report 07-14, Technische Universiteit Eindhoven (2007)Google Scholar
  8. 8.
    Cleaveland, R., Steffen, B.: Computing behavioural relations, logically. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) Automata, Languages and Programming. LNCS, vol. 510, pp. 127–138. Springer, Heidelberg (1991)Google Scholar
  9. 9.
    Fokkink, W., Pang, J., van de Pol, J.: Cones and foci: A mechanical framework for protocol verification. Formal Methods in System Design 29(1), 1–31 (2006)MATHCrossRefGoogle Scholar
  10. 10.
    van Glabbeek, R.: The Linear Time - Branching Time Spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66–81. Springer, Heidelberg (1993)Google Scholar
  11. 11.
    van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM 43, 555–600 (1996)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Groote, J.F., Mateescu, R.: Verification of temporal properties of processes in a setting with data. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol. 1548, pp. 74–90. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  13. 13.
    Groote, J.F., van de Pol, J.: A bounded retransmission protocol for large data packets. In: Nivat, M., Wirsing, M. (eds.) AMAST 1996. LNCS, vol. 1101, pp. 536–550. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  14. 14.
    Groote, J.F., Reniers, M.: Algebraic process verification. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 1151–1208. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  15. 15.
    Groote, J.F., Vaandrager, F.W.: An efficient algorithm for branching bisimulation and stuttering equivalence. In: Paterson, M.S. (ed.) Automata, Languages and Programming. LNCS, vol. 443, pp. 626–638. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  16. 16.
    Groote, J.F., Willemse, T.A.C.: Model-checking processes with data. Science of Computer Programming 56(3), 251–273 (2005)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Groote, J.F., Willemse, T.A.C.: Parameterised boolean equation systems. Theoretical Computer Science 343(3), 332–369 (2005)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Kwak, H., Choi, J., Lee, I., Philippou, A.: Symbolic weak bisimulation for value-passing calculi. Technical Report, MS-CIS-98-22, Department of Computer and Information Science, University of Pennsylvania (1998)Google Scholar
  19. 19.
    Lin, H.: Symbolic transition graph with assignment. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 50–65. Springer, Heidelberg (1996)Google Scholar
  20. 20.
    Lynch, N., Tuttle, M.: An introduction to input/output automata. CWI Quarterly 2(3), 219–246 (1989)MATHMathSciNetGoogle Scholar
  21. 21.
    Mader, A.: Verification of modal properties using boolean equation systems. PhD Thesis, VERSAL 8, Bertz Verlag, Berlin (1997)Google Scholar
  22. 22.
    Mateescu, R.: A generic on-the-fly solver for alternation-free boolean equation systems. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol. 2619, pp. 81–96. Springer, Heidelberg (2003)Google Scholar
  23. 23.
    Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1980)MATHGoogle Scholar
  24. 24.
    Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)MATHGoogle Scholar
  25. 25.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (Part I/II). Information and Computation 100(1), 1–77 (1992)MATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal of Computing 16(6), 973–989 (1987)MATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5(2), 285–309 (1955)MATHMathSciNetGoogle Scholar
  28. 28.
    Zhang, D., Cleaveland, R.: Fast generic model-checking for data-based systems. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 83–97. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Taolue Chen
    • 1
  • Bas Ploeger
    • 2
  • Jaco van de Pol
    • 1
    • 2
  • Tim A. C. Willemse
    • 2
  1. 1.CWI, Department of Software Engineering, P.O. Box 94079, 1090 GB AmsterdamThe Netherlands
  2. 2.Eindhoven University of Technology, Design and Analysis of Systems Group, P.O. Box 513, 5600 MB EindhovenThe Netherlands

Personalised recommendations