Where can I get gas round here? — an application of a design methodology for distributed systems

  • Rainer Weber
Part II Requirements And Design
Part of the Lecture Notes in Computer Science book series (LNCS, volume 490)


The first two phases, viz. requirement specification and design specification, of a design methodology for distributed systems are applied to the specification of a gas station. The methodology which is based on streams of actions is explained for this example, problems arising are discussed. Special attention is paid to the structuring of specifications.


Design Specification Temporal Logic Input Stream Output Stream Abstract Data Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bode, Händler 83]
    A. Bode, W. Händler: Rechnerarchitektur II. Berlin-Heidelberg-New York-Tokyo, Springer, 1983Google Scholar
  2. [Brock, Ackerman 81]
    J.D. Brock, W.B. Ackerman: Scenarios: A Model of Non-deterministic Computation. In: J. Diay, I. Ramos (Eds.): Foundations of Programming Concepts, Intern. Coll. Peniscola, Spain, 1981, Springer Lecture Notes in Computer Science 107, pp. 252–259Google Scholar
  3. [Broy, Streicher 87]
    M. Broy, T. Streicher: Specification and Design of Shared Resource Arbitration. MIP-8721, Universität Passau, 1987Google Scholar
  4. [Broy 88a]
    M. Broy: An Example for the Design of Distributed Systems in a Formal Setting: The Lift Problem, MIP-8802, Universität Passau, 1988Google Scholar
  5. [Broy 88b]
    M. Broy: Towards a Design Methodology for Distributed Systems. In: M. Broy (Ed.): Constructive Methods in Computing Science. Berlin-Heidelberg-New York-Tokyo, Springer, 1989, pp. 331–364Google Scholar
  6. [Dubois et al. 88]
    E. Dubois, J. Hagelstein, A. Rifaut: Formal Requirements Engineering with ERAE. draft version, to appear in the Philips Journal of Research, October 1988Google Scholar
  7. [Jones 83]
    C.B. Jones: Tentative Steps Toward a Development Method for Interfering Programs. ACM Transactions on Programming Languages and Systems, Vol. 5., No. 4, October 1983, pp. 596–619Google Scholar
  8. [Kahn 74]
    G. Kahn: The Semantics of a Simple Language for Parallel Programming. Information Processing 74, North-Holland Publishing Company, 1974Google Scholar
  9. [Kröger 87]
    F. Kröger: Abstract modules: Combining algebraic and temporal logic specification means. Technique Et Science Informatique, Vol. 6, No. 6, 1987, pp. 559–573Google Scholar
  10. [Lamport 89]
    L. Lamport: A Simple Approach to Specifying Concurrent Systems. CACM, Vol. 32, No. 1, January 1989, pp. 32–45Google Scholar
  11. [Loeckx, Sieber 84]
    J. Loeckx, K. Sieber: The Foundations of Program Verification. Wiley-Teubner, 1984Google Scholar
  12. [Wirsing et al. 83]
    M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy: On Hierarchies of Abstract Data Types. Acta Informatica 20, 1983, pp. 1–33Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Rainer Weber
    • 1
  1. 1.Fakultät für Mathematik und InformatikUniversität PassauPassau

Personalised recommendations