Skip to main content
SpringerLink
Log in

Equivalence Checking of Non-flat Systems Is EXPTIME-Hard

  • Conference paper
CONCUR 2003 - Concurrency Theory (CONCUR 2003)

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

Included in the following conference series:

Abstract

The equivalence checking of systems that are given as a composition of interacting finite-state systems is considered. It is shown that the problem is EXPTIME-hard for any notion of equivalence that lies between bisimulation equivalence and trace equivalence, as conjectured by Rabinovich (1997). The result is proved for parallel composition of finite-state systems where hiding of actions is allowed, and for 1-safe Petri nets. The technique of the proof allows to extend this result easily to other types of ‘non-flat’ systems.

This work was sponsored by the Grant Agency of the Czech Republic, Grant No. 201/03/1161

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. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the Association for Computing Machinery 28(1), 114–133 (1981)

    MATH  MathSciNet  Google Scholar 

  2. Immerman, N.: Descriptive Complexity, pp. 53–54. Springer, Heidelberg (1998)

    Google Scholar 

  3. Jančar, P.: Nonprimitive recursive complexity and undecidability for petri net equivalences. Theoretical Computer Science 256, 23–30 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Jategaonkar, L., Meyer, A.R.: Deciding true concurrency equivalences on safe, finite nets. Theoretical Computer Science 154(1), 107–143 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Laroussinie, F., Schnoebelen, P.: The state explosion problem from trace to bisimulation equivalence. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol. 1784, pp. 192–207. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Rabinovich, A.: Complexity of equivalence problems for concurrent systems of finite agents. Information and Computation 139(2), 111–129 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Sawa, Z., Jančar, P.: P-hardness of equivalence testing on finite-state processes. In: Pacholski, L., Ružička, P. (eds.) SOFSEM 2001. LNCS, vol. 2234, p. 326. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Shukla, S.K., Hunt, H.B., Rosenkrantz, D.J., Stearns, R.E.: On the complexity of relational problems for finite state processes. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 466–477. Springer, Heidelberg (1996)

    Google Scholar 

  9. Valmari, A., Kervinen, A.: Alphabet-based synchronisation is exponentially cheaper. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, p. 161. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. van Glabbeek, R.J.: The Linear Time - Branching Time Spectrum. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 278–297. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Zdeněk Sawa

Authors
  1. Zdeněk Sawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Paris 7, PPS, Case 7014, 75205, Paris Cedex 13, France

    Roberto Amadio

  2. LIF, CNRS, Aix-Marseille Université, France

    Denis Lugiez

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sawa, Z. (2003). Equivalence Checking of Non-flat Systems Is EXPTIME-Hard. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45187-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40753-9

  • Online ISBN: 978-3-540-45187-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation