Advertisement

A categorical view of process refinement

  • P. Degano
  • R. Gorrieri
  • G. Rosolini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 666)

Abstract

A very general notion of refinement of event structures is presented that refines both the events and the relations of causality and conflict. It is based on a purely semantic construction based on sections of a functor between domain-like categories. The present construction is compared to others in the literature.

Keywords

Hierarchical specifications concurrent programs categories true concurrency event structures 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. Aceto and M. Hennessy. Towards Action-Refinement in Process Algebras. In A. Meyer, editor, Proc. 4th Symposium in Logic in Computer Science, pages 138–145, Asilomar. I.E.E.E. Computer Society, 1989.Google Scholar
  2. [2]
    R. Back. A Calculus of refinements for program derivations. Acta Informatica, 25, 1988.Google Scholar
  3. [3]
    P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.Google Scholar
  4. [4]
    K. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.Google Scholar
  5. [5]
    T. Coquand, C. Gunter, and G. Winskel. Domain theoretic models of polymorphism. Inform. and Comput., 81:123–167, 1989.Google Scholar
  6. [6]
    P. Darondeau and P. Degano. Event Structures, Causal Trees, and Refinements. In Proc. 15th Symp. on Mathematical Foundations of Computer Science, Lectures Notes in Computer Science vol. 452, 1990. To appear in Theo. Comp. Sci.Google Scholar
  7. [7]
    J. de Bakker, W. de Roever, and G. Rozenberg, editors. Proc. REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lectures Notes in Computer Science vol. 354. Springer-Verlag, 1989.Google Scholar
  8. [8]
    J. de Bakker, W. de Roever, and G. Rozenberg, editors. Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Lectures Notes in Computer Science vol. 430. Springer-Verlag, 1990.Google Scholar
  9. [9]
    P. Degano and R. Gorrieri. An Operational Definition of Action Refinement, submitted for publication.Google Scholar
  10. [10]
    P. Degano and R. Gorrieri. Atomic Refinement for Process Description Languages. In A. Tarlecki, editor, Proc. 16th Symp. on Mathematical Foundations of Computer Science, Lectures Notes in Computer Science vol. 520, pages 121–130. Springer-Verlag, 1991. Extended abstract, complete version in Technical Report 17-91, Hewlett-Packard Pisa Science Center, January 1991.Google Scholar
  11. [11]
    P. Degano, R. D. Nicola, and U. Montanari. Partial Ordering Descriptions and Observations of Nondeterministic Concurrent Processes. In de Bakker et al. [7], pages 438–466.Google Scholar
  12. [12]
    T. Elrda and N. Francez. Decomposition of Distributed Programs into Communication Closed Layers. Science of Computer Programming, 2, 1982.Google Scholar
  13. [13]
    R. Gallager, P. Humblet, and P. Spira. A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM TOPLAS, pages 5–1, 1983.Google Scholar
  14. [14]
    W. Janssen, M. Poel, and J. Zwiers. Action Systems and Action Refinement in the Development of Parallel Systems. In Proc. CONCUR'91, Lectures Notes in Computer Science vol. 527, pages 298–316. Springer-Verlag, 1991.Google Scholar
  15. [15]
    M. Nielsen, U. Engberg, and K. Larsen. Fully Abstract Models for a Process Language with Refinement. In de Bakker et al. [7], pages 523–548.Google Scholar
  16. [16]
    M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, part I. Theo. Comp. Sci., 13(1):85–108, 1981.Google Scholar
  17. [17]
    F. Stomp and W. de Roever. Designing Distributed Algorithms by means of Formal Sequentially Phased Reasoning. In J.-C. Bermond and M. Raynal, editors, Proc. 3rd Int. Workshop on Distributed Algorithms, Lectures Notes in Computer Science vol. 392, pages 242–253. Springer-Verlag, 1990.Google Scholar
  18. [18]
    R. van Glabbeek and U. Goltz. Equivalence Notions for Concurrent Systems and Refinement of Actions. In Proc. 14th Symp. on Mathematical Foundations of Computer Science, Lectures Notes in Computer Science vol. 379, pages 237–248. Springer-Verlag, 1989.Google Scholar
  19. [19]
    R. van Glabbeek and U. Goltz. Refinement of Action in Causality Based Models. In de Bakker et al. [8].Google Scholar
  20. [20]
    G. Winskel. Event Structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II, Lectures Notes in Computer Science vol. 255, pages 325–392. Springer-Verlag, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • P. Degano
    • 1
    • 2
  • R. Gorrieri
    • 3
  • G. Rosolini
    • 2
  1. 1.Dipartimento di InformaticaPisaItaly
  2. 2.Dipartimento di MatematicaParmaItaly
  3. 3.Dipartimento di MatematicaBolognaItaly

Personalised recommendations