Abstract
Higraphs, which are structures extending graphs by permitting a hierarchy of nodes, underlie a number of diagrammatic formalisms popular in computing. We provide an algebraic account of higraphs (and of a mild extension), with our main focus being on the mathematical structures underlying common operations, such as those required for understanding the semantics of higraphs and Statecharts, and for implementing sound software tools which support them.
This work has been done with the support of grant GR/M56333 and a British Council grant, and the COE budget of STA Japan.
Support of grant GR/N12480/01 and the COE budget of STA Japan is gratefully acknowledged.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Barr and C. Wells. Category Theory for Computing Science. Prentice-Hall, 1990.
Zinovy Diskin, Michael Johnson, Boris Kadish, and Frank Piessens. Universal arrow foundations for visual modelling. In Proceedings of Diagrams 2000, number 1889 in Lecture Notes in Artificial Intelligence, pages 345–360, 2000.
David Harel. Statecharts: A visual approach to complex systems. Science of Computer Programming, 8(3):231–275, 1987.
David Harel. On visual formalisms. Communications of the ACM, 31(5), 1988.
David Harel. On visual formalisms. In J. Glasgow, N.H. Narayanan, and B. Chandrasekaran, editors, Diagrammatic Reasoning: Cognitive and Computational Perspectives, pages 235–272. AAAI Press/The MIT Press, 1995.
David Harel and Amnon Naamad. The STATEMATE semantics of Statecharts. ACM Transactions on Software Engineering Methodology, 5(4), October 1996.
Saunders MacLane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer-Verlag, 1971.
F. Maraninchi. The Argos language: Graphical representation of automata and description of reactive systems. In Proceedings of the IEEE Workshop on Visual Languages, 1991.
Bonnie M. Nardi. A Small Matter of Programming: Perspectives on End-User Computing. MIT Press, 1993.
Rob Pooley and Perdita Stevens. Using UML. Addison Wesley, 1999.
John Power and Konstantinos Tourlas. An algebraic foundation for graph-based diagrams in computing. In Proceedings of the 17th Conference on the Mathematical Foundations of Programming Semantics (MFPS), 2001. To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Power, J., Tourlas, K. (2001). An Algebraic Foundation for Higraphs. In: Fribourg, L. (eds) Computer Science Logic. CSL 2001. Lecture Notes in Computer Science, vol 2142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44802-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-44802-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42554-0
Online ISBN: 978-3-540-44802-0
eBook Packages: Springer Book Archive