Skip to main content
SpringerLink
Log in

Bounded concurrency

  • Technical Contributions
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1997)

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

Included in the following conference series:

Abstract

We will study systems for which a maximal number of concurrently executing (time consuming) actions is statically fixed. Two possible mechanisms of executions of actions are studied. Either the executions can be interrupted or they cannot. In the former case we show that equivalent processes remain equivalent when the number of resources (processors) which they have at disposal is changed. In the latter case, equivalences parameterized by the number of resources create a strictly decreasing hierarchy.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Aceto. Action Refinement in Process Algebras. Cambridge University Press, 1992.

    Google Scholar 

  2. L. Aceto and M. Hennessy. Adding Action Refinement to a Finite Process Algebra. In ICALP'91, LNCS 510, pp. 506–519, 1991.

    Google Scholar 

  3. J.C.M. Baeten and J.A. Bergstra. Discrete Time Process Algebra. Formal Aspects of Computing, Vol. 8, Number 2, pp. 188–208, 1996.

    Article  Google Scholar 

  4. R.J. van Glabbeek and F. Vaandrager. The Difference between splitting in n and n+1. Technical report CS-119553, CWI, Amsterdam, 1995.

    Google Scholar 

  5. R. Gorrieri and C. Laneve. Split-and ST-Semantics for CCS. In MFCS'91, LNCS 520, pp. 170–180, 1991.

    Google Scholar 

  6. R. Gorrieri, M. Rocccetti and E. Stancampiano. A theory of processes with durational actions. Theoretical Computer Science, 140, pp. 73–94, 1995.

    Article  Google Scholar 

  7. J.F. Groote. Transition Systems Specification with Negative Premises. In CONCUR'90, LNCS 458, pp. 332–341, 1990.

    Google Scholar 

  8. D.P. Gruska. Timed Semantics Hierarchy. In SOFSEM'92, 1992.

    Google Scholar 

  9. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, New York, 1985.

    Google Scholar 

  10. R. Milner. Communication and concurrency. Prentice-Hall International, New York, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Comenius University, Mlynska dolina, 842 15, Bratislava, Slovakia

    Damas P. Gruska

Authors
  1. Damas P. Gruska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gruska, D.P. (1997). Bounded concurrency. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036184

Download citation

  • DOI: https://doi.org/10.1007/BFb0036184

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63386-0

  • Online ISBN: 978-3-540-69529-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation