Skip to main content

Processes, Objects and Finite Events: On a formal model of concurrent (hardware) systems

  • Chapter
Concurrent Computations
  • 76 Accesses

Abstract

This paper discusses aspects of the operational semantics of a set of linguistic primitives for specifying hardware systems. The primitives allow such systems to be viewed as a combination of objects and processes. Two important features of the development are the ability to deal with finite events (i.e., events having extended durations, as opposed to abstract point events), and accommodate true concurrency. These features allow the development of a notion of observational equivalence that allows systems to be viewed during appropriate “windows” of time, and that is closer to the notion used in dealing with real hardware systems. While the major applications motivating this work arose in modelling and designing hardware (VLSI) systems, many of the issues discussed are relevant in the context of general concurrent and distributed systems, and calculii for such systems.

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

Access this chapter

eBook
USD 16.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. S. Brookes, C.A.R. Hoare, and A. Roscoe. A theory of communcating sequential processes. JA CM, 31: 560–599, 1984.

    Google Scholar 

  2. L. Cardelli and P. Wegner. On understanding types, data abstraction, and polymorphism. ACM Computing Surveys, 17 (4): 471–522, December 1985.

    Article  Google Scholar 

  3. J. D. Gabbe and P. A. Subrahmanyam. An object-based representation for the evolution of VLSI designs. International Journal of Artificial Intelligence in Engineering, 2 (4): 204–223, 1987.

    Article  Google Scholar 

  4. J. A. Goguen. Parameterized programming. IEEE Trans. on Software Engg., SE-10: 528–552, September 1984.

    Google Scholar 

  5. G. Gopalakrishnan. Personal communication. 1987.

    Google Scholar 

  6. J. V. Guttag, E. Horowitz, and D. R. Musser. Abstract data types and software validation. Communications of the ACM, 21 (2): 1048–1064, December 1978.

    Article  Google Scholar 

  7. M. Hennessy and R. de Nicola. Testing equivalences for processes. Theoretical Computer Science, 34: 83–133, 1984.

    Article  Google Scholar 

  8. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. JA CM, 32: 137–161, 1985.

    Google Scholar 

  9. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall International Series in Computer Science, 1985.

    Google Scholar 

  10. R. Milner. Calculii for Synchrony and Asynchrony. Technical Report, University of Edinburgh, April 1982.

    Google Scholar 

  11. R. Milner. A Calculus of Communicating Systems. Springer Verlag, LNCS 92, 1980.

    Google Scholar 

  12. B. Moszkowski. A temporal logic for multilevel reasoning about hardware. IEEE Computer, 18 (2): 10–19, February 1985.

    Article  Google Scholar 

  13. D. R. Musser. Abstract data type verification in the AFFIRM system. IEEE Transactions on Software Engineering, SE-6(1), January 1980.

    Google Scholar 

  14. D. Park. Concurrency and automata on infinite sequences. In 5th GI Conference, Lecture Notes in Comput. Sci. 104, pages 167–183, 1981.

    Article  Google Scholar 

  15. C. L. Seitz. Self-timed VLSI Systems. In Proc. Caltech Conference on VLSI, 1979.

    Google Scholar 

  16. P. A. Subrahmanyam. LCS — A leaf cell synthesizer employing formal deduction techniques. In 24th ACM/IEEE Design Automation Conference, pages 459–465, July 1987.

    Google Scholar 

  17. P. A. Subrahmanyam. Synapse: an expert system for VLSI design. IEEE Computer, 19 (7): 78–89, July 1986.

    Article  Google Scholar 

  18. P. A. Subrahmanyam. Synthesizing VLSI circuits from behavioral specifications: a very high level silicon compiler and its theoretical basis. In F. Anceau, editor, VLSI 83: VLSI Design of Digital Systems, pages 195–210, North Holland, August 1983.

    Google Scholar 

  19. P. A. Subrahmanyam. Toward a framework for dealing with system timing in very high level silicon compilers. In G. Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis, pages 159–215, Kluwer Academic Publishers, 1988.

    Google Scholar 

  20. G. Winskel. Event structure semantics for CCS and related languages. In Proc. of the 9th ICALP, LNCS 140, pages 561–576, Springer Verlag, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Plenum Press, New York

About this chapter

Cite this chapter

Subrahmanyam, P.A. (1988). Processes, Objects and Finite Events: On a formal model of concurrent (hardware) systems. In: Tewksbury, S.K., Dickinson, B.W., Schwartz, S.C. (eds) Concurrent Computations. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-5511-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-5511-3_13

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-5513-7

  • Online ISBN: 978-1-4684-5511-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics