Skip to main content
SpringerLink
Log in

Process Spaces

  • Conference paper
  • First Online:
CONCUR 2000 — Concurrency Theory (CONCUR 2000)

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

Included in the following conference series:

Abstract

This paper presents process spaces, a general theory for systems that are made of several interacting components and layers of abstraction. Process spaces capture in a homogeneous manner diverse correctness concerns for concurrent systems and other types of systems. The main innovation of process spaces is the idea of abstract execution, which permits to set the precision and complexity of a system model by the amount of detail included in the execution model. Notwithstanding this generality, we show that process spaces admit several algebraic properties of practical significance.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben-Ari, M.: Principles of Concurrent and Distributed Programming. Prentice Hall (1990)

    Google Scholar 

  2. Brzozowski, J. A., Lou, J. J., Negulescu, R.: A characterization of finite ternary algebras. International Journal of Algebra and Computation 6 (1997) 713–721

    Article  MathSciNet  Google Scholar 

  3. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science (1983) 83–133

    Google Scholar 

  4. Dill, D.: Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. ACM distinguished dissertations. MIT Press (1989)

    Google Scholar 

  5. Ebergen, J.C.: A formal approach to designing delay-insensitive circuits. Distributed Computing 5 (1991) 107–119

    Article  MATH  Google Scholar 

  6. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall. (1985)

    Google Scholar 

  7. Josephs, M.B.: Receptive process theory. Acta Informatica 1 (1992) 17–31

    Article  MathSciNet  Google Scholar 

  8. Lamport, L., Lynch, N.: Distributed computing: models and methods. In: van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, vol. B, Formal Methods and Semantics. The MIT Press-Elsevier (1990) 1159–1196

    Google Scholar 

  9. Mallon, W., Udding, J.T., Verhoeff, T.: Analysis and applications of the XDI model. In: Int. Symp. on Advanced Research in Asynchronous Circuits and Systems (1999)

    Google Scholar 

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

    Google Scholar 

  11. Negulescu, R.: Process spaces. Technical report CS-95-48, University of Waterloo, Canada (1995)

    Google Scholar 

  12. Negulescu, R.: Event-driven verification of switch-level correctness concerns. In: Int. Conf. on Application of Concurrency to System Design, Aizu-Wakamatsu, Japan (1998) 213–223

    Google Scholar 

  13. Negulescu, R.: Process Spaces and Formal Verification of Asynchronous Circuits. Ph.D. Thesis, University of Waterloo, Canada (1998) http://macs.ece.mcgill.ca/~radu/Papers/RN_thesis.ps. gz

    Google Scholar 

  14. Negulescu, R., Peeters, A.: Verification of speed-dependences in single-rail handshake circuits. In: Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, IEEE Press (1998) 159–170

    Google Scholar 

  15. Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete-event processes. SIAM J. Control and Optimization 1 (1987) 206–230

    Article  MathSciNet  Google Scholar 

  16. Staunstrup, J.: A Formal Approach to Hardware Design. Kluwer Academic Publishers (1994)

    Google Scholar 

  17. Troelstra, A.S.: Lectures on Linear Logic. Center for the Study of Language and Information, Leland Stanford Junior University (1992)

    Google Scholar 

  18. van Glaabeek, R.J.: The linear time-branching time spectrum. In: Baeten, J.C.M., Klop, J.W. (eds.): CONCUR’ 90. LNCS 458. Springer-Verlag (1990)

    Google Scholar 

  19. Valmari, A., Kokkarinen, I.: Unbounded verification results by finite-state compositional techniques: 10any states and beyond. In: Int. Conf. on Application of Concurrency to System Design, Aizu-Wakamatsu, Japan (1998) 75–85

    Google Scholar 

  20. Verhoeff, T.: A Theory of Delay-Insensitive Systems. Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, McGill University, 3480 University St, Montreal, Quebec, Canada, H3A 2A7

    Radu Negulescu

Authors
  1. Radu Negulescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Pennsylvania State University, 220 Pond Laboratory, University Park, PA, 16802-6106, USA

    Catuscia Palamidessi

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Negulescu, R. (2000). Process Spaces. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-44618-4_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation