Formal Aspects of Computing

, Volume 7, Issue 1, pp 18–36 | Cite as

Progress assumption in concurrent systems

  • J. F. Costa
  • A. Sernadas
Article

Abstract

A denotational semantics and a sound and complete inequational proof systems for processes with varying degrees of liveness is presented. New insights onquiescence are given concerning the Jonsson characterisation of input/output system. A theory oftransational behaviour of the typecarry out until the end is developed as an application of this concept of process with liveness requirements. The proposed model fully reflects the parallel composition oftransactional requirements, giving the expected composite requirements.

Keywords

Concurrency Inequational proof systems Process algebras Liveness Quiescence Transactions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bau85]
    Bauer, F. L.et al.: The Munich Project CIP, Vol. I: The Wide Spectrum Language CIP-L. In:Lecture Notes in Computer Science 183, Springer-Verlag, 1985.Google Scholar
  2. [Bau87]
    Bauer, F. L.et al.: The Munich Project CIP, Vol. II: The Program Transformation System CIP-S. In:Lecture Notes in Computer Science 292, Springer-Verlag, 1987.Google Scholar
  3. [BHG87]
    Bernstein, P. A., Hadzilacos, V. and Goodman, N.:Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987.Google Scholar
  4. [BHR84]
    Brookes, S., Hoare, C. A. R. and Roscoe, A.: A Theory of Communicating Sequential Processes.Journal of the ACM, 31 (7) (1984).Google Scholar
  5. [Bou87]
    Boudol, G.: Atomic Actions.Bulletin EACS, 38, 136–144 (1989).Google Scholar
  6. [CGM88]
    Cellary, W., Gelenbe, E. and Morzy, T.:Concurrency Control in Distributed Database Systems, North-Holland, 1988.Google Scholar
  7. [Cos89]
    Costa, J. F.:Teoria Algébrica dos Processos Animados, MSc Thesis, available as a technical report, Universidade Técnica de Lisboa, September 1989.Google Scholar
  8. [EhS90]
    Ehrich, H.-D. and Sernadas, A.: Algebraic Implementation of Objects Over Objects. In:Lecture Notes in Computer Science 430, Springer-Verlag, 1990.Google Scholar
  9. [ESS90]
    Ehrich, H.-D., Sernadas, A. and Sernadas, C.: From Data Types to Object Types.Journal of Information Processing and Cybernetics, EIK 26 (1,2) (1990).Google Scholar
  10. [GiD85]
    Gifford, D. K. and Donahue, J. E.: Coordinating Independent Atomic Actions. In:Processings COMPCON 85, 1985.Google Scholar
  11. [GoM92]
    Gorrieri, G. and Montanari, U, “Towards Hierarchical Description of Systems; a Proof System for Strong Prefixing”, to appear in Foundations of Computer Science.Google Scholar
  12. [GoM90a]
    Gorrieri, R. and Montanari, U.: Towards Hierarchical Specifications of Systems: a Proof System for Strong Prefixing.International Journal of foundations of computer Science 1(3), 277–293, (1990).Google Scholar
  13. [GoM90b]
    Gorrieri, R. and Montanari, U.: SCONE: a Simple Calculus of Nets. In:Lecture Notes in Computer Science 458, Springer-Verlag, 1990.Google Scholar
  14. [GoM90c]
    Gorrieri, R. and Montanari, U.: A2CCS: Atomic Actions for CCS.Theoretical computer Science, 72, 203–223 (1990).Google Scholar
  15. [Gra90]
    Gray, J.: A Translational Model. In:Lecture Notes in Computer Science 85, Springer-Verlag, 1980.Google Scholar
  16. [Hen88]
    Hennessy, M.:Algebraic Theory of Processes, MIT Press, 1988.Google Scholar
  17. [Hoa85]
    Hoare, C. A. R.:Communicating Sequential Processes, Prentice-Hall, 1985.Google Scholar
  18. [JPZ91]
    Janssen, J., Poel, M. and Zwiers, J.: Action Systems and Action Refinement in Development of Parallel Systems. In:CONCUR 91, LNCS 527, pp. 298–316, 1991.Google Scholar
  19. [Jon85]
    Jonsson, B.: A Model and Proof System for Asynchronous Networks. In:Proceedings of the 4th Annual ACM Symposium on Principles on Distributed Computing, Minaka, Canada, 1985.Google Scholar
  20. [Kan81]
    Kanellakis, P. C.:The Complexity of Concurrency Control for Distributed Databases, PhD thesis, MIT, 1981.Google Scholar
  21. [MiC81]
    Misra, J. and Chandy, K.: Proofs of Networks of Processes.IEEE Transactions on Software Engineering, SE-7(4), 417–426 (1981).Google Scholar
  22. [MCS82]
    Misra, J., Chandy, K. and Smith, T.: Proving Safety and liveness of communicating processes with examples. In:Proc. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 201–208, 1982.Google Scholar
  23. [Mis84]
    Misra, J.: Reasoning About Networks of Communicating Processes. In:INRIA Advanced Nato Study Institute on Logics and Models for Verification and Specification of Concurrent Systems, Nice, France, 1984.Google Scholar
  24. [MaP92]
    Manna, Z. and Pnueli, A.:The Temporal Logic of Reactive and Concurrent Systems, Springer-Verlag, 1992.Google Scholar
  25. [NEL89]
    Nielsen, M., Engberg, U. and Larsen, K.: Fully Abstract Models for a Process Language with Refinement. In:Lecture Notes in Computer Science 354, 1989.Google Scholar
  26. [Old91]
    Olderog, E.-R.:Nets Terms and Formulas, Cambridge Tracts in Theoretical Computer Science 23, Cambridge University Press, 1991.Google Scholar
  27. [SFS89]
    Sernadas, A., Fiadeiro, J., Sernadas, C. and Ehrich, H.-D.: Basic Building Blocks of Information Systems. In: E. Falkenberg and P. Lindgreen (eds),Information System Concepts: An In-depth Analysis, North-Holland, pp. 225–246, 1989.Google Scholar
  28. [SEC90]
    Sernadas, A., Ehrich, H.-D. and Costa, J. F.: From processes to Objects.The IBNESC Journal of Research and Development, 1(1) (1990).Google Scholar
  29. [Sne85]
    Van de Snepscheut, J.: Trace Theory and VLSI Design. In:Lecture Notes in Computer Science 200, 1985.Google Scholar

Copyright information

© BCS 1995

Authors and Affiliations

  • J. F. Costa
    • 1
  • A. Sernadas
    • 1
  1. 1.INESCLisboa CodexPortugal

Personalised recommendations