Advertisement

Span(Graph): A categorical algebra of transition systems

  • Piergiulio Katis
  • N. Sabadini
  • R. F. C. Walters
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1349)

Abstract

We have shown that a natural algebraic structure on Span(Graph) allows the compositional specification of concurrent systems. Hoare's parallel operation appears as a derived operation in this algebra. The simpler basic operations of our algebra are possible because we do not insist on interleaving semantics: interleaving prevents consideration of the identity span, as well as other natural constants such as the diagonal. We have given some examples of transforming systems using the equations of the algebra. Associated to the algebra there is a geometry which expresses the distributed nature of a concurrent system. This relation between algebra and geometry makes precise the relation between process algebras and circuit diagrams as used, for example, in Ebergen [E87].

Keywords

Label Transition System Process Algebra Concurrent System Initial Vertex Distributive Category 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [A94]
    A. Arnold, Finite transition systems, Prentice Hall, 1994.Google Scholar
  2. [B67]
    J. Bènabou, Introduction to bicategories, Reports of the Midwest Category Seminar, Lecture Notes in Mathematics 47, pages 1–77, Springer-Verlag, 1967.Google Scholar
  3. [BSW96]
    S. Bloom, N. Sabadini, R.F.C Walters, Matrices, machines and behaviors, Applied Categorical Structures, 4: 343–360, 1996.Google Scholar
  4. [BJ94]
    C. Brown C. and A. Jeffrey, Allegories of circuits, in: Proc. Logical Foundations of Computer Science, St Petersburg, 1994.Google Scholar
  5. [CW87]
    A. Carboni and R.F.C. Walters, Cartesian Bicategories I, Journal of Pure and Applied Algebra, 49, pages 11–32, 1987.Google Scholar
  6. [E87]
    J.C. Ebergen, Translating Programs into Delay-insensitive Circuits, PhD thesis, Eindhoven University of Technology, 1987.Google Scholar
  7. [GKW96]
    Robbie Gates, P. Katis and R.F.C. Walters, A program for computing with the cartesian bicategory Span (Graph), School of Mathematics and Statistics, University of Sydney, 1996.Google Scholar
  8. [H85]
    C.A.R. Hoare, Communicating sequential processes, Prentice Hall, Englewood Cliffs, NJ, 1985.Google Scholar
  9. [JS90]
    G. Jones and M. Sheeran, Circuit design in Ruby, in: Formal methods for VLSI design, North-Holland, 1990Google Scholar
  10. [JS91]
    A. Joyal and R. Street, An introduction to Tanaka duality and quantum groups, Category Theory 1990, Como, Lecture Notes in Mathematics 1488, Springer Verlag, 1991.Google Scholar
  11. [JS93]
    A. Joyal and R. Street, Braided tensor categories, Advances in Mathematics, 102: 20–78, 1993.Google Scholar
  12. [K95]
    C. Kassel, Quantum Groups, Graduate Texts in Mathematics, Springer-Verlag, New York, 1995.Google Scholar
  13. [KSW94]
    P. Katis, N. Sabadini, R.F.C. Walters, The bicategory of circuits, Computing: Australian Theory Seminar, UTS, Sydney, 1994.Google Scholar
  14. [KSW97]
    P. Katis, N. Sabadini, R.F.C. Walters, Bicategories of processes, Journal of Pure and Applied Algebra, 115, no.2, pp 141–178, 1997Google Scholar
  15. [K96]
    P. Katis, Categories and bicategories of processes, PhD Thesis, University of Sydney, 1996.Google Scholar
  16. [KW93]
    W. Khalil and R.F.C. Walters, An imperative language based on distributive categories II, Informatique Théorique et Applications, 27, 503–522, 1993.Google Scholar
  17. [M70]
    S. Mac Lane, Categories for the working mathematician, Springer Verlag, 1970.Google Scholar
  18. [M95]
    Majid, Foundations of quantum field theory, Cambridge 1995.Google Scholar
  19. [P81]
    D. Park, Concurrency and automata on infinite sequences, in 5th GI Conference on theoretical computer science, 167–183, LNCS 104, Springer, 1981.Google Scholar
  20. [P71]
    R. Penrose, Applications of negative dimensional torsors, in Combinatorial Mathematics and its applications, (D. J. A. Welsh, Ed.) pp. 221–244, Academic Press, New York, 1971.Google Scholar
  21. [RSW]
    R. Rosebrugh, N. Sabadini, R.F.C. Walters, Minimal realization in bicategories of automata, to appear, Journal of Pure and Applied Algebra.Google Scholar
  22. [SVW96]
    N. Sabadini, S. Vigna, R.F.C. Walters, A note on recursive functions, Mathematical Structures in Computer Science, 6, 127–139, 1996.Google Scholar
  23. [SW93]
    N. Sabadini and R.F.C. Walters, On functions and processors: an automata-theoretic approach to concurrency through distributive categories, School of Mathematics and Statistics Research Reports, University of Sydney, (93–7), 1993.Google Scholar
  24. [SWW93]
    N. Sabadini, R.F.C. Walters, Henry Weld, Distributive automata and asynchronous circuits, Category Theory and Computer Science 5, Amsterdam, 28–32, 1993.Google Scholar
  25. [SWW94]
    N. Sabadini, R.F.C. Walters, Henry Weld, Categories of asynchronous circuits, Computing: Australian Theory Seminar, UTS, Sydney, 1994.Google Scholar
  26. [S95]
    R.H. Street, Higher categories, strings, cubes and simplex equations, Applied Categorical Structures, 3, 29–77, 1995.Google Scholar
  27. [T95]
    Turaev, Quantum invariants of knots and 3-manifolds, Featured review in Mathematical Reviews MR:95k 57014.Google Scholar
  28. [W89]
    R.F.C. Walters, Data types in a distributive category, Bull. Austr. Math. Soc., 40:79–82, 1989.Google Scholar
  29. [W92a]
    R.F.C. Walters, Categories and Computer Science, Carslaw Publications 1991, Cambridge University Press 1992.Google Scholar
  30. [W92b]
    R.F.C. Walters, An imperative language based on distributive categories, Mathematical Structures in Computer Science, 2:249–256, 1992.Google Scholar
  31. [Z85]
    W. Zielonka, Notes on Finite Asynchronous Automata, RAIRO, 27, 99–135, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Piergiulio Katis
    • 1
  • N. Sabadini
    • 2
  • R. F. C. Walters
    • 1
  1. 1.School of Mathematics and StatisticsUniversity of SydneyN.S.W.Australia
  2. 2.Dipartimento di Scienze dell'InformazioneUniversità di MilanoMilanoItaly

Personalised recommendations