Formal Aspects of Computing

, Volume 7, Issue 1, pp 18–36

Progress assumption in concurrent systems

  • J. F. Costa
  • A. Sernadas
Article

DOI: 10.1007/BF01214621

Cite this article as:
Costa, J.F. & Sernadas, A. Formal Aspects of Computing (1995) 7: 18. doi:10.1007/BF01214621

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 

Copyright information

© BCS 1995

Authors and Affiliations

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

Personalised recommendations