Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2002: CONCUR 2002 — Concurrency Theory pp 161–176Cite as

Alphabet-Based Synchronisation is Exponentially Cheaper

  • Conference paper
  • First Online:

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

Abstract

We study the complexity of verification problems in which a preorder relation between an implementation and a specification is checked, when the specification is given as a parallel composition of processes. This problem turns out to be PSPACE- or EXPSPACE complete, depending on the type of the parallel composition operator that is used in the construction of the specification. This implies that confusion with different parallel composition operators may lead to erroneous complexity claims. We fix one such erroneous result presented in an earlier publication. We also show that the application of hiding, renaming or just one interleaving parallel composition operation to a specification for which the problem is in PSPACE, may raise the complexity of the problem to EXPSPACE-hard.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bolognesi, T. & Brinksma, E.: “Introduction to the ISO Specification Language LOTOS”. Computer Networks and ISDN Systems 14, 1987, pp. 25–59.

    Article  Google Scholar 

  2. Helovuo, J. & Valmari, A.: “Checking for CFFD-Preorder with Tester Processes”. Proc. TACAS’2000, 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 1785, Springer-Verlag 2000, pp. 283–298.

    Google Scholar 

  3. Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall 1985, 256 p.

    Google Scholar 

  4. Hopcroft, J. E., Motwani, R. & Ullman, J. D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 2001, 521 p.

    Google Scholar 

  5. Jategaonkar, L. & Meyer, A. R.: “Deciding True Concurrency Equivalences on Finite Safe Nets”. Theoretical Computer Science 154 (1), 1996, pp. 107–143.

    Article  MATH  MathSciNet  Google Scholar 

  6. Kanellakis, P. & Smolka, S.: “CCS Expressions, Finite State Processes, and Three Problems of Equivalence”. Information and Computation 86 (1), Academic Press 1990, pp. 43–68.

    Article  MATH  MathSciNet  Google Scholar 

  7. Laroussinie, F. & Schnoebelen, P.: “The State Explosion Problem from Trace to Bisimulation Equivalence”. Proc. FoSSaCS’2000, 3rd International Conference on Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science 1784, Springer-Verlag 2000, pp. 192–207.

    Google Scholar 

  8. Meyer, A. L. & Stockmeyer, L. J.: “The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Time”. Proc. 13th Annual Symposium on Switching and Automata Theory, IEEE 1972, pp. 125–129.

    Google Scholar 

  9. Meyer, A. L. & Stockmeyer, L. J.: “Word Problems—This Time with Interleaving”. Information and Computation 115 (2), 1994, pp. 293–311.

    Article  MathSciNet  Google Scholar 

  10. Milner, R.: Communication and Concurrency. Prentice Hall 1989.

    Google Scholar 

  11. Rabinovich, A.: “Complexity of Equivalence Problems for Concurrent Systems of Finite Agents”. Information and Computation 139 (2), Academic Press 1997, pp. 111–129.

    Article  MATH  MathSciNet  Google Scholar 

  12. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall 1998, 565 p.

    Google Scholar 

  13. Shukla, S. K., Hunt III, H. B., Rosenkrantz, D. J. & Stearns, R. E.: “On the Complexity of Relational Problems for Finite State Processes”. Proc. ICALP’96, 23rd International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 1099, Springer-Verlag, 1996, pp. 466–477.

    Google Scholar 

  14. Sistla, A. P. & Clarke, E. M.: “The Complexity of Propositional Linear Temporal Logics”. Journal of the ACP 32 (3), 1985, pp. 733–749.

    Article  MATH  MathSciNet  Google Scholar 

  15. Valmari, A.: “Failure-based Equivalences Are Faster Than Many Believe”. Proc. STRICT’95, Structures in Concurrency Theory, Workshops in Computing, Springer-Verlag 1995, pp. 326–340.

    Google Scholar 

  16. Valmari, A. & Tienari, M.: “Compositional Failure-Based Semantic Models for Basic LOTOS”. Formal Aspects of Computing 7, 1995, pp. 440–468.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Software Systems, Tampere University of Technology, PO Box 553, FIN-33101, Tampere, Finland

    Antti Valmari & Antti Kervinen

Authors
  1. Antti Valmari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antti Kervinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Masaryk University Brno, Botanicka 68a, 60200, Brno, Czech Republic

    Luboš Brim , Mojmír Křetínský  & Antonín Kučera ,  & 

  2. Faculty of Electrical Engineering and Informatics, Department of Computer Science, Technical University of Ostrava (VSB), 17. listopadu 15, 70833, Ostrava-Poruba, Czech Republic

    Petr Jančar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valmari, A., Kervinen, A. (2002). Alphabet-Based Synchronisation is Exponentially Cheaper. In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45694-5_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44043-7

  • Online ISBN: 978-3-540-45694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation