On the parameterized algebraic specification of concurrent systems

  • E. Astesiano
  • G. F. Mascari
  • G. Reggio
  • M. Wirsing
Colloquium On Trees In Algebra And Programming Specifications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 185)


A technique for specifying concurrent systems is shown, that uses the algebraic specification language ASL. A system is algebraically specified as a transition system and a concurrent system is the result of composing systems by three basic operations: synchronization, parallel composition and monitoring. These operations are schematically described using the parameterization concept of ASL and they are in the same time examples for the power of ASL since they cannot be formally specified in other specification languages. Each particular synchronization, parallel composition or monitoring is defined by instantiating on appropriate parameters a unique specification, which produces a transition system out of an input transition system. By combining the three operations we obtain a formal support for a methodology of hierarchical and modular specification of concurrent systems. Moreover it is shown that combining tools for defining semantics in ASL with the above parameterized schema provides a standard way for giving to a concurrent system a variety of semantics depending on observability constraints.


Transition System Operational Semantic Parallel Composition Concurrent System Synchronous Action 
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.


  1. [AMMR]
    E.Astesiano,F.Mazzanti,U.Montanari,G.Reggio: Design and formal specification of a family of distributed architectures. Quaderni CNET n. 88,ETS Pisa, 1983.Google Scholar
  2. [AMRZ]
    E.Astesiano,F.Mazzanti,G.Reggio,E.Zucca: Formal specification of a concurrent architecture in a real project. To appear in Proc. of ICS'85 ACM (International Computing Symposium), 1985.Google Scholar
  3. [AR]
    E.Astesiano,G.Reggio: A unifying viewpoint for the constructive specification of cooperation, concurrency and distribution. Quaderni CNET n.115, ETS PISA, 1983.Google Scholar
  4. [BaWo]
    F.L.Bauer,H.Wossner: Algorithmic language and program development, Springer Verlag Berlin, 1982.Google Scholar
  5. [BW1]
    M.Broy,M.Wirsing: On the algebraic specification of finitary infinite communicating sequential processes. In Proc. IFIP TC2 Working Conference on "Formal Description of Programming Concepts II", Garmisch 1982.Google Scholar
  6. [BW2]
    M. Broy,M. Wirsing: Partial abstract types. Acta Informatica 18, 47–64, 1982.CrossRefGoogle Scholar
  7. [BW3]
    M.Broy,M.Wirsing: Generalized heterogeneous algebras and partial interpretations. In Proc. CAAP 83, Lecture Notes in Computer Science n. 159, Springer Verlag Berlin, 1983.Google Scholar
  8. [M1]
    R.Milner: A calculus of communicating systems. Lecture Notes in Computer Science n.92, Springer Verlag Berlin, 1980.Google Scholar
  9. [M2]
    R. Milner: Calculi for synchrony and asvnchrony. TCS 25, 267–310, 1983.CrossRefGoogle Scholar
  10. [Mo]
    P. Mosses: A basic abstract semantic algebra. In Proc. Semantics of Types, Lecture Notes in Computer Science, Springer Verlag, Berlin, 1984.Google Scholar
  11. [P]
    G.Plotkin: A structural approach to operational semantics. Lecture notes, Aarhus University, 1981.Google Scholar
  12. [P1]
    G.Plotkin: An operational semantics for CSP. In Proc. IFIP TC2 Working Conference on "Formal Description of Programming Concepts II", Garmisch 1982.Google Scholar
  13. [SW]
    D.T.Sannella,M.Wirsing: A kernel language for algebraic specification and implementation. In Proc. Int. Conf. on Foundations of Computation Theory, Borgholm Sweden, Lecture Notes in Computer Science n.158, 1983.Google Scholar
  14. [W]
    M.Wirsing: Structured algebraic specifications: a kernel language. Habilitation thesis, Technische University Munchen, 1983.Google Scholar
  15. [WPPDB]
    M. Wirsing,P. Pepper,H. Partsch,W. Dosch,M. Broy: On the hierarchies of abstract types. Acta Informatica 20, 1–33, 1983.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • E. Astesiano
    • 1
  • G. F. Mascari
    • 2
  • G. Reggio
    • 1
  • M. Wirsing
    • 3
  1. 1.Istituto di MatematicaUniversità di GenovaItaly
  2. 2.Collaboratore esternoIstituto Applicazioni del Calcolo C.N.R.RomaItaly
  3. 3.Fakultät für Mathematik und InformatikUniversität PassauFRG

Personalised recommendations