Skip to main content
SpringerLink
Log in

Normal Forms for Partitions and Relations

  • Conference paper
  • First Online:
Book cover Recent Trends in Algebraic Development Techniques

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1589))

Abstract

Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard, tree-like presentation of terms. Many of these approaches reveal a specic interest towards their application in the “distributed and concurrent systems” field, but an exhaustive comparison between them is diffcult because their presentations can be quite dissimilar. This work is a first step towards a unified view, which is able to recast all those formalisms into a more general one, where they can be easily compared. We introduce a general schema for describing a characteristic normal form for many algebraic formalisms, and show that those normal forms can be thought of as arrows of suitable concrete monoidal categories.

★

Research partly supported by the EC TMR Network GETGRATS through the Technical University of Berlin and the University of Pisa; and by Esprit Working Groups CONFER2 and COORDINA, through the University of Pisa.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky, S. Gay, and R. Nagarajan. Interaction categories and the foundations of typed concurrent programming. In Deductive Program Design, Nato ASI Series, pages 403–442. Springer Verlag, 1994.

    Google Scholar 

  2. Z.M. Ariola and J.W. Klop. Equational term graph rewriting. Fundamenta Informaticae, 26:207–240, 1996.

    Article  MathSciNet  Google Scholar 

  3. J.A. Bergstra and G. Stefanescu. Network algebra for synchronous and asynchronous dataflow. Technical Report Logic Group Preprint Series n. 122, Department of Philosophy, University of Utrecht, 1994.

    Google Scholar 

  4. R. Bruni, J. Meseguer, and U. Montanari. Process and term tile logic. Technical Report SRI-CSL-98-06, SRI International, 1998.

    Google Scholar 

  5. V.A. Cazanescu and G. Stefanescu. Classes of nite relations as initial abstract data types I. Discrete Mathematics, 90:233–265, 1991.

    Article  MathSciNet  Google Scholar 

  6. V.E. Cazanescu and G. Stefanescu. Towards a new algebraic foundation of flowchart scheme theory. Fundamenta Informaticae, 13:171–210, 1990.

    MathSciNet  MATH  Google Scholar 

  7. A. Corradini and F. Gadducci. A 2-categorical presentation of term graph rewriting. In Category Theory and Computer Science, volume 1290 of LNCS. Springer Verlag, 1997.

    Chapter  Google Scholar 

  8. A. Corradini and F. Gadducci. An algebraic presentation of term graphs, via gsmonoidal categories. Applied Categorical Structures, 1998. To appear.

    Google Scholar 

  9. A. Corradini and F. Gadducci. Functorial semantics for multi-algebras. Presented at WADT’98, 1998.

    Google Scholar 

  10. P. Degano, J. Meseguer, and U. Montanari. Axiomatizing the algebra of net computations and processes. Acta Informatica, 33:641–647, 1996.

    Article  MathSciNet  Google Scholar 

  11. G. Ferrari and U. Montanari. A tile-based coordination view of the asynchronous π-calculus. In Mathematical Foundations of Computer Science, volume 1295 of LNCS, pages 52–70. Springer Verlag, 1997.

    MATH  Google Scholar 

  12. G. Ferrari and U. Montanari. Tiles for concurrent and located calculi. In C. Palamidessi and J. Parrow, editors, Expressiveness in Concurrency, volume 7 of Electronic Notes in Computer Science. Elsevier Sciences, 1997.

    Google Scholar 

  13. F. Gadducci and R. Heckel. An inductive view of graph transformation. In F. Parisi-Presicce, editor, Recent Trends in Algebraic Development Techniques, volume 1376 of LNCS, pages 219–233. Springer Verlag, 1998.

    Chapter  Google Scholar 

  14. F. Gadducci and U. Montanari. Axioms for contextual net processes. In Automata, Languages and Programming, volume 1443 of LNCS, pages 296–308. Springer Verlag, 1998.

    Chapter  Google Scholar 

  15. F. Gadducci and U. Montanari. The tile model. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1999. to appear.

    Google Scholar 

  16. M. Hasegawa. Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda-calculus. In Typed Lambda Calculi and Applications, volume 1210 of LNCS, pages 196–213. Springer Verlag, 1997.

    Chapter  Google Scholar 

  17. H.-J. Hoenke. On partial recursive de nitions and programs. In M. Karpinski, editor, Fundamentals of Computations Theory, volume 56 of LNCS, pages 260–274. Springer Verlag, 1977.

    Chapter  Google Scholar 

  18. P. Katis, N. Sabadini, and R.F.C. Walters. Bicategories of processes. Journal of Pure and Applied Algebra, 115:141–178, 1997.

    Article  MathSciNet  Google Scholar 

  19. P. Katis, N. Sabadini, and R.F.C. Walters. SPAN(Graph): A categorical algebra of transition systems. In M. Johnson, editor, Algebraic Methodology and Software Technology, volume 1349 of LNCS, pages 307–321. Springer Verlag, 1997.

    Chapter  Google Scholar 

  20. F.W. Lawvere. Functorial semantics of algebraic theories. Proc. National Academy of Science, 50:869–872, 1963.

    Article  MathSciNet  Google Scholar 

  21. S. Mac Lane. Categories for the working mathematician. Springer Verlag, 1971.

    Google Scholar 

  22. J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi-Presicce, editor, Recent Trends in Algebraic Development Techniques, volume 1376 of LNCS. Springer Verlag, 1998.

    Google Scholar 

  23. J. Meseguer and U. Montanari. Mapping tile logic into rewriting logic. In F. Parisi-Presicce, editor, Recent Trends in Algebraic Development Techniques, volume 1376 of LNCS. Springer Verlag, 1998.

    Google Scholar 

  24. R. Milner. Calculi for interaction. Acta Informatica, 33:707–737, 1996.

    Article  MathSciNet  Google Scholar 

  25. U. Montanari and F. Rossi. Contextual nets. Acta Informatica, 32:545–596, 1995.

    Article  MathSciNet  Google Scholar 

  26. U. Montanari and F. Rossi. Graph rewriting, constraint solving and tiles for coordinating distributed systems. Applied Categorical Structures, 1998. To appear.

    Google Scholar 

  27. M. Pfender. Universal algebra in s-monoidal categories. Technical Report 9522, University of Munich-Department of Mathematics, 1974.

    Google Scholar 

  28. J. Power and E. Robinson. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science, 7:453–468, 1998.

    Article  MathSciNet  Google Scholar 

  29. E. Robinson and G. Rosolini. Categories of partial maps. Information and Computation, 79:95–130, 1988.

    Article  Google Scholar 

  30. V. Sassone. On the Semantics of Petri Nets: Processes, Unfolding and Infinite Computations. PhD thesis, University of Pisa-Department of Computer Science, 1994.

    Google Scholar 

  31. V. Sassone. An axiomatization of the algebra of Petri net concatenable processes. Theoret. Comput. Sci., 170:277–296, 1996.

    Article  MathSciNet  Google Scholar 

  32. M.R. Sleep, M.J. Plasmeijer, and M.C. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. Wiley, London, 1993.

    MATH  Google Scholar 

  33. G. Stefanescu. On flowchart theories: Part II. The nondeterministic case. Theoret. Comput. Sci., 52:307–340, 1987.

    Article  MathSciNet  Google Scholar 

  34. G. Stefanescu. Algebra of flownomials. Technical Report SFB-Bericht 342/16/94 A, Technical University of München, Institut für Informatik, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Univ. of Pisa, Corso Italia 40, I-56125, Pisa, Italia

    Roberto Bruni & Ugo Montanari

  2. TU Berlin, Fach. 13 Informatik, Franklinstr. 28/29, D-10587, Berlin, Germany

    Fabio Gadducci

Authors
  1. Roberto Bruni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabio Gadducci
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Lisbon, Campo Grande 1700, Lisbon, Portugal

    José Luiz Fiadeiro

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruni, R., Gadducci, F., Montanari, U. (1999). Normal Forms for Partitions and Relations. In: Fiadeiro, J.L. (eds) Recent Trends in Algebraic Development Techniques. Lecture Notes in Computer Science, vol 1589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48483-3_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-48483-3_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66246-4

  • Online ISBN: 978-3-540-48483-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation