Skip to main content
SpringerLink
Log in

Equivalence-Checking with Infinite-State Systems: Techniques and Results

  • Conference paper
  • First Online:
SOFSEM 2002: Theory and Practice of Informatics (SOFSEM 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2540))

Abstract

The paper presents an overview of techniques and results for equivalence-checking with infinite-state systems. The selection of presented techniques reflects the authors’ view on recent development in the area; the overview of existing results should be up-to-date (as of August 2002).

Supported by the Grant Agency of Czech Republic, grant No. 201/00/1023.

Supported by the Grant Agency of Czech Republic, grant No. 201/00/0400.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P.A. Abdulla and K. Cerāns. Simulation is decidable for one-counter nets. In Proceedings of CONCUR’98, vol. 1466 of LNCS, pp. 253–268. Springer, 1998. 68

    Google Scholar 

  2. P.A. Abdulla, K. Čerāns, B. Jonsson, and Y.-K. Tsay. General decidability theorems for infinite-state systems. In Proceedings of LICS’96, pp. 160–170. IEEE, 1996. 68

    Google Scholar 

  3. P.A. Abdulla and M. Kindahl. Decidability of simulation and bisimulation between lossy channel systems and finite state systems. In Proceedings of CONCUR’ 95, vol. 962 of LNCS, pp. 333–347. Springer, 1995. 67, 68

    Google Scholar 

  4. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. On the consistency of Koomen’s fair abstraction rule. TCS, 51(1):129–176, 1987. 44

    Article  MATH  MathSciNet  Google Scholar 

  5. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. JACM, 40:653–682, 1993. 66

    Article  MATH  MathSciNet  Google Scholar 

  6. J.C.M. Baeten and W.P. Weijland. Process Algebra. No. 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990. 47

    Google Scholar 

  7. J. Blanco. Normed BPP and BPA. In Proceedings of ACP’94, Workshops in Computing, pp. 242–251. Springer, 1995. 66

    Google Scholar 

  8. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. I&C, 98(2):142–170, 1992. 44

    MATH  MathSciNet  Google Scholar 

  9. O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. In Handbook of Process Algebra, pp. 545–623. Elsevier, 2001. 45

    Google Scholar 

  10. O. Burkart, D. Caucal, and B. Steffen. An elementary decision procedure for arbitrary context-free processes. In Proceedings of MFCS’95, vol. 969 of LNCS, pp. 423–433. Springer, 1995. 66

    Google Scholar 

  11. O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Proceedings of CONCUR’96, vol. 1119 of LNCS, pp. 247–262. Springer, 1996. 68

    Google Scholar 

  12. D. Caucal. Graphes canoniques des graphes algébriques. Informatique Théorique et Applications (RAIRO), 24(4):339–352, 1990. 53, 66

    MATH  MathSciNet  Google Scholar 

  13. I. Černá, M. Křetínský, and A. Kučera. Comparing expressibility of normed BPA and normed BPP processes. Acta Informatica, 36(3):233–256, 1999. 66

    Article  MathSciNet  MATH  Google Scholar 

  14. S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, The University of Edinburgh, 1993. 47

    Google Scholar 

  15. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for all basic parallel processes. In Proceedings of CONCUR’93, vol. 715 of LNCS, pp. 143–157. Springer, 1993. 66

    Google Scholar 

  16. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. I&C, 121:143–148, 1995. 66

    MATH  Google Scholar 

  17. E.M. Clark, O. Grumberg, and D.A. Peled. Model Checking. The MIT Press, 1999. 44

    Google Scholar 

  18. E.A. Emerson. Temporal and modal logic. Handbook of TCS, B:995–1072, 1991. 42

    Google Scholar 

  19. J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. In Proceedings of FCT’95, vol. 965 of LNCS, pp. 221–232. Springer, 1995. 67

    Google Scholar 

  20. J. Esparza. Decidability of model checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997. 59

    Article  MathSciNet  Google Scholar 

  21. E.P. Friedman. The inclusion problem for simple languages. TCS, 1(4):297–316, 1976. 68

    Article  MATH  Google Scholar 

  22. J.F. Groote. A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters, 42:167–171, 1992. 66

    Article  MATH  MathSciNet  Google Scholar 

  23. Y. Hirshfeld. Petri nets and the equivalence problem. In Proceedings of CSL’93, vol. 832 of LNCS, pp. 165–174. Springer, 1994. 68, 69

    Google Scholar 

  24. Y. Hirshfeld. Bisimulation trees and the decidability of weak bisimulations. ENTCS, 5, 1996. 67

    Google Scholar 

  25. Y. Hirshfeld and M. Jerrum. Bisimulation equivalence is decidable for normed process algebra. In Proceedings of ICALP’99, vol. 1644 of LNCS, pp. 412–421. Springer, 1999. 66

    Google Scholar 

  26. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. TCS, 158:143–159, 1996. 54, 66

    Article  MATH  MathSciNet  Google Scholar 

  27. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. MSCS, 6:251–259, 1996. 54, 66

    MATH  MathSciNet  Google Scholar 

  28. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979. 47, 56, 60, 69

    Google Scholar 

  29. H. Hüttel and C. Stirling. Actions speak louder than words: Proving bisimilarity for context-free processes. Journal of Logic and Computation, 8(4):485–509, 1998. 66

    Article  MATH  MathSciNet  Google Scholar 

  30. D.T. Huynha and L. Tian. Deciding bisimilarity of normed context-free processes is in ∑p 2. TCS, 123:183–197, 1994

    Article  Google Scholar 

  31. P. Jančar. New results for bisimilarity on basic parallel processes. A short presentation at Infinity 2002 workshop. 66

    Google Scholar 

  32. P. Jančar. Highundecida bility of weak bisimilarity for Petri nets. In Proceedings of CAAP’95, vol. 915 of LNCS, pp. 349–363. Springer, 1995. 67

    Google Scholar 

  33. P. Jančar. Undecidability of bisimilarity for Petri nets and some related problems. TCS, 148(2):281–301, 1995. 61, 67

    Google Scholar 

  34. P. Jančar. Decidability of bisimilarity for one-counter processes. I&C, 158(1):1–17, 2000. 66, 68

    MATH  Google Scholar 

  35. P. Jančar and J. Esparza. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP’96, vol. 1099 of LNCS, pp. 478–489. Springer, 1996. 67, 68

    Google Scholar 

  36. P. Jančar and A. Kučera. Bisimilarity of processes with finite-state systems. ENTCS, 9, 1997. 57, 67

    Google Scholar 

  37. P. Jančar, A. Kučera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. TCS, 258(1-2):409–433, 2001. 56, 57, 67

    Article  MATH  Google Scholar 

  38. P. Jančar, A. Kučera, and F. Moller. Simulation and bisimulation over onecounter processes. In Proceedings of STACS 2000, vol. 1770 of LNCS, pp. 334–345. Springer, 2000. 49, 69

    Google Scholar 

  39. P. Jančar, A. Kučera, F. Moller, and Z. Sawa. Equivalence-checking with onecounter automata: A generic method for proving lower bounds. In Proceedings of FoSSaCS 2002, vol. 2303 of LNCS, pp. 172–186. Springer, 2002. 68, 69

    Google Scholar 

  40. P. Jančar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR’95, vol. 962 of LNCS, pp. 348–362. Springer, 1995. 57, 67, 68, 69

    Google Scholar 

  41. P. Jančar, F. Moller, and Z. Sawa. Simulation problems for one-counter machines. In Proceedings of SOFSEM’99, vol. 1725 of LNCS, pp. 404–413. Springer, 1999. 68

    Google Scholar 

  42. D. Kozen. Results on the propositional μ-calculus. TCS, 27:333–354, 1983. 58

    Article  MATH  MathSciNet  Google Scholar 

  43. A. Kučera. Effective decomposability of sequential behaviours. TCS, 242(1-2):71–89, 2000. 66

    Article  MATH  Google Scholar 

  44. A. Kučera. Efficient verification algorithms for one-counter processes. In Proceedings of ICALP 2000, vol. 1853 of LNCS, pp. 317–328. Springer, 2000. 66, 67

    Google Scholar 

  45. A. Kučera. On simulation-checking with sequential systems. In Proceedings of ASIAN 2000, vol. 1961 of LNCS, pp. 133–148. Springer, 2000. 69

    Google Scholar 

  46. A. Kučera and R. Mayr. On the complexity of semantic equivalences for pushdown automata and BPA. In Proceedings of MFCS 2002, vol. 2420 of LNCS, pp. 433–445. Springer, 2002. 59, 60, 61, 64, 67, 69

    Google Scholar 

  47. A. Kučera and R. Mayr. Simulation preorder over simple process algebras. I&C, 173(2):184–198, 2002. 48, 62, 68, 69

    MATH  Google Scholar 

  48. A. Kučera and R. Mayr. Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. TCS, 270(1-2):677–700, 2002. 54, 56, 67

    Article  MATH  Google Scholar 

  49. A. Kučera and R. Mayr. Why is simulation harder than bisimulation? In Proceedings of CONCUR 2002, vol. 2421 of LNCS, pp. 594–609. Springer, 2002. 50, 52

    Google Scholar 

  50. R. Lipton. The reachability problem requires exponential space. Technical report 62, Yale University, 1976. 68

    Google Scholar 

  51. R. Mayr. Weak bisimulation and model checking for basic parallel processes. In Proceedings of FST&TCS’96, vol. 1180 of LNCS, pp. 88–99. Springer, 1996. 67

    Google Scholar 

  52. R. Mayr. On the complexity of bisimulation problems for basic parallel processes. In Proceedings of ICALP 2000, vol. 1853 of LNCS, pp. 329–341. Springer, 2000. 66, 67, 68

    Google Scholar 

  53. R. Mayr. On the complexity of bisimulation problems for pushdown automata. In Proceedings of IFIP TCS’2000, vol. 1872 of LNCS, pp. 474–488. Springer, 2000. 67, 68

    Google Scholar 

  54. R. Mayr. Decidability of model checking with the temporal logic EF. TCS, 256:31–62, 2001. 59

    Article  MATH  MathSciNet  Google Scholar 

  55. R. Milner. Communication and Concurrency. Prentice-Hall, 1989. 43, 53, 55, 57

    Google Scholar 

  56. M.L. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967. 61

    Google Scholar 

  57. F. Moller. Infinite results. In Proceedings of CONCUR’96, vol. 1119 of LNCS, pp. 195–216. Springer, 1996. 45, 47, 48

    Google Scholar 

  58. D.E. Muller and P.E. Schupp. The theory of ends, pushdown automata, and second order logic. TCS, 37(1):51–75, 1985. 60

    Article  MATH  MathSciNet  Google Scholar 

  59. Ch. Papadimitriou. Computational Complexity. Addison-Wesley, 1994. 63

    Google Scholar 

  60. D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, vol. 104 of LNCS, pp. 167–183. Springer, 1981. 43

    Google Scholar 

  61. D. Sangiorgi. On the proof method for bisimulation. In Proceedings of MFCS’95, vol. 969 of LNCS, pp. 479–488. Springer, 1995. 53

    Google Scholar 

  62. Ph. Schnoebelen. Bisimulation and other undecidable equivalences for lossy channel systems. In Proceedings of TACS’2001, vol. 2215 of LNCS, pp. 385–399. Springer, 2001. 67

    Google Scholar 

  63. G. Sénizergues. The equivalence problem for deterministic pushdown automata is decidable. In Proceedings of ICALP’97, vol. 1256 of LNCS, pp. 671–681. Springer, 1997. 67

    Google Scholar 

  64. G. Sénizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. In Proceedings of FOCS’98, pp. 120–129. IEEE, 1998. 66

    Google Scholar 

  65. J. Srba. Applications of the existential quantification technique. A short presentation at Infinity 2002 workshop. 67

    Google Scholar 

  66. J. Srba. Complexity of weak bisimilarity and regularity for BPA and BPP. MSCS. To appear. 67

    Google Scholar 

  67. J. Srba. Strong bisimilarity and regularity of basic parallel processes is PSPACEhard. In Proceedings of STACS 2002, vol. 2285 of LNCS, pp. 535–546. Springer, 2002. 66, 68

    Google Scholar 

  68. J. Srba. Strong bisimilarity and regularity of basic process algebra is PSPACEhard. In Proceedings of ICALP 2002, vol. 2380 of LNCS, pp. 716–727. Springer, 2002. 66, 68

    Google Scholar 

  69. J. Srba. Undecidability of weak bisimilarity for PA-processes. In Proceedings of DLT 2002, LNCS. Springer, 2002. To appear. 67

    Google Scholar 

  70. J. Srba. Undecidability of weak bisimilarity for pushdown processes. In Proceedings of CONCUR 2002, vol. 2421 of LNCS, pp. 579–593. Springer, 2002. 67

    Google Scholar 

  71. B. Steffen and A. Ingólfsdóttir. Characteristic formulae for processes with divergence. I&C, 110(1):149–163, 1994. 58

    MATH  Google Scholar 

  72. C. Stirling. Modal and temporal logics. Handbook of Logic in Comp. Sci., 2:477–563, 1992. 42

    MathSciNet  Google Scholar 

  73. C. Stirling. Decidability of bisimulation equivalence for normed pushdown processes. TCS, 195:113–131, 1998. 67

    Article  MATH  MathSciNet  Google Scholar 

  74. C. Stirling. Modal and Temporal Properties of Processes. Springer, 2001. 42

    Google Scholar 

  75. C. Stirling. Deciding DPDA equivalence is primitive recursive. In Proceedings of ICALP 2002, vol. 2380 of LNCS, pp. 821–832. Springer, 2002. 67

    Google Scholar 

  76. J. Stříbrná. Hardness results for weak bisimilarity of simple process algebras. ENTCS, 18, 1998. 67

    Google Scholar 

  77. W. Thomas. On the Ehrenfeucht-Fraïssé game in theoretical computer science. In Proceedings of TAPSOFT’93, vol. 668 of LNCS, pp. 559–568. Springer, 1993. 42

    Google Scholar 

  78. R. van Glabbeek. The linear time-branching time spectrum. Handbook of Process Algebra, pp. 3–99, 1999. 42, 44

    Google Scholar 

  79. I. Walukiewicz. Model checking CTL properties of pushdown systems. In Proceedings of FST&TCS 2000, vol. 1974 of LNCS, pp. 127–138. Springer, 2000. 59

    Google Scholar 

  80. I. Walukiewicz. Pushdown processes: Games and model-checking. I&C, 164(2):234–263, 2001. 59, 60

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics, Masaryk University, Botanická 68a, CZ-602 00, Brno, CzechR epublic

    Antonín Kučera

  2. Dept. of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, 708 33, Ostrava, CZ, Czech Republic

    Petr Jančar

Authors
  1. Antonín Kučera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr Jančar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Science, University of Michigan - Dearborn, 4901 Evergreen Road, Dearborn, 48128, Michigan, USA

    William I. Grosky

  2. Department of Software Engineering School of Computer Science, Charles University, Malostranské nám. 25, 118 00, Prague, Czech Republic

    František Plášil

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kučera, A., Jančar, P. (2002). Equivalence-Checking with Infinite-State Systems: Techniques and Results. In: Grosky, W.I., Plášil, F. (eds) SOFSEM 2002: Theory and Practice of Informatics. SOFSEM 2002. Lecture Notes in Computer Science, vol 2540. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36137-5_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-36137-5_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00145-4

  • Online ISBN: 978-3-540-36137-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation